Multi-class cost-sensitive boosting with p-norm loss functions

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 506-514

  Lozano, Aurélie C ^a   Abe, Naoki ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Boosting; Cost sensitive learning; Multi class classification

Indexed keywords

AVERAGE COSTS; BOOSTING; BOOSTING METHODS; COMPARISON METHODS; CONVERGENCE RATES; COST FUNCTIONALS; COST MINIMIZATIONS; COST SENSITIVES; COST-SENSITIVE LEARNING; EXISTING METHODS; GRADIENT BOOSTING; HIGHER ORDERS; LOSS FUNCTIONS; MULTI CLASS; MULTI-CLASS CLASSIFICATION; THEORETICAL TREATMENTS; WEIGHT INITIALIZATIONS;

EDUCATION; INFORMATION MANAGEMENT; MINING;

COSTS;

EID: 65449159444     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401953     Document Type: Conference Paper

References (18)

1. N. Abe, B. Zadrozny, and J. Langford. An iterative method for multi-class cost-sensitive learning. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 3-11, New York, NY, USA, 2004. ACM.
2. C. L. Blake and C. J. Merz. UCI repository of machine learning databases. Department of Information and Computer Sciences, University of California, Irvine, 1998. http://www.ics uci.edu/~mlearn/MLRepository.html.
3. P. Domingos. MetaCost: A general method for making classifiers cost sensitive. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining, pages 155-164. ACM Press, 1999.
4. Charles Elkan. Magical thinking in data mining: Lessons from coil challenge 2000. In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, pages 426-431. ACM Press, 2001.
5. W. Fan, S. J. Stolfo, J. Zhang, and P. K. Chan. AdaCost: Misclassification cost-sensitive boosting. In Proceedings of the Sixteenth International Conference on Machine Learning, pages 97-105, 1999.
6. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
7. U. Knoll, G. Nakhaeizadeh, and B. Tausend. Cost-sensitive pruning of decision trees. In Proceedings of the Eight European Conference on Machine Learning, pages 383-386, 1994.
8. D. Margineantu. Methods for Cost-Sensitive Learning. PhD thesis, Department of Computer Science, Oregon State University, Corvallis, 2001.
9. L. Mason, J. Baxter, P. Barlett, and M. Frean. Boosting algorithms as gradient descent. In Advances in Neural Information Processing systems 12, pages 512-158, 2000.
10. L. Mason, J. Baxter, P. Bartlett, and M. Frean. Boosting algorithms as gradient descent in function space. Technical report, RSISE, Australian National University, 1999. http://wwwsyseng.anu.edu.au/~ jon/papers/doom2.ps.gz.
11. J. Quinlan. C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann, 1993.
12. R. E. Schapire and Y. Singer. Improved boosting using confidence-rated predictions. Machine Learning, 37(3):297-336, 1999.
13. K. M. Ting. A comparative study of cost-sensitive boosting algorithms. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 983-990, 2000.
14. I. H. Witten and E. Frank. Data Mining: Practical machine learning tools with Java implementations. Morgan Kaufmann, 2000.
15. B. Zadrozny and C. Elkan. Learning and making decisions when costs and probabilities are both unknown. In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, pages 204-213. ACM Press, 2001.
16. B. Zadrozny, J. Langford, and N. Abe. Cost-sensitive learning by cost-proportionate example weighting. In Proceedings of the Third IEEE International Conference on Data Mining, pages 435-442, 2003.
17. T. Zhang. Sequential greedy approximation for certain convex optimization problems, volume IT-49, pages 682-691, 2003.
18. Z. H. Zhou and X. Y. Liu. On multi-class cost sensitive learning. In Proceedings of the 21st National Conference on Artificial Intelligence, pages 567-572, 2006.