Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Bej, Saptarshi"'
Functional linear discriminant analysis (FLDA) is a powerful tool that extends LDA-mediated multiclass classification and dimension reduction to univariate time-series functions. However, in the age of large multivariate and incomplete data, statisti
Externí odkaz:
http://arxiv.org/abs/2402.13103
Autor:
Schultz, Kristian, Bej, Saptarshi, Hahn, Waldemar, Wolfien, Markus, Srivastava, Prashant, Wolkenhauer, Olaf
Data is commonly stored in tabular format. Several fields of research are prone to small imbalanced tabular data. Supervised Machine Learning on such data is often difficult due to class imbalance. Synthetic data generation, i.e., oversampling, is a
Externí odkaz:
http://arxiv.org/abs/2206.09812
Over 85 oversampling algorithms, mostly extensions of the SMOTE algorithm, have been built over the past two decades, to solve the problem of imbalanced datasets. However, it has been evident from previous studies that different oversampling algorith
Externí odkaz:
http://arxiv.org/abs/2107.07349
Autor:
Schultz, Kristian, Bej, Saptarshi, Hahn, Waldemar, Wolfien, Markus, Srivastava, Prashant, Wolkenhauer, Olaf
Publikováno v:
In Pattern Recognition March 2024 147
Autor:
Wacker, Eike Matthias, Uellendahl-Werth, Florian, Bej, Saptarshi, Wolkenhauer, Olaf, Vesterhus, Mette, Lieb, Wolfgang, Franke, Andre, Karlsen, Tom Hemming, Folseraas, Trine, Ellinghaus, David
Publikováno v:
In JHEP Reports February 2024 6(2)
Autor:
Bej, Saptarshi, Umesh, Chaithra, Mahendra, Manjunath, Schultz, Kristian, Sarkar, Jit, Wolkenhauer, Olaf
Publikováno v:
In Machine Learning with Applications 15 December 2023 14
Autor:
Bej, Saptarshi
Barnette's conjecture is an unsolved problem in graph theory. The problem states that every 3-regular (cubic), 3-connected, planar, bipartite (Barnette) graph is Hamiltonian. Partial results have been derived with restrictions on number of vertices,
Externí odkaz:
http://arxiv.org/abs/2008.06671
The Synthetic Minority Oversampling TEchnique (SMOTE) is widely-used for the analysis of imbalanced datasets. It is known that SMOTE frequently over-generalizes the minority class, leading to misclassifications for the majority class, and effecting t
Externí odkaz:
http://arxiv.org/abs/1908.08346
Autor:
Kok, Johan, Bej, Saptarshi
Recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted by $\chi(G).$ In this paper the concepts of $\chi$'-chromatic sum and $\chi^+$-chromatic sum are introduced. The exte
Externí odkaz:
http://arxiv.org/abs/1602.03735
Autor:
Banerjee, Anirban, Bej, Saptarshi
In this article, we discuss when one can extend an r-regular graph to an r + 1 regular by adding edges. Different conditions on the num- ber of vertices n and regularity r are developed. We derive an upper bound of r, depending on n, for which, every
Externí odkaz:
http://arxiv.org/abs/1509.05476