SLIT: designing complexity penalty for classification and regression trees using the SRM principle

  • Authors:

  • Zhou Yang;Wenjie Zhu;Liang Ji

  • Affiliations:

  • State Key Laboratory of Intelligent Technology and Systems & Institute of Information Processing, Dept. of Automation, Tsinghua University, Beijing, China;Dept. of Statistics and Actuarial Sciences, The University of Hong Kong, Hong Kong S.A.R.;State Key Laboratory of Intelligent Technology and Systems & Institute of Information Processing, Dept. of Automation, Tsinghua University, Beijing, China

  • Venue:
  • ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

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).