Analysis of a complexity-based pruning scheme for classification trees

DOI10.1109/TIT.2002.800482zbMATH Open1062.62508MaRDI QIDQ4677553FDOQ4677553

Andrew B. Nobel

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Model Selection for CART Regression Trees
• PAC-learning a decision tree with pruning
• A comparison of pruning criteria for probability trees
• The effects of pruning methods on the predictive accuracy of induced decision trees
• FBP: a frontier-based tree-pruning algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Communication, information (94A99)

Cited In (15)

• Vapnik–Chervonenkis dimension of axis-parallel cuts
• Prequential analysis of complex data with adaptive model reselection
• Information divergence estimation based on data-dependent partitions
• Computation of the complexity of vector quantizers by affine modeling
• Title not available (Why is that?)
• An investigation on the conditions of pruning an induced decision tree
• Risk bounds for CART classifiers under a margin condition
• Learning with Deep Cascades
• Title not available (Why is that?)
• An optimal constrained pruning strategy for decision trees
• On signal representations within the Bayes decision framework
• Pruning from Adaptive Regularization
• Linear Aggregation in Tree-Based Estimators
• Time-penalised trees (\texttt{TpT}): introducing a new tree-based data mining algorithm for time-varying covariates
• Adaptive partitioning schemes for bipartite ranking

This page was built for publication: Analysis of a complexity-based pruning scheme for classification trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677553)