arXiv subjects

Prashant Srivastava

Publications and source records attributed to Prashant Srivastava.

3 recordsLinked to original sources

arXiv2025

Water Nucleation via Transient Bonds to Oxygen Functionalized Graphite

We present a study the initial stages of ice growth on pristine and oxygen-functionalized highly oriented pyrolytic graphite (O-HOPG), combining low-temperature scanning tunneling microscopy (LT-STM) and machine-learning structural searches. LT-STM images show that oxygen atoms act as nucleation sites for ice growth, and that the size, structure and porosity of the nanometer-sized ice clusters depend strongly on the growth temperature. Machine learning-assisted structural searches and first-principles energy calculations confirm that clusters of water molecules are likely to bind to chemisorbed oxygen atoms through hydrogen bonding. During the early stages of the cluster growth clusters of water molecules are likely to be immobilized by binding to more than one chemisorbed oxygen atom through hydrogen bonding. However, the energy gain by hydrogen bond formation of a molecule, upon incorporation into smaller clusters only bound to a single oxygen atom, is large enough to induce cluster diffusion and favor the growth of larger ice clusters. Our results demonstrate that the mobility of water molecules is significantly lowered in the presence of defects on the surface. The observed lower mobility on defected carbon presented here offers an enhanced understanding of macroscopic anti-icing properties observed for functionalized HOPG under ambient conditions and provides insight into the early stages of ice growth on dust grain surfaces in interstellar space.

astro-ph.GA↗

arXiv2022

ConvGeN: Convex space learning improves deep-generative oversampling for tabular imbalanced classification on smaller datasets

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 common remedy used to improve classifier performance. State-of-the-art linear interpolation approaches, such as LoRAS and ProWRAS can be used to generate synthetic samples from the convex space of the minority class to improve classifier performance in such cases. Deep generative networks are common deep learning approaches for synthetic sample generation, widely used for synthetic image generation. However, their scope on synthetic tabular data generation in the context of imbalanced classification is not adequately explored. In this article, we show that existing deep generative models perform poorly compared to linear interpolation based approaches for imbalanced classification problems on smaller tabular datasets. To overcome this, we propose a deep generative model, ConvGeN that combines the idea of convex space learning with deep generative models. ConvGeN learns the coefficients for the convex combinations of the minority class samples, such that the synthetic data is distinct enough from the majority class. Our benchmarking experiments demonstrate that our proposed model ConvGeN improves imbalanced classification on such small datasets, as compared to existing deep generative models, while being at-par with the existing linear interpolation approaches. Moreover, we discuss how our model can be used for synthetic tabular data generation in general, even outside the scope of data imbalance and thus, improves the overall applicability of convex space learning.

cs.LG↗

arXiv2021

A multi-schematic classifier-independent oversampling approach for imbalanced datasets

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 algorithms have different degrees of efficiency with different classifiers. With numerous algorithms available, it is difficult to decide on an oversampling algorithm for a chosen classifier. Here, we overcome this problem with a multi-schematic and classifier-independent oversampling approach: ProWRAS(Proximity Weighted Random Affine Shadowsampling). ProWRAS integrates the Localized Random Affine Shadowsampling (LoRAS)algorithm and the Proximity Weighted Synthetic oversampling (ProWSyn) algorithm. By controlling the variance of the synthetic samples, as well as a proximity-weighted clustering system of the minority classdata, the ProWRAS algorithm improves performance, compared to algorithms that generate synthetic samples through modelling high dimensional convex spaces of the minority class. ProWRAS has four oversampling schemes, each of which has its unique way to model the variance of the generated data. Most importantly, the performance of ProWRAS with proper choice of oversampling schemes, is independent of the classifier used. We have benchmarked our newly developed ProWRAS algorithm against five sate-of-the-art oversampling models and four different classifiers on 20 publicly available datasets. ProWRAS outperforms other oversampling algorithms in a statistically significant way, in terms of both F1-score and Kappa-score. Moreover, we have introduced a novel measure for classifier independence I-score, and showed quantitatively that ProWRAS performs better, independent of the classifier used. In practice, ProWRAS customizes synthetic sample generation according to a classifier of choice and thereby reduces benchmarking efforts.

cs.LG↗