Cost-sensitive learning and decision making revisited

European Journal of Operational Research

Volumn 166, Issue 1 SPEC. ISS., 2005, Pages 212-220

  Viaene, Stijn ^a,b   Dedene, Guido ^a,b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b VLERICK BUSINESS SCHOOL   (Belgium)

Author keywords

Classification; Cost sensitive learning; Decision analysis

Indexed keywords

CLASSIFICATION (OF INFORMATION); DECISION THEORY; ERROR ANALYSIS; OPERATIONS RESEARCH; PATTERN RECOGNITION; RANDOM PROCESSES; SEMANTICS;

COST SENSITIVE LEARNING; RECEIVER OPERATING CHARACTERISTICS (ROC);

DECISION MAKING;

EID: 13544276223     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.03.031     Document Type: Article

References (32)

1. B. Baesens, S. Viaene, D. Van den Poel, J. Vanthienen, and G. Dedene Bayesian neural network learning for repeat purchase modelling in direct marketing European Journal of Operational Research 138 1 2002 191 211
2. E. Bauer, and R. Kohavi An empirical comparison of voting classification algorithms: Bagging, boosting and variants Machine Learning 36 1-2 1999 105 139
3. J.P. Bradford, C. Kunz, R. Kohavi, C. Brunk, C.E. Brodley, Pruning decision trees with misclassification costs, in: Tenth European Conference on Machine Learning, Chemnitz, Germany, April 1998
4. A.P. Bradley The use of the area under the ROC curve in the evaluation of machine learning algorithms Pattern Recognition 30 7 1997 1145 1159
5. L. Breiman Bagging predictors Machine Learning 24 2 1996 123 140
6. L. Breiman, J.H. Friedman, R.A. Olshen, and C.J. Stone Classification and regression trees (CART) 1984 Wadsworth International Group Belmont, CA, USA
7. B. Cestnik, Estimating probabilities: A crucial task in machine learning, in: Ninth European Conference on Artificial Intelligence, Stockholm, Sweden, August 1990
8. J. Cussens. Bayes and pseudo-Bayes estimates of conditional probabilities and their reliability, in: Sixth European Conference on Machine Learning, Vienna, Austria, April 1993
9. P. Domingos Knowledge discovery via multiple models Intelligent Data Analysis 2 3 1998 187 202
10. P. Domingos, MetaCost: A general method for making classifiers cost-sensitive, in: Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 1999
11. C. Drummond, R.C. Holte, Explicitly representing expected cost: An alternative to ROC representation, in: Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA, August 2000
12. R.O. Duda, P.E. Hart, and D.G. Stork Pattern Classification 2000 Wiley New York, USA
13. C. Elkan, The foundations of cost-sensitive learning, in: Seventeenth International Joint Conference on Artificial Intelligence, Seattle, WA, USA, August 2001
14. W. Fan, S.J. Stolfo, J. Zhang, P.K. Chan. AdaCost: Misclassification cost-sensitive boosting, in: Sixteenth International Conference on Machine Learning, Bled, Slovenia, June 1999
15. Y. Freund, and R.E. Shapire A decision-theoretic generalization of on-line learning and an application to boosting Journal of Computer and System Sciences 55 1 1997 119 139
16. J.H. Friedman, T. Hastie, and R. Tibshirani Additive logistic regression: A statistical view of boosting Annals of Statistics 38 2 2000 337 374
17. J. Gama, A cost-sensitive iterative Bayes, in: Seventeenth International Conference on Machine Learning, Workshop on Cost-Sensitive Learning, Stanford, CA, USA, June-July 2000
18. D.J. Hand Construction and Assessment of Classification Rules 1997 Wiley Chichester, England
19. D.J. Hand, and R.J. Till A simple generalisation of the area under the ROC curve for multiple class classification problems Machine Learning 45 2 2001 171 186
20. J.A. Hanley, and B.J. McNeil The meaning and use of the area under a receiver operating characteristic (ROC) curve Radiology 143 1 1982 29 36
21. D.D. Margineantu, Methods for Cost-sensitive Learning, PhD thesis, Department of Computer Science, Oregon State University, Corvallis, OR, USA, 2001
22. D. Opitz, and R. Maclin Popular ensemble methods: An empirical study Journal of Artificial Intelligence Research 11 1999 169 198
23. F. Provost, and T. Fawcett Robust classification for imprecise environments Machine Learning 42 3 2001 203 231
24. F. Provost, T. Fawcett, R. Kohavi, The case against accuracy estimation for comparing classifiers, in: Fifteenth International Conference on Machine Learning, Madison, WI, USA, July 1998
25. J.R. Quinlan C4.5: Programs for Machine Learning 1993 Morgan Kaufmann San Mateo, CA, USA
26. R.E. Schapire, The boosting approach to machine learning: An overview, in: MSRI Workshop on Nonlinear Estimation and Classification, Berkeley, CA, USA, March 2002
27. R.E. Shapire, Y. Freund, P. Bartlett, and W.S. Lee Boosting the margin: A new explanation for the effectiveness of voting methods Annals of Statistics 26 5 1998 1651 1686
28. R.E. Shapire, and Y. Singer Improved boosting algorithms using confidence-rated predictions Machine Learning 37 3 1999 297 336
29. K.M. Ting, Z. Zheng, Improving the performance of boosting for naive Bayesian classification, in: Third Pacific-Asia Conference on Knowledge Discovery and Data Mining, Beijing, China, April 1999
30. G.I. Webb MultiBoosting: A technique for combining boosting and wagging Machine Learning 40 2 2000 159 196
31. B. Zadrozny, C. Elkan, Learning and making decisions when costs and probabilities are both unknown, in: Seventh ACM SIGKDD Conference on Knowledge Discovery in Data Mining, San Francisco, CA, USA, August 2001
32. B. Zadrozny, C. Elkan, Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers, in: Eighteenth International Conference on Machine Learning, Williams College, MA, USA, June-July 2001