A multi-class cost sensitivity AdaBoost algorithm is proposed to solve the problems of high time complexity and indistinguishable cost among different classes in using the existing multi-class algorithm
which is an extension of some binary cost sensitive AdaBoost algorithms. The new algorithm uses a multi-class exponential loss function
and is named as MCCSADA. A cost sensitive multi-class exponential loss function is designed to satisfy design guidelines of cost-sensitive loss function and to ensure the cost-sensitive characteristic. Then
the loss function is used as a criterion for the evaluation of basis classifiers and the optimal weighted coefficients of base classifiers are obtained by using the forward stack model to minimize the cost loss function. Subsequently
MCCSADA is obtained by using the new loss function and weighted coefficients to replace the original loss function and coefficients in AdaBoost algorithm. MCCSADA is verified by using UCI dataset
and the results and a comparison with the CSOVO expanding from binary algorithm show that MCCSADA has lower cost and lower time complexity in most cases. The time complexity reduces by about 40% when the dataset contains three classes and reduces more with increasing number of data categories. Moreover
the stability of the algorithm is promoted
and the degeneration is weakened.
关键词
Keywords
references
LOPEZ V, FERNANDEZ A, MORENO-TORRES J G, et al. Analysis of preprocessing vs. cost-sensitive learning for imbalanced classification [J]. Expert Systems with Applications, 2012, 39(7): 6585-6608.
FREUND Y, SCHAPIRE R E. A decision theoretic generalization of on-line learning and an application to boosting [M]∥ Lecture Notes in Computer Science: Vol 904. Berlin, Germany: Springer Verlag, 1995: 23-37.
TING K M, ZHENG Z. Boosting trees for cost-sensitive classification [M]∥ Lecture Notes in Computer Science: Vol 1398. Berlin, Germany: Springer Verlag, 1999: 190-195.
FAN W, STOLFO S J, ZHANG J, et al. AdaCost: misclassification cost-sensitive boosting [C]∥Proceedings of the 16th International Conference on Machine Learning. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1999: 97-105.
SUN Y, WONG A, WANG Y. Parameter inference of cost-sensitive boosting algorithms [C]∥Proceedings of the 4th International Conference on Machine Learning and Data Mining in Pattern Recognition. Berlin, Germany: Springer-Verlag, 2005: 21-30.
SUN Y, KAMEL M S, WONG A, et al. Cost-sensitive boosting for classification of imbalanced data [J]. Pattern Recognition, 2007, 40(12): 3358-3378.
MASNADI-SHIRAZI H, VASCONCELOS N. Asymmetric boosting [C]∥Proceedings of the 24th International Conference on Machine Learning. San Francisco, CA, USA: Margan Kaufmann Publishers Inc., 2007: 609-619.
MASNADI-SHIRAZI H, VASCONCELOS N. Cost-sensitive boosting [J]. Pattern Analysis and Machine Intelligence, 2010, 33(2): 294-309.
FU Zhongliang. Cost-sensitive AdaBoost algorithm for multi-class classification problems [J]. Acta Auto Matica Sinica, 2011, 37(8): 973-983.
PAN Shirui, WU Jia, ZHU Xingquan. CogBoost: boosting for fast cost-sensitive graph classification [J]. Knowledge and Data Engineering, 2015, 27(11): 2933-2946.
YUAN Xiaohui, MOHAMED A. A multi-class boosting method for learning from imbalanced data [J]. Rough Sets and Intelligent Systems, 2015, 4(1): 13-28.
CAO Ying, MIAO Qiguang, LIU Jiacheng, et al. Fisher consistent cost sensitive boosting algorithm [J]. Journal of Software, 2013, 24(11): 2584-2596.
ZHU J, ZOU H, ROSSET S, et al. Multi-class AdaBoost [J]. Statistics and Its Interface, 2009, 2(3): 349-360.
LU Hengyang, CHEN Feiyu, XU Ming, et al. Never ignore the significance of different anomalies: a cost-sensitive algorithm based on loss function for anomaly detection [C]∥Proceedings of the 27th International Conference on Tools with Artificial Intelligence. Piscataway, NJ, USA: IEEE, 2015: 1099-1105.