arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.13007cs.LGcs.AI
收藏

iCost:一种新颖的基于实例复杂性的代价敏感学习框架

iCost: A Novel Instance-Complexity-Based Cost-Sensitive Learning Framework

Islamic University of Technology (IUT)(伊斯兰科技大学);Ahsanullah University of Science and Technology (AUST)(阿赫桑乌拉科技大学);East West University(东西大学)

Asif Newaz, Asif Ur Rahman Adib, Taskeed Jabid

AI总结:

提出iCost框架,根据实例学习难度对少数类样本自适应惩罚,解决传统代价敏感学习统一惩罚导致的偏差问题,在65个二分类和10个多分类不平衡数据集上优于传统方法。

摘要:

类别不平衡在分类任务中构成重大挑战,常导致标准学习算法偏向多数类。代价敏感学习通过给少数类误分类分配更高惩罚来解决此问题。然而,传统代价敏感学习通常对所有少数类实例施加统一惩罚,忽略了少数样本在局部安全性、重叠、边界模糊和离群行为方面的显著差异。统一惩罚因此可能引入不当偏差,增加误分类数量。在本研究中,我们提出iCost,一种实例复杂度感知的代价敏感学习框架,根据估计的学习难度对少数类样本分配自适应惩罚。这种细粒度的惩罚策略确保了更公平的加权,减少了不当偏差,并提高了整体分类性能。引入了两种互补的复杂度估计策略:基于局部邻域组成的Neighbor-iCost和基于基尼不纯度特征空间划分的Gini-iCost。在65个二分类和10个多分类不平衡数据集上的大量实验表明,iCost明显优于传统代价敏感学习,并与广泛使用的重采样方法保持高度竞争力。为支持可重复性和实际应用,所提算法已作为兼容scikit-learn的Python包通过PyPI发布。本工作通过将实例级数据复杂性融入学习过程,为不平衡学习提供了新视角,为开发自适应、复杂度感知的不平衡分类策略开辟了新途径。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑