Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arkaprabha Ganguli

dblp:329/7085 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0002-5588-2157ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › dimensionality reduction
feature selection
0.812024
ENNS: Variable Selection, Regression, Classification, and Deep Neural Network for High-Dimensional Data · J. Mach. Learn. Res. 2024
Data mining
high-dimensional data analysis
0.812024
ENNS: Variable Selection, Regression, Classification, and Deep Neural Network for High-Dimensional Data · J. Mach. Learn. Res. 2024

Methods — techniques the papers use, named apart from their topics

stage-wise algorithm · 1.5regularization · 1.5ensemble methods · 1.5
YearPublicationVenuePosition
2025 Enhancing interpretability in generative modeling: statistically disentangled latent spaces guided by generative factors in scientific datasets
Arkaprabha Ganguli, Nesar Ramachandra, Julie Bessac, Emil M. Constantinescu
Mach. Learn.1
2024 ENNS: Variable Selection, Regression, Classification, and Deep Neural Network for High-Dimensional Data
abstract
High-dimensional, low-sample-size (HDLSS) data have been attracting people's attention for a long time. Many studies have proposed different approaches to dealing with this situation, among which variable selection is a significant idea. However, neural networks have been used to model complicated relationships. This paper discusses current variable selection techniques with neural networks. We showed that the stage-wise algorithm with the neural network suffers from some disadvantages, such as that the variables entering the model later may not be consistent. We also proposed an ensemble method to achieve better variable selection and proved that it has a probability tending to zero that a false variable will be selected. Moreover, we discussed further regularization to deal with over-fitting. Simulations and examples of real data are given to support the theory.
Kaixu Yang, Arkaprabha Ganguli, Tapabrata Maiti
J. Mach. Learn. Res.2
2023 A Lightweight, Effective Compressibility Estimation Method for Error-bounded Lossy Compression
abstract
Error-bounded lossy compression turns more and more important for the data-moving intensive applications to deal with big datasets efficiently in HPC environments, which often requires knowing the compressibility of the datasets before performing the compression. However, the off-the-shelf state-of-the-art lossy compressors are often driven by error bounds, so the compression ratios cannot be forecasted until the completion of the compression operation. In this paper, we propose a lightweight, robust, easy-to-train model that estimates the compressibility of datasets for different lossy compressors accurately. Our approach combines novel predictors that measure various notions of spatial correlation and smoothness exploited by lossy compressors that are implemented efficiently on the GPU in a framework and that uses mixture model regression to improve robustness with conformal prediction to provide bounds on the estimates. We then use these models with a detailed analysis of speedup to understand the tradeoffs between high speed, consistent speed, and accuracy of the methods on real applications. We evaluate our approach in the context of 3 key applications where compression ratio estimation is highly required.
Arkaprabha Ganguli, Robert Underwood, Julie Bessac, David Krasowska, Jon Calhoun 0001, Sheng Di, Franck Cappello
CLUSTER1