Skip to content
Open access

NADOS: Reliability-Gated Difficulty-Aware Oversampling for Noisy Imbalanced Classification

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.

Read PDF

Similar papers

Open access Sep 2026

Adaptive Weighting–Synthetic Minority Oversampling Technique

Class imbalance is prevalent in real-world datasets. Minority samples are far fewer than majority samples. Traditional classifier design typically assumes balanced data, which causes classifiers to favor the majority class when faced with imbalanced datasets. Thus, there are high misclassification costs for minority cl...

Shen Yan, Hai-Feng Guo, Xiao-Ming Su · 0 citations
Open access 2026

A Novel Entropy-Based Framework for Hybrid Sampling in Imbalanced Learning

: Imbalanced data remain a critical challenge in classification, as skewed distributions bias models toward majority classes and diminish sensitivity to minority classes, which are often the most critical. To address this issue, this paper proposes the Information Filtered Hybrid Algorithm (IF-HA), a novel entropy-base...

R. Kuo, Muhammad Rizki, F. E. Zulvia et al. · 0 citations
Aug 2026

SMOG: an adaptive hybrid oversampling framework using SMOTE and conditional GAN for difficulty-aware learning on imbalanced data

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. · 0 citations
Open access Aug 2026

ASWBoost: Classification algorithm for noisy and imbalanced data based on parametric exponential loss

AdaBoost, a classical boosting ensemble algorithm, is widely applied for its strong classification performance. However, its standard exponential loss is highly sensitive to outliers, prone to overfitting, and inherently biased toward the majority class under class-imbalanced settings, degrading overall performance. To...

Fei Meng, Mei Yan, Hang Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.