On multi-class cost-sensitive learning

Computational Intelligence

Volumn 26, Issue 3, 2010, Pages 232-257

  Zhou, Zhi Hua ^a   Liu, Xu Ying ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

class imbalance learning; cost sensitive learning; data mining; machine learning; multi class problems; rescaling

Indexed keywords

COST-SENSITIVE; COST-SENSITIVE LEARNING; DATA SETS; DECISION BOUNDARY; EMPIRICAL STUDIES; LEARNING COSTS; MINING MACHINES; MULTI-CLASS; MULTI-CLASS PROBLEMS; REBALANCING; RESAMPLING; RESCALING; TRAINING EXAMPLE;

COSTS; DATA MINING; IMAGE QUALITY; LEARNING SYSTEMS;

COST BENEFIT ANALYSIS;

EID: 77955034751     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.2010.00358.x     Document Type: Article

References (30)

1. Abe, N., B. Zadrozny, and J. Langford. 2004. An iterative method for multi-class cost-sensitive learning. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
2. Allwein, E. L., R. E. Schapire, and Y. Singer. 2000. Reducing multiclass to binary: A unifying approach for margin classifiers. Journal of Machine Learning Research, 1 : 113 141.
3. Blake, C., E. Keogh, and C. J. Merz. 1998. UCI repository of machine learning databases http://www.ics.uci.edu/∼mlearn/MLRepository.html
4. Brefeld, U., P. Geibel, and F. Wysotzki. 2003. Support vector machines with example dependent costs. In Proceedings of the 14th European Conference on Machine Learning. Cavtat-Dubrovnik
5. Breiman, L., J. H. Friedman, R. A. Olsen, and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth
6. Cebe, M., and C. Gunduz-Demir. 2007. Test-cost sensitive classification based on conditioned loss functions. In Proceeding of the 18th European Conference on Machine Learning. Warsaw
7. Chai, X., L. Deng, Q. Yang, and C. X. Ling. 2004. Test-cost sensitive naive Bayes classification. In Proceeding of the 4th IEEE International Conference on Data Mining.
8. Chawla, N. V., K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer. 2002. SMOTE: Synthetic minority over-sampling technique. Journal of Artificial Intelligence Research, 16 : 321 357.
9. Domingos, P. 1999. MetaCost: A general method for making classifiers cost-sensitive. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
10. Drummond, C., and R. C. Holte. 2000. Explicitly representing expected cost: An alternative to ROC representation. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
11. Drummond, C., and R. C. Holte. 2003. C4.5, class imbalance, and cost sensitivity: Why under-sampling beats over-sampling. In Working Notes of the ICML'03 Workshop on Learning from Imbalanced Data Sets.
12. Elkan, C. 2001. The foundations of cost-senstive learning. In Proceedings of the 17th International Joint Conference on Artificial Intelligence.
13. Hand, D. J., and R. J. Till. 2001. A simple generalisation of the area under the ROC curve for multiple class classification problems. Machine Learning, 45 (2 171 186.
14. Ling, C. X., Q. Yang, J. Wang, and S. Zhang. 2004. Decision trees with minimal costs. In Proceedings of the 21st International Conference on Machine Learning. Banff
15. Liu, X.-Y., and Z.-H. Zhou. 2006. The influence of class imbalance on cost-sensitive learning: An empirical study. In Proceedings of the 6th IEEE International Conference on Data Mining.
16. Lozano, A. C., and N. Abe. 2008. Multi-class cost-sensitive boosting with p-norm loss functions. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
17. Maloof, M. A. 2003. Learning when data sets are imbalanced and when costs are unequal and unknown. In Working Notes of the ICML'03 Workshop on Learning from Imbalanced Data Sets.
18. Margineantu, D. 2001. Methods for cost-sensitive learning. Ph.D. Thesis
19. Masnadi-Shirazi, H., and N. Vasconcelos. 2007. Asymmetric boosting. In Proceeding of the 24th International Conference on Machine Learning.
20. Provost, F., and P. Domingos. 2003. Tree induction for probability-based ranking. Machine Learning, 52 (3 199 215.
21. Saitta, L. (Ed.). 2000. Machine Learning - A Technological Roadmap.
22. Ting, K. M. 2002. An instance-weighting method to induce cost-sensitive trees. IEEE Transactions on Knowledge and Data Engineering, 14 (3 659 665.
23. Turney, P. D. 2000. Types of cost in inductive concept learning. In Proceedings of the ICML'2000 Workshop on Cost-Sensitive Learning.
24. Weiss, G. M. 2004. Mining with rarity - problems and solutions: A unifying framework. SIGKDD Explorations, 6 (1 7 19.
25. Witten, I. H., and E. Frank. 2005. Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations (2nd ed.). Morgan Kaufmann
26. Zadrozny, B., and C. Elkan. 2001. Learning and making decisions when costs and probabilities are both unknown. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
27. Zadrozny, B., J. Langford, and N. Abe. 2002. A simple method for cost-sensitive learning. Technical Report
28. Zhang, Y., and Z.-H. Zhou. 2008. Cost-sensitive face recognition. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
29. Zhou, Z.-H., and X.-Y. Liu. 2006a. On multi-class cost-sensitive learning. In Proceeding of the 21st National Conference on Artificial Intelligence.
30. Zhou, Z.-H., and X.-Y. Liu. 2006b. Training cost-sensitive neural networks with methods addressing the class imbalance problem. IEEE Transactions on Knowledge and Data Engineering, 18 (1 63 77.