SPLIT SELECTION METHODS FOR CLASSIFICATION TREES
Wei‐Yin Loh, Yu‐Shan Shih · 1997
Abstract: Classification trees based on exhaustive search algorithms tend to be biased towards selecting variables that afford more splits. As a result, such trees should be interpreted with caution. This article presents an algorithm called QUEST that has negligible bias. Its split selection strategy shares similarities with the FACT method, but it yields binary splits and the final tree can be selected by a direct stopping rule or by pruning. Real and simulated data are used to compare QUEST with the exhaustive search approach. QUEST is shown to be substantially faster and the size and classification accuracy of its trees are typically comparable to those of exhaustive search. Key words and phrases: Decision trees, discriminant analysis, machine learning. 1.
Cited by 916 works.
Authors
References
- Classification and Regression Trees.
- Classification and Regression Trees.
- Bagging Predictors
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
- Algorithm AS 136: A K-Means Clustering Algorithm
- The Asymptotic Theory of Extreme Order Statistics
- Problems in the Analysis of Survey Data, and a Proposal
- Methods for Statistical Data Analysis of Multivariate Observations.
- A System for Induction of Oblique Decision Trees
- Robust tests for equality of variances