Thresholding for making classifiers cost-sensitive

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 476-481

  Sheng, Victor S ^a   Ling, Charles X ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COST EFFECTIVENESS; LEARNING ALGORITHMS; THRESHOLD LOGIC;

META LEARNING METHODS; MISCLASSIFICATION COST; THEORETICAL THRESHOLD;

LEARNING SYSTEMS;

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

References (20)

1. Bauer, E., and Kohavi, R. 1999. An empirical comparison of voting classification algorithms: bagging, boosting and variants, Machine Learning, 36(1/2):105-139.
2. Blake, C.L., and Merz, C.J. 1998. UCI Repository of machine learning databases (website). Irvine, CA: University of California, Department of Information and Computer Science.
3. Breiman, L., Friedman, J.H., Olshen, R.A., and Stone, C.J. 1984. Classification and regression trees. Wadsworth, Belmont, CA.
4. Brieman, L. 1996. Bagging predictors. Machine Learning, 24:123-140.
5. Buhlmann, P., and Yu, B. 2003. Analyzing bagging. Annals of Statistics.
6. Chawla, N.V., Japkowicz, N., and Kolcz, A. eds. 2004. Special Issue on Learning from Imbalanced Datasets. SIGKDD, 6(1): ACM Press.
7. Domingos, P. 1999. MetaCost: A general method for making classifiers cost-sensitive. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining, 155-164, ACM Press.
8. th International Conference on Machine Learning, 239-246.
9. Drummond, C., and Holte, R.C. 2003. C4.5, Class Imbalance, and Cost Sensitivity: Why under-sampling beats over-sampling. Workshop on Learning from Imbalanced Datasets II.
10. Elkan, C. 2001. The Foundations of Cost-Sensitive Learning. In Proceedings of the Seventeenth International Joint Conference of Artificial Intelligence, 973-978. Seattle, Washington: Morgan Kaufmann.
11. Lizotte, D., Madani, O., and Greiner R. 2003. Budgeted Learning of Naïve-Bayes Classifiers. In Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence. Acapulco, Mexico: Morgan Kaufmann.
12. Michie, D., Spiegelhalter, D.J., and Taylor, C.C. 1994. Machine Learning, Neural and Statistical Classification. Ellis Horwood Limited.
13. Quinlan, J.R. eds. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann.
14. Ting, K.M. 1998. Inducing Cost-Sensitive Trees via Instance Weighting. In Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery, 23-26. Springer-Verlag.
15. Turney, P.D. 1995. Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm. Journal of Artificial Intelligence Research 2:369-409.
16. Turney, P.D. 2000. Types of cost in inductive concept learning. In Proceedings of the Workshop on Cost-Sensitive Learning at the Seventeenth International Conference on Machine Learning, Stanford University, California.
17. Weiss, G., and Provost, F. 2003. Learning when Training Data are Costly: The Effect of Class Distribution on Tree Induction. Journal of Artificial Intelligence Research 19: 315-354.
18. Wirten, I.H., and Frank, E. 2005. Data Mining - Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann Publishers.
19. Zadrozny, B., Langford, J., and Abe, N. 2003. Costsensitive learning by Cost-Proportionate instance Weighting. In Proceedings of the 3th International Conference on Data Mining.
20. Zadrozny, B. and Elkan, C. 2001. Learning and Making Decisions When Costs and Probabilities are Both Unknown. In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, 204-213.