paper-with-me

홈 › Papers

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

2021-07-15 · Saptarshi Bej, Kristian Schultz, Prashant Srivastava, Markus Wolfien, Olaf Wolkenhauer

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.

📄 PDF Abstract BibTeX arXiv:2107.07349

Code (2)

COSPOV/ProWRAS 공식 구현
zoj613/pyloras

Tasks

Benchmarking

Methods 이 논문이 사용한 방법론

SMOTE Perhaps the most widely used approach to synthesizing new examples is called the Synthetic Minority Oversampling Technique, or SMOTE for short. This technique was described by…

Similar Papers 제목 키워드 기반

Does Adversarial Oversampling Help us?

2021-08-20 · Tanmoy Dam, Md Meftahul Ferdaus, Sreenatha G. Anavatti, Senthilnath Jayavelu 외

Traditional oversampling methods are generally employed to handle class imbalance in datasets. This oversampling approach is independent of the classifier; thus, it does not offer an end-to-end solution. To overcome this…

Robust classification

GenSample: A Genetic Algorithm for Oversampling in Imbalanced Datasets

2019-10-23 · Vishwa Karia, Wen-Hao Zhang, Arash Naeim, Ramin Ramezani

Imbalanced datasets are ubiquitous. Classification performance on imbalanced datasets is generally poor for the minority class as the classifier cannot learn decision boundaries well. However, in sensitive applications l…

Fraud DetectionMedical Diagnosis

Contrastive Representation-Guided Genetic Minority Oversampling for Imbalanced Time-Series Classification

2026-08-24 · Wenbin Pei, Yunrong Hao, Zhen Liu, Guan Wang 외 arxiv

Real-world time-series classification tasks often exhibit class imbalance, which can be extremely severe in some applications. To avoid training biased classifiers on imbalanced data, sampling is one of the most popular …

Contrastive Learning

OSTSC: Over Sampling for Time Series Classification in R

2017-11-27 · Matthew Dixon, Diego Klabjan, Lan Wei

The OSTSC package is a powerful oversampling approach for classifying univariant, but multinomial time series data in R. This article provides a brief overview of the oversampling methodology implemented by the package. …

ClassificationGeneral ClassificationTime SeriesTime Series Analysis+1

Imbalanced Big Data Oversampling: Taxonomy, Algorithms, Software, Guidelines and Future Directions

2021-07-24 · William C. Sleeman IV, Bartosz Krawczyk

Learning from imbalanced data is among the most challenging areas in contemporary machine learning. This becomes even more difficult when considered the context of big data that calls for dedicated architectures capable …