Indexed metadata

Adaptive Weighting–Synthetic Minority Oversampling Technique

Shen Yan, Haifeng Guo, Xiaoming Su

Source record

Source: Crossref

Published: Sep 7, 2026

DOI: 10.3390/math14173238

Open original source ↗

Source abstract

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 classes in critical fields like healthcare and finance. Most existing oversampling methods for handling imbalance problems, such as SMOTE (the synthetic minority oversampling technique), suffer from limitations like noise sensitivity, failure to consider minority-class sub-cluster structures, and poor adaptability to the heterogeneity of sample distributions. This article addresses these issues by proposing a novel oversampling algorithm: the adaptive weighting–synthetic minority oversampling technique (AW-SMOTE). It consists of three progressive stages. In the first stage, DBSCAN (Density-Based Spatial Clustering of Applications with Noise) clustering identifies the distribution structure of the minority samples. It identifies potential sub-clusters while removing noise interference. A clear data foundation for subsequent sampling is established. In the second stage, the most representative boundary sample in each cluster is used to evaluate the weight of each cluster. The total number of synthetic samples is allocated to different clusters according to their weights. This provides global sample enhancement support. In the third stage, adaptive sample generation is performed within each cluster. It combines the two perspectives of boundary tightness and local density. The sigmoid function is used to dynamically adjust the weight ratio. Finally, new samples are synthesized in key regions to both preserve distribution characteristics and enhance discriminability in classification. Through experiments on standard datasets from the KEEL repository, the feasibility and effectiveness of this algorithm are demonstrated.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.