Class imbalance poses a significant challenge in classification tasks, often causing standard learning algorithms to become biased toward the majority class. Cost-sensitive learning (CSL) addresses this issue by assigning higher penalties to minority-class misclassifications. However, conventional CSL typically applies a uniform penalty to all minority-class instances, ignoring the fact that minority samples may differ substantially in terms of local safety, overlap, boundary ambiguity, and outlier-like behavior. Uniform penalization can therefore introduce undue bias, increasing the number of misclassifications.
In this study, we propose iCost, an instance-complexity-aware CSL framework that assigns adaptive penalties to minority-class samples according to their estimated learning difficulty. This fine-grained penalization strategy ensures fairer weighting, reduces unwarranted bias, and improves overall classification performance. Two complementary complexity estimation strategies are introduced: Neighbor-iCost, based on local neighborhood composition, and Gini-iCost, based on Gini-impurity-based feature-space partitioning. Extensive experiments on 65 binary and 10 multiclass imbalanced datasets show that iCost outperforms conventional CSL by a clear margin and remains highly competitive with widely used resampling methods. To support reproducibility and practical adoption, the proposed algorithm has been released as a scikit-learn-compatible Python package through PyPI.
This work offers a fresh perspective on imbalanced learning by integrating instance-level data complexity into the learning process, opening new avenues for developing adaptive, complexity-aware strategies for imbalanced classification.
The foundations of cost-sensitive causal classification
Faculty of Economics and Business(经济与商业学院);Katholieke Universiteit Leuven(鲁文大学);Data Analytics Laboratory(数据分析实验室);Solvay Business School(索维亚商学院);Vrije Universiteit Brussel(布鲁塞尔自由大学);Department of Applied Mathematics and Theoretical Physics(应用数学与理论物理系);University of Cambridge(剑桥大学);School of Economics and Business(经济与商业学院);University of Chile(智利大学)
Exploiting stance hierarchies for cost-sensitive stance detection of Web documents
L3S Research Center, Leibniz University of Hannover(莱布尼茨汉诺威大学L3S研究中心);Institute of Computer Science, FORTH-ICS(希腊研究与技术基金会计算机科学研究所);Dept. of CSE, IIT Patna(印度理工学院巴特那分校计算机科学与工程系);Chongqing University of Technology(重庆理工大学);GESIS - Leibniz Institute for the Social Sciences, Cologne & Heinrich-Heine-University Düsseldorf(科隆莱布尼茨社会科学研究所暨杜塞尔多夫海因里希·海涅大学)
Bayes-Optimal Fair Classification with Multiple Sensitive Features
Department of Information Systems, Arizona State University(信息系统系,亚利桑那州立大学);Department of Information Systems and Intelligent Business, School of Management, Xi’an Jiaotong University(信息系统与智能商业系,管理学院,西安交通大学)