The statistical learning theory has formulated the Structural Risk Minimization (SRM) principle, based upon the functional form of risk bound on the generalization performance of a learning machine. This paper addresses the application of this formula, which is equivalent to a complexity penalty, to model selection tasks for decision trees, whereas the quantization of the machine capacity for decision trees is estimated using an empirical approach. Experimental results show that, for either classification or regression problems, this novel strategy of decision tree pruning performs better than alternative methods. We name classification and regression trees pruned by virtue of this methodology as Statistical Learning Intelligent Trees (SLIT). © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Yang, Z., Zhu, W., & Ji, L. (2006). SLIT: Designing complexity penalty for classification and regression trees using the SRM principle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 895–902). Springer Verlag. https://doi.org/10.1007/11759966_131
Mendeley helps you to discover research relevant for your work.