A new node splitting measure for decision tree construction

Pattern Recognition

Volumn 43, Issue 8, 2010, Pages 2725-2731

  Chandra, B ^a   Kothari, Ravi ^b   Paul, Pallath ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b IBM RESEARCH   (United States)

Author keywords

Decision trees; Gain Ratio; Gini Index; Node splitting measure

Indexed keywords

CLASS-BASED; CLASSIFICATION ACCURACY; DATA SETS; DECISION TREE CONSTRUCTION; DECISION TREE INDUCTION; GAIN RATIO; GINI INDEX; SPLIT MEASURE;

CLASSIFICATION (OF INFORMATION); DECISION TREES;

PARTITIONS (BUILDING);

EID: 77951253366     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2010.02.025     Document Type: Article

References (22)

1. Breiman L. Some properties of splitting criteria. Machine Learning 24 (1996) 41-47
2. Breiman L., Friedman J., Olsen R., and Stone C. Classification and Regression Trees (1984), Wadsworth International
3. C. Codrington, C.E. Brodley, On the qualitative behavior of impurity based splitting rules I: the minima-free property, Technical Report, Purdue University, 1997.
4. W. Dianhong, J. Liangxiao, An improved attribute selection measure for decision tree induction, in: Fourth International Conference Proceedings on Fuzzy Systems and Knowledge Discovery-FSDK 2007, vol. 4, IEEE CS, 2007, pp. 654-658.
5. T. Elomma, J. Rousu, On the well-behavedness of important attribute evaluation functions, in: Proceedings of Sixth Scandinavian Conference on Artificial Intelligence, IOS Press, 1997, pp. 95-106.
6. Elomma T., and Rousu J. General and efficient multisplitting of numerical attributes. Machine Learning 1 (1999) 1-49
7. T. Elomma, J. Rousu, On splitting properties of common attribute evaluation functions, Report C-2000-1, Department of Computer Science, University of Helsinki, 2000.
8. Fayyad U., and Irani K.B. On the handling of continuous-valued attributes in decision tree generation. Machine Learning 8 (1992) 87-102
9. U. Fayyad, K.B. Irani, Multi-interval discretization of continuous valued attributes for classification learning, in: The Thirteenth International Joint Conference on Artificial Intelligence Conference Proceedings, Morgan Kaufmann, 1993, pp. 1022-1027.
10. Friedman M. The use of ranks to avoid the assumption of normality implicit in the analyis of variance. Journal of the American Statistical Association 32 (1937) 675-701
11. Friedman M. A comparison of alternative tests of significance for the problem of m rankings. Annals of Mathematical Statistics 11 (1940) 86-92
12. Demsar J. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research 7 (2006) 1-30
13. Jun B.H., Kim C.S., and Kim J. A new criterion in selection and discretization of attributes for the generation of decision trees. IEEE Transactions on Pattern Analysis and Machine Intelligence 19 12 (1997) 1371-1375
14. Luenberger D. Introduction to Linear and Nonlinear Programming (1973), Addison-Wesley, Reading
15. M. Mehta, R. Agrawal, J. Riassnen, Sliq: a fast scalable classifier for data mining, in: Extending Database Technology, Springer, 1996, pp. 18-32.
16. Morimoto Y. Algorithms for finding attribute value group for binary segmentation of categorical databases. IEEE Transactions on Knowledge and Data Engineering 14 6 (2002) 1269-1279
17. P.B. Nemenyi, Distribution-free multiple comparisons, Ph.D. Thesis, Princeton University, 1963.
18. Quinlan J. Induction of decision trees. Machine Learning (1986) 81-106
19. Quinlan J. C4.5: Programs for Machine Learning. Springer 16 3 (1993) 235-240
20. Quinlan J. Improved use of continuous attributes in c4.5. Journal of Artificial Intelligence 4 (1996) 77-90
21. Iman R.L., and Davenport J.M. Approximations of the critical region of the Friedman statistic. Communications in Statistics (1980) 571-595
22. Safavian S.R., and Landgrebe D. A survey of decision tree classifier methodology. IEEE Transactions on Systems Man and Cybernetics 21 (1991) 660-674