On multi-class cost-sensitive learning

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 567-572

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

^a NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); COST ACCOUNTING; PROBLEM SOLVING;

CLASS-IMBALANCE LEARNING; MISCLASSIFICATION COSTS; MULTI-CLASS COST-SENSITIVE LEARNING;

LEARNING SYSTEMS;

EID: 33750737002     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Abe, N.; Zadrozny, B.; and Langford, J. 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, 3-11.
2. Blake, C.; Keogh, E.; and Merz, C. J. 1998. UCI repository of machine learning databases. [http://www.ics.uci.edu/~mlearn/MLRepository.html], Department of Information and Computer Science, University of California, Irvine, CA.
3. Brefeld, U.; Geibel, P.; and Wysotzki, F. 2003. Support vector machines with example dependent costs. In Proceedings of the 14th European Conference on Machine Learning, 23-34.
4. Breiman, L.; Friedman, J. H.; Olsen, R. A.; and Stone, C. J. 1984. Classification and Regression Trees. Belmont, CA: Wadsworth.
5. Chawla, N. V.; Bowyer, K. W.; Hall, L. O.; and Kegelmeyer, W. P. 2002. SMOTE: Synthetic minority over-sampling technique. Journal of Artificial Intelligence Research 16:321-357.
6. 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, 155-164.
7. Drummond, C., and Holte, R. C. 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, 198-207.
8. Drummond, C., and Holte, R. C. 2003. C4.5, class imbalance, and cost sensitivity: Why under-sampling beats oversampling. In Working Notes of the ICML'03 Workshop on Learning from Imbalanced Data Sets.
9. Elkan, C. 2001. The foundations of cost-senstive learning. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 973-978.
10. Hand, D. J., and Till, R. J. 2001. A simple generalisation of the area under the ROC curve for multiple class classification problems. Machine Learning 45(2):171-186.
11. 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.
12. Saitta, L., ed. 2000. Machine Learning - A Technological Roadmap.
13. Ting, K. M. 2002. An instance-weighting method to induce cost-sensitive trees. IEEE Transactions on Knowledge and Data Engineering 14(3):659-665.
14. Turney, P. D. 2000. Types of cost in inductive concept learning. In Proceedings of the ICML'2000 Workshop on Cost-Sensitive Learning, 15-21.
15. Weiss, G. M. 2004. Mining with rarity - problems and solutions: A unifying framework. SIGKDD Explorations 6(1):7-19.
16. Zadrozny, B., and Elkan, C. 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, 204-213.
17. Zadrozny, B.; Langford, J.; and Abe, N. 2002. A simple method for cost-sensitive learning. Technical report, IBM.
18. Zhou, Z.-H., and Liu, X.-Y. 2006. Training cost-sensitive neural networks with methods addressing the class imbalance problem. IEEE Transactions on Knowledge and Data Engineering 18(1):63-77.