2026· International Journal of Advanced Computer Science and Applications· 0 citations· 22 references
TL;DR
Noise-Aware Adaptive-Difficulty Oversampling (NADOS) is proposed, which separates the assessment of seed trustworthiness from the allocation of synthesis effort and provides a practical strategy for noisy imbalanced classification.
Abstract
Class imbalance becomes more challenging when minority underrepresentation is accompanied by label noise, because synthetic oversampling may amplify unreliable local structures if noisy minority samples are used as interpolation seeds. This study proposes Noise-Aware Adaptive-Difficulty Oversampling (NADOS), which separates the assessment of seed trustworthiness from the allocation of synthesis effort. NADOS evaluates each minority instance through two local criteria. A reliability score determines whether the instance is suitable for synthetic generation, while a difficulty score assigns synthesis priority among eligible instances. The method is evaluated on 22 binary imbalanced benchmark datasets, five controlled label-noise levels, four classifier families, and nine oversampling methods. Across the full benchmark, NADOS obtains average F1 = 0.7428, G-mean = 0.8511, balanced accuracy = 0.8552, and AUPRC = 0.7700. These results give NADOS the strongest average F1, G-mean, and balanced accuracy, while remaining competitive on AUPRC. Non-parametric statistical tests show significant differences among the compared methods and indicate that NADOS is consistently competitive under noisy imbalanced learning conditions. Separating seed reliability from synthesis difficulty provides a practical strategy for noisy imbalanced classification. The reliability gate limits unsafe seed usage, while the difficulty score preserves attention to difficult but trustworthy minority samples.
A novel oversampling algorithm: the adaptive weighting–synthetic minority oversampling technique (AW-SMOTE), which combines the two perspectives of boundary tightness and local density and provides global sample enhancement support.
Findings indicate that entropy-based hybrid sampling is a promising approach for structured tabular imbalanced classification, while further validation on high-dimensional text and image datasets remains necessary to establish broader generalizability.
Ren-Jieh Kuo, Muhammad Rizki, F. E. Zulvia et al.· Computers, Materials & C...· 0 citations
The results demonstrate that SVED-SMOTE significantly outperforms state-of-the-art oversampling techniques across multiple metrics, particularly in datasets with complex distributions and severe class overlap.
Jiao Wang, N. Awang· International Journal of Mac...· 1 citation
This study proposes complexity-guided cluster-based adaptive oversampling (CCAS), a novel resampling technique for low- to mid-sized imbalanced datasets that outperforms the benchmark methods across metric-classifier combinations.
Abhilash Panda, U. Chattaraj· Sādhanā· 0 citations
SMOG, an adaptive hybrid oversampling framework that integrates the Synthetic Minority Over-sampling Technique with a Conditional Generative Adversarial Network (GAN)-based difficulty-aware learning strategy, highlights the effectiveness of adaptive hybrid generative strategies for intelligent learning on imbalanced da...
Jatinder Kaur, Vimal Parmar, B. K. Rao et al.· Evolutionary Intelligence· 0 citations
ASWBoost, a robust boosting algorithm, is proposed by introducing a parameter θ to modify the exponential loss, and significantly outperforms AdaBoost, CS-AdaBoost, GBDT, SMOTEBoost, and RUSBoost, with overall performance comparable to XGBoost.
Fei Meng, Mei Yan, Hang Liu et al.· PLoS ONE· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.