This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Test-Cost Sensitive Classification on Data with Missing Values
May 2006 (vol. 18 no. 5)
pp. 626-638
In the area of cost-sensitive learning, inductive learning algorithms have been extended to handle different types of costs to better represent misclassification errors. Most of the previous works have only focused on how to deal with misclassification costs. In this paper, we address the equally important issue of how to handle the test costs associated with querying the missing values in a test case. When an attribute contains a missing value in a test case, it may or may not be worthwhile to take the extra effort in order to obtain a value for that attribute, or attributes, depending on how much benefit the new value will bring about in increasing the accuracy. In this paper, we consider how to integrate test-cost-sensitive learning with the handling of missing values in a unified framework that includes model building and a testing strategy. The testing strategies determine which attributes to perform the test on in order to minimize the sum of the classification costs and test costs. We show how to instantiate this framework in two popular machine learning algorithms: decision trees and naive Bayesian method. We empirically evaluate the test-cost-sensitive methods for handling missing values on several data sets.

[1] T.M. Mitchell, Machine Learning. McGraw Hill, 1997.
[2] J.R. Quinlan, C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, 1993.
[3] P.D. Turney, “Types of Cost in Inductive Concept Learning,” Proc. Workshop Cost-Sensitive Learning at the 17th Int'l Conf. Machine Learning, 2000.
[4] C. Elkan, “The Foundations of Cost-Sensitive Learning,” Proc. 17th Int'l Joint Conf. Artificial Intelligence, pp. 973-978, 2001.
[5] P. Domingos, “Metacost: A General Method for Making Classifiers Cost-Sensitive,” Knowledge Discovery and Data Mining, pp. 155-164, 1999.
[6] M.T. Kai, “Inducing Cost-Sensitive Trees Via Instance Weighting,” Principles of Data Mining and Knowledge Discovery, Second European Symp., pp. 139-147, 1998.
[7] M. Nunez, “The Use of Background Knowledge in Decision Tree Induction,” Machine Learning, vol. 6, pp. 231-250, 1991.
[8] M. Tan, “Cost-Sensitive Learning of Classification Knowledge and Its Applications in Robotics,” Machine Learning J., vol. 13, pp. 7-33, 1993.
[9] C. Ling, Q. Yang, J. Wang, and S. Zhang, “Decision Trees with Minimal Costs,” Proc. 2004 Int'l Conf. Machine Learning, 2004.
[10] P.D. Turney, “Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm,” J. Artificial Intelligence Research, vol. 2, pp. 369-409, 1995.
[11] V.B. Zubek and T.G. Dietterich, “Pruning Improves Heuristic Search for Cost-Sensitive Learning,” Proc. 19th Int'l Conf. Machine Learning, pp. 27-34, 2002.
[12] R. Greiner, A. Grove, and D. Roth, “Learning Cost-Sensitive Active Classifiers,” Artificial Intelligence J., vol. 139, no. 2, pp. 137-174, 2002.
[13] X. Chai, L. Deng, Q. Yang, and C.X. Ling, “Test-Cost Sensitive Naive Bayesian Classification,” Proc. 2004 IEEE Int'l Conf. Data Mining (ICDM '04), Nov. 2004.
[14] R.O. Duda, P.E. Hart, and D.G. Stork, Pattern Classification, second ed. Wiley and Sons, Inc., 2001.
[15] P. Domingos and M. Pazzani, “On the Optimality of the Simple Bayesian Classifier Under Zero-One Loss,” Machine Learning, vol. 29, pp. 103-130, 1997.
[16] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. McGraw Hill and MIT Press, 2001.
[17] C.L. Blake and C.J. Merz, “UCI Repository of Machine Learning Databases,” http://www.ics.uci.edu/~mlearnMLRepository. html , 1998.
[18] U.M. Fayyad and K.B. Irani, Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning, pp. 1022-1027. Morgan Kaufmann, 1993.
[19] P.D. Turney, “Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm,” J. Artificial Intelligence Research (JAIR), vol. 2, pp. 369-409, 1995.
[20] M. Núñez, “Economic Induction: A Case Study,” Proc. European Working Session on Learning, pp. 139-145, 1988.
[21] M. Tan, “Cost-Sensitive Learning of Classification Knowledge and Its Applications in Robotics,” Machine Learning, vol. 13, pp. 7-33, 1993.
[22] S.W. Norton, “Generating Better Decision Trees,” Proc. Int'l Joint Conf. Artificial Intelligence, pp. 800-805, 1989.

Index Terms:
Cost-sensitive learning, decision trees, naive Bayes.
Citation:
Qiang Yang, Charles Ling, Xiaoyong Chai, Rong Pan, "Test-Cost Sensitive Classification on Data with Missing Values," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 5, pp. 626-638, May 2006, doi:10.1109/TKDE.2006.84
Usage of this product signifies your acceptance of the Terms of Use.