Building a cost-constrained decision tree with multiple condition attributes

Information Sciences

Volumn 179, Issue 7, 2009, Pages 967-979

  Chen, Yen Liang ^a   Wu, Chia Chi ^a   Tang, Kwei ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Classification; Cost sensitive learning; Data mining; Decision analysis; Decision tree

Indexed keywords

COSTS; DATA MINING; DECISION MAKING; DECISION THEORY; DECISION TREES; INFORMATION MANAGEMENT; MATHEMATICAL MODELS; TREES (MATHEMATICS);

CLASSIFICATION; CLASSIFICATION PROCESSES; CONDITION ATTRIBUTES; COST CONSTRAINTS; COST FACTORS; DECISION ANALYSIS; DECISION ATTRIBUTES; DECISION TREE CONSTRUCTIONS; TEST COSTS;

COST BENEFIT ANALYSIS;

EID: 58349085107     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.11.032     Document Type: Article

References (19)

1. Berzal F., Cubero J.C., Marin N., and Sanchez D. Building multi-way decision trees with numerical attributes. Information Sciences 165 (2004) 73-90
2. Breiman L., Friedman J.H., Olshen R.A., and Stone C.J. Classification and Regression Trees (1984), Wadsworth, Belmont
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, San Diego, CA, ACM Press, 1999, pp. 155-164.
4. C. Elkan, The Foundations of Cost-Sensitive Learning, in: Proceeding of the Seventeenth International Joint Conference on Artificial Intelligence, 2001, pp. 973-978.
5. Han J., and Kamber M. Data Mining: Concepts and Techniques (2006), Morgan Kaufmann
6. M.T. Kai, Inducing cost-sensitive trees via instance weighting, in: Principles of Data Mining and Knowledge Discovery, Second European Symposium, Springer-Verlag, 1998, pp. 23-26.
7. Koprinska I., Poon J., Clark J., and Chan J. Learning to classify e-mail. Information Sciences 177 (2007) 2167-2187
8. Ling C.X., Sheng V.C., and Yang Q. Test strategies for cost-sensitive decision trees. IEEE Transactions on Knowledge and Data Engineering 18 8 (2006) 1055-1067
9. C.X. Ling, Q. Yang, J. Wang, S. Zhang, Decision trees with minimal costs, in: Proceedings of the 21st International Conference on Machine Learning, 2004.
10. Loh W.Y., and Shih Y.S. Split selection methods for classification trees. Statistica Sinica 7 4 (1997) 815-840
11. S.W. Norton, Generating better decision trees, in: Proceedings International Joint Conference Artificial Intelligence, MI, Morgan Kaufmann, San Mateo, CA, 1989, pp. 800-805.
12. Nunez M. The use of background knowledge in decision tree induction. Machine Learning 6 (1991) 231-250
13. A. Papagelis, D. Kalles, GATree: Genetically evolved decision trees, in: 12th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'00, 2000, pp. 203-206.
14. Quinlan J.R. Induction of decision trees. Machine Learning 1 (1986) 81-106
15. Quinlan J.R. C4.5: Programs for Machine Learning (1993), Morgan Kaufmann
16. Tan M. Cost-sensitive learning of classification knowledge and its application in robotic. Machine Learning Journal 13 (1993) 7-33
17. Turney P.D. Cost-sensitive classification: Empirical evaluation of a hybrid genetic decision tree induction algorithm. Journal of Artificial Intelligence Research 2 (1995) 369-409
18. Yang Q., Ling C., Chai X., and Pan R. Test-cost sensitive classification on data with missing values. IEEE Transactions on Knowledge and Data Engineering 18 5 (2006) 626-638
19. Yen E., and Chu I.-W.M. Relaxing instance boundaries for the search of splitting points of numerical attributes in classification trees. Information Sciences 177 (2007) 1276-1289