A closed-form reduction of multi-class cost-sensitive learning to weighted multi-class learning

Pattern Recognition

Volumn 42, Issue 7, 2009, Pages 1572-1581

  Xia, Fen ^a   Yang, Yan wu ^a   Zhou, Liang ^a   Li, Fuxin ^a   Cai, Min ^b   Zeng, Daniel D ^a,c  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b BEIJING JIAOTONG UNIVERSITY   (China)

^c UNIVERSITY OF ARIZONA   (United States)

Author keywords

Classification; Cost sensitive learning; Statistical learning theory; Supervised learning

Indexed keywords

COST REDUCTION; STANDARDS; SUPERVISED LEARNING;

BENCHMARK DATASETS; BINARY CLASSIFICATIONS; CLASSIFICATION; CLASSIFICATION TASKS; CLOSED FORMS; COST MATRICES; COST-SENSITIVE LEARNING; DATA SPACES; MISCLASSIFICATION COSTS; MULTI CLASS; STATISTICAL LEARNING THEORY; TRAINING SETS;

EDUCATION;

EID: 62349086709     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2008.12.011     Document Type: Article

References (23)

1. Yanmin S., Mohamed K.S., Andrew W.K.C., and Yang W. Cost-sensitive boosting for classification of imbalanced data. Pattern Recognition 40 12 (2007) 3358-3378
2. Zadrozny B., and Elkan C. Learning and making decisions when costs and probabilities are both unknown. Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2001) 204-213
3. B. Zadrozny, J. Langford, N. Abe, A simple method for cost-sensitive learning, Technical Report, IBM, 2002.
4. Abe N., Zadrozny B., and Langford J. An iterative method for multi-class cost-sensitive learning. Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2004) 3-11
5. Breiman L., Friedman J.H., Olsen R.A., and Stone C.J. Classification and Regression Trees (1984), Wadsworth, Belmont, CA
6. Domingos P. MetaCost: a general method for making classifiers cost-sensitive. Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (1999) 155-164
7. Elkan C. The foundations of cost-sensitive learning. Proceedings of the 17th International Joint Conference on Artificial Intelligence (2001) 973-978
8. Ting K.M. An instance-weighting method to induce cost-sensitive trees. IEEE Transactions on Knowledge and Data Engineering 14 3 (2002) 659-665
9. C. Drummond, R.C. Holte, 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, 2003.
10. Zhou Z.-H., and Liu X.-Y. Training cost-sensitive neural networks with methods addressing the class imbalance problem. IEEE Transactions on Knowledge and Data Engineering 18 1 (2006) 63-77
11. Zhou Z.-H., and Liu X.-Y. On multi-class cost-sensitive learning. Proceedings of the 21st National Conference on Artificial Intelligence (AAAI'06) (2006) 567-572
12. Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics 23 (1952) 493-509
13. D.J. Newman, S. Hettich, C.L. Blake, C.J. Merz, UCI repository of machine learning databases, Department of Information and Computer Science, University of California, Irvine, CA, 1998 〈http://www.ics.uci.edu/mlearn/MLRepository.html〉.
14. S.D. Bay, UCI KDD archive, Department of Information and Computer Sciences, University of California, Irvine, 2000 〈http://kdd.ics.uci.edu/〉.
15. Hastie T., Tibshirani R., and Friedman J. The Elements of Statistical Learning: Data Mining, Inference, and Prediction (2001), Springer, New York
16. L. Li, H.-T. Lin, Ordinal regression by extended binary classification, Advances in Neural Information Processing Systems, vol. 19, MIT Press, Cambridge, MA, 2007.
17. Zadrozny B., Langford J., and Abe N. Cost-sensitive learning by cost-proportionate example weighting. Proceedings of the 2003 IEEE International Conference on Data Mining (ICDM'03) (2003)
18. Zadrozny B., and Elkan C. Transforming classifier scores into accurate multiclass probability estimates. Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Edmonton, Alberta, Canada, July 23-26 (2002)
19. Zadrozny B. One-benefit learning: cost-sensitive learning with restricted cost information. Proceedings of the 1st International Workshop on Utility-based Data Mining. Chicago, IL, August 21-21 (2005) 53-58
20. J. Langford, A. Beygelzimer, Sensitive error correcting output codes, in: The 18th Annual Conference on Learning Theory, June 27-30, 2005.
21. Mason L., Baxter J., Barlett P., and Frean M. Boosting algorithms as gradient descent. Advances in Neural Information Processing Systems 12 (2000) 512-518
22. Tao Q., Wu G.-W., Wang F.-Y., and Wang J. Posterior probability support vector machines for unbalanced data. IEEE Transactions on Neural Networks 16 6 (2005) 1561-1573
23. R Development Core Team, R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing, Vienna, Austria, 2007. ISBN3-900051-07-0 〈http://www.R-project.org〉.