Margin Adaptive Risk Bounds for Classification Trees

Servane Gey (1)

1 MAP5 - UMR 8145 - Mathématiques Appliquées Paris 5

Margin adaptive risk bounds for Classification and Regression Trees (CART, Breiman et. al. 1984) classifiers are obtained in the binary supervised classification framework. These risk bounds are obtained conditionally on the construction of the maximal deep binary tree and permit to prove that the linear penalty used in the CART pruning algorithm is valid under margin condition. It is also shown that, conditionally on the construction of the maximal tree, the final selection by test sample does not alter dramatically the estimation accuracy of the Bayes classifier. In the two-class classification framework, the risk bounds that are proved, obtained by using penalized model selection, validate the CART algorithm which is used in many data mining applications such as Biology, Medicine or Image Coding.

Mots clés: Classification; CART; Pruning; Margin; Risk Bounds

Domaines: Statistiques [math.ST]; Théorie [stat.TH]; Machine Learning [stat.ML]

Servane Gey. Margin Adaptive Risk Bounds for Classification Trees. 2009. ⟨hal-00362281v2⟩