Optimizing the Undersampling Technique by Feature Weighting for Software Defect Prediction

Abstract The class imbalance problem significantly hinders the ability of the software defect prediction models to distinguish defective (minority class) software instances from non-defective (majority class) ones. Traditional defect prediction models’ undersampling techniques have drawbacks like information loss due to discarding majority class samples and data distribution alteration causing model bias. Recently, researchers have sought to address the imbalance problem by introducing techniques that weigh the characteristics of instances. Using these weighted characteristics, samples can be ranked according to their relevance, allowing the removal of those deemed less critical to the prediction task. However, current feature weighting approaches often focus on the significance of individual features, overlooking the overall contribution of samples with high feature sums, which may carry critical information for classification tasks and risk being disproportionately removed, thereby degrading performance. This limitation reflects a feature-centric perspective that treats feature importance independently and overlooks the collective contribution of instances to the predictive task. To address this challenge, this paper proposes a Learning-to-Rank Feature Weighting (LTRFW) framework, which shifts the focus from individual features to instances by integrating a Learning-to-Rank model with Differential Evolution (DE) for feature weight optimization. The DE algorithm optimizes the weight vector by combining grid search and Pearson’s correlation analysis to rank majority-class instances and perform selective undersampling, enabling the model to retain informative samples while effectively mitigating class imbalance. Experimental results on four classifiers and 21 datasets demonstrate that LTRFW consistently outperforms existing undersampling methods, improving the F1-score by 14.8% and the AUC by 21.9% on average compared to state-of-the-art baselines such as LTRUS and COSTE. Although the average Cliff’s $$\delta$$ is approximately 0.12, indicating a small effect size, its consistent statistical significance with $$p<0.05$$ demonstrates that the improvements achieved by LTRFW are robust, reproducible, and practically meaningful.

Authors

Institutions

Publication Details

Journal
International Journal of Computational Intelligence Systems
Published
2026-03-05
DOI
https://doi.org/10.1007/s44196-026-01174-6
Primary Topic
Software Engineering Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing the Undersampling Technique by Feature Weighting for Software Defect Prediction

Siliang Suo, S. Wang, Shaojian Qiu, Xinyu Zhao et al.
International Journal of Computational Intelligence Systems
Software Engineering Research
article

Optimizing the Undersampling Technique by Feature Weighting for Software Defect Prediction

Siliang Suo, S. Wang, Shaojian Qiu, Xinyu Zhao, Lu Lu
article en

Abstract

Abstract The class imbalance problem significantly hinders the ability of the software defect prediction models to distinguish defective (minority class) software instances from non-defective (majority class) ones. Traditional defect prediction models’ undersampling techniques have drawbacks like information loss due to discarding majority class samples and data distribution alteration causing model bias. Recently, researchers have sought to address the imbalance problem by introducing techniques that weigh the characteristics of instances. Using these weighted characteristics, samples can be ranked according to their relevance, allowing the removal of those deemed less critical to the prediction task. However, current feature weighting approaches often focus on the significance of individual features, overlooking the overall contribution of samples with high feature sums, which may carry critical information for classification tasks and risk being disproportionately removed, thereby degrading performance. This limitation reflects a feature-centric perspective that treats feature importance independently and overlooks the collective contribution of instances to the predictive task. To address this challenge, this paper proposes a Learning-to-Rank Feature Weighting (LTRFW) framework, which shifts the focus from individual features to instances by integrating a Learning-to-Rank model with Differential Evolution (DE) for feature weight optimization. The DE algorithm optimizes the weight vector by combining grid search and Pearson’s correlation analysis to rank majority-class instances and perform selective undersampling, enabling the model to retain informative samples while effectively mitigating class imbalance. Experimental results on four classifiers and 21 datasets demonstrate that LTRFW consistently outperforms existing undersampling methods, improving the F1-score by 14.8% and the AUC by 21.9% on average compared to state-of-the-art baselines such as LTRUS and COSTE. Although the average Cliff’s $$\delta$$ is approximately 0.12, indicating a small effect size, its consistent statistical significance with $$p<0.05$$ demonstrates that the improvements achieved by LTRFW are robust, reproducible, and practically meaningful.

International Journal of Computational Intelligence SystemsVol. 19(1)
South China Agricultural University (CN), Electric Power Research Institute (US), Peng Cheng Laboratory (CN), China National Electric Apparatus Research Institute (China) (CN), China Southern Power Grid (China) (CN), South China University of Technology (CN)
Openalex Percentile: Top 53%
Software Engineering Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.