Risk Bounds for Embedded Variable Selection in Classification Trees

Abstract

The problems of model and variable selections for classification trees are jointly considered. A penalized criterion is proposed which explicitly takes into account the number of variables, and a risk bound inequality is provided for the tree classifier minimizing this criterion. This penalized criterion is compared to the one used during the pruning step of the CART algorithm. It is shown that the two criteria are similar under some specific margin assumptions. In practice, the tuning parameter of the CART penalty has to be calibrated by hold-out or cross-validation. A simulation study is performed to compare the form of the theoretical penalized criterion we propose with the form obtained after tuning the regularization parameter via cross-validation.

DOI: 10.1109/TIT.2014.2298874

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@article{Gey2014RiskBF, title={Risk Bounds for Embedded Variable Selection in Classification Trees}, author={Servane Gey and Tristan Mary-Huard}, journal={IEEE Transactions on Information Theory}, year={2014}, volume={60}, pages={1688-1699} }