Details

Autor(en) / Beteiligte

• Sun, Yanmin
• Kamel, Mohamed S.
• Wong, Andrew K.C.
• Wang, Yang

Titel

Cost-sensitive boosting for classification of imbalanced data

Ist Teil von

• Pattern recognition, 2007-12, Vol.40 (12), p.3358-3378

Ort / Verlag

Oxford: Elsevier Ltd

Erscheinungsjahr

2007

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Classification of data with imbalanced class distribution has posed a significant drawback of the performance attainable by most standard classifier learning algorithms, which assume a relatively balanced class distribution and equal misclassification costs. The significant difficulty and frequent occurrence of the class imbalance problem indicate the need for extra research efforts. The objective of this paper is to investigate meta-techniques applicable to most classifier learning algorithms, with the aim to advance the classification of imbalanced data. The AdaBoost algorithm is reported as a successful meta-technique for improving classification accuracy. The insight gained from a comprehensive analysis of the AdaBoost algorithm in terms of its advantages and shortcomings in tacking the class imbalance problem leads to the exploration of three cost-sensitive boosting algorithms, which are developed by introducing cost items into the learning framework of AdaBoost. Further analysis shows that one of the proposed algorithms tallies with the stagewise additive modelling in statistics to minimize the cost exponential loss. These boosting algorithms are also studied with respect to their weighting strategies towards different types of samples, and their effectiveness in identifying rare cases through experiments on several real world medical data sets, where the class imbalance problem prevails.