Risk bounds for CART classifiers under a margin condition

DOI10.1016/j.patcog.2012.02.021zbMath1242.62055arXiv0902.3130OpenAlexW2008282268MaRDI QIDQ437488

Servane Gey

Publication date: 17 July 2012

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.3130

zbMATH Keywords

pruningmargin

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Bayesian inference (62F15)

Related Items (2)

Vapnik–Chervonenkis dimension of axis-parallel cuts ⋮ Generalization error bounds of dynamic treatment regimes in penalized regression-based learning

Uses Software

• AdaBoost.MH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Margin-adaptive model selection in statistical learning
• Risk bounds for statistical learning
• A decision-theoretic generalization of on-line learning and an application to boosting
• Smooth discrimination analysis
• Arcing classifiers. (With discussion)
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Une inégalité de Bennett pour les maxima de processus empiriques. (A Bennet type inequality for maxima of empirical processes)
• Optimal aggregation of classifiers in statistical learning.
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
• Optimal dyadic decision trees
• Simultaneous adaptation to the margin and to complexity in classification
• Square root penalty: Adaption to the margin in classification and in edge estimation
• Risk Bounds for Embedded Variable Selection in Classification Trees
• Theory of Classification: a Survey of Some Recent Advances
• Model Selection for CART Regression Trees
• Minimax-optimal classification with dyadic decision trees
• On the Rate of Convergence of Local Averaging Plug-In Classification Rules Under a Margin Condition
• Validating Classification Trees
• Recursive partitioning to reduce distortion
• Analysis of a complexity-based pruning scheme for classification trees
• Termination and continuity of greedy growing for tree-structured vector quantizers
• Tree pruning with subadditive penalties
• Extrapolative problems in automatic control and the method of potential functions
• Some applications of concentration inequalities to statistics
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Risk bounds for CART classifiers under a margin condition