The foundations of cost-sensitive learning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 973-978

  Elkan, Charles ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST-SENSITIVE CLASSIFICATION; COST-SENSITIVE LEARNING; DECISION TREE LEARNING; MISCLASSIFICATION COSTS; MISCLASSIFICATION ERROR; NEGATIVE EXAMPLES; OPTIMAL DECISIONS; PROBABILITY ESTIMATE;

ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); COSTS; DECISION MAKING; DECISION TREES; LEARNING SYSTEMS; OPTIMIZATION;

COST BENEFIT ANALYSIS;

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

References (15)

1. Eric Bauer and Ron Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, 36:105-139, 1999.
2. J. Bradford, C. Kunz, R. Kohavi, C. Brunk, and C. Brodley. Pruning decision trees with misclassification costs. In Proceedings of the European Conference on Machine Learning, pages 131-136, 1998.
3. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadswoth, Belmont, California, 1984.
4. T. G. Dietterich, M. Kearns, and Y. Mansour. Applying the weak learning framework to understand and improve C4.5. In Proceedings of the Thirteenth International Conference on Machine Learning, pages 96-104. Morgan Kaufmann, 1996.
5. Pedro Domingos and Michael Pazzani. Beyond independence: Conditions for the optimality of the simple Bayesian classifier. In Proceedings of the Thirteenth International Conference on Machine Learning, pages 105-112. Morgan Kaufmann, 1996.
6. Chris Drummond and Robert C. Holte. Exploiting the cost (in)sensitivity of decision tree splitting criteria. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 239-246, 2000.
7. N. Japkowicz. The class imbalance problem: Significance and strategies. In Proceedings of the International Conference on Artificial Intelligence, Las Vegas, June 2000.
8. M. Kearns and Y. Mansour. On the boosting ability of top-down decision tree learning algorithms. In Proceedings of the Annual ACM Symposium on the Theory of Computing, pages 459-468. ACM Press, 1996.
9. M. Kubat and S. Matwin. Addressing the curse of imbalanced training sets: One-sided sampling. In Proceedings of the Fourteenth International Conference on Machine Learning, pages 179-186. Morgan Kaufmann, 1997.
10. Dragos Margineantu. On class probability estimates and cost-sensitive evaluation of classifiers. In Workshop Notes, Workshop on Cost-Sensitive Learning, International Conference on Machine Learning, June 2000.
11. D. Michie, D. J. Spiegelhalter, and C. C. Taylor. Machine Learning, Neural and Statistical Classification. Ellis Horwood, 1994.
12. Foster Provost and Pedro Domingos. Well-trained PETs: Improving probability estimation trees. Technical Report CDER #00-04-IS, Stern School of Business, New York University, 2000.
13. Gary M. Weiss and Foster Provost. The effect of class distribution on classifier learning. Technical Report ML-TR 43, Department of Computer Science, Rutgers University, 2001.
14. Bianca Zadrozny and Charles Elkan. Learning and making decisions when costs and probabilities are both unknown. Technical Report CS2001-0664, Department of Computer Science and Engineering, University of California, San Diego, January 2001.
15. Bianca Zadrozny and Charles Elkan. Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In Proceedings of the Eighteenth International Conference on Machine Learning, 2001. To appear.