Improving the precision of classification trees

Abstract

Besides serving as prediction models, classification trees are useful for finding important predictor variables and identifying interesting subgroups in the data. These functions can be compromised by weak split selection algorithms that have variable selection biases or that fail to search beyond local main effects at each node of the tree. The resulting models may include many irrelevant variables or select too few of the important ones. Either eventuality can lead to erroneous conclusions. Four techniques to improve the precision of the models are proposed and their effectiveness compared with that of other algorithms, including tree ensembles, on real and simulated data sets.

Published in at http://dx.doi.org/10.1214/09-AOAS260 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org)

Cited by in corpus (8)

• Model-based Recursive Partitioning for Subgroup Analyses
• Regression trees for longitudinal and multiresponse data
• Model trees with topic model preprocessing: An approach for data journalism illustrated with the WikiLeaks Afghanistan war logs
• Unbiased Measurement of Feature Importance in Tree-Based Methods
• An Experimental Comparison of Old and New Decision Tree Algorithms
• Accounting for shared covariates in semi-parametric Bayesian additive regression trees
• Variable importance scores
• Joints in Random Forests