Table of Contents
Fetching ...

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

Asif Newaz, Asif Ur Rahman Adib, Taskeed Jabid

TL;DR

A novel instance complexity-based cost-sensitive approach that first categorizes all the minority-class instances based on their difficulty level and then the instances are penalized accordingly, ensuring a more equitable instance weighting and prevents excessive penalization is proposed.

Abstract

Class imbalance in data presents significant challenges for classification tasks. It is fairly common and requires careful handling to obtain desirable performance. Traditional classification algorithms become biased toward the majority class. One way to alleviate the scenario is to make the classifiers cost-sensitive. This is achieved by assigning a higher misclassification cost to minority-class instances. One issue with this implementation is that all the minority-class instances are treated equally, and assigned with the same penalty value. However, the learning difficulties of all the instances are not the same. Instances that are located in the overlapping region or near the decision boundary are harder to classify, whereas those further away are easier. Without taking into consideration the instance complexity and naively weighting all the minority-class samples uniformly, results in an unwarranted bias and consequently, a higher number of misclassifications of the majority-class instances. This is undesirable and to overcome the situation, we propose a novel instance complexity-based cost-sensitive approach (termed 'iCost') in this study. We first categorize all the minority-class instances based on their difficulty level and then the instances are penalized accordingly. This ensures a more equitable instance weighting and prevents excessive penalization. The performance of the proposed approach is tested on 65 binary and 10 multiclass imbalanced datasets against the traditional cost-sensitive learning frameworks. A significant improvement in performance has been observed, demonstrating the effectiveness of the proposed strategy.

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

TL;DR

A novel instance complexity-based cost-sensitive approach that first categorizes all the minority-class instances based on their difficulty level and then the instances are penalized accordingly, ensuring a more equitable instance weighting and prevents excessive penalization is proposed.

Abstract

Class imbalance in data presents significant challenges for classification tasks. It is fairly common and requires careful handling to obtain desirable performance. Traditional classification algorithms become biased toward the majority class. One way to alleviate the scenario is to make the classifiers cost-sensitive. This is achieved by assigning a higher misclassification cost to minority-class instances. One issue with this implementation is that all the minority-class instances are treated equally, and assigned with the same penalty value. However, the learning difficulties of all the instances are not the same. Instances that are located in the overlapping region or near the decision boundary are harder to classify, whereas those further away are easier. Without taking into consideration the instance complexity and naively weighting all the minority-class samples uniformly, results in an unwarranted bias and consequently, a higher number of misclassifications of the majority-class instances. This is undesirable and to overcome the situation, we propose a novel instance complexity-based cost-sensitive approach (termed 'iCost') in this study. We first categorize all the minority-class instances based on their difficulty level and then the instances are penalized accordingly. This ensures a more equitable instance weighting and prevents excessive penalization. The performance of the proposed approach is tested on 65 binary and 10 multiclass imbalanced datasets against the traditional cost-sensitive learning frameworks. A significant improvement in performance has been observed, demonstrating the effectiveness of the proposed strategy.
Paper Structure (26 sections, 6 equations, 17 figures, 9 tables)

This paper contains 26 sections, 6 equations, 17 figures, 9 tables.

Figures (17)

  • Figure 1: Effect of modifying weights on the decision boundary. Here, the size of points is proportional to its weight.
  • Figure 2: Class overlapping between opposite class instances
  • Figure 3: Presence of noisy instance in the data (red circle marks the noisy minority-class instances). It also illustrates small disjunct in the data.
  • Figure 4: Categorization of Minority-class instances
  • Figure 5: Categorization of Minority-class instances based on MST. The marked points represent linked examples.
  • ...and 12 more figures