Analysis of a complexity-based pruning scheme for classification trees
From MaRDI portal
Publication:4677553
Recommendations
Cited in
(20)- FBP: a frontier-based tree-pruning algorithm
- Maximum a posteriori pruning on decision trees and its application to bootstrap bumping
- Vapnik–Chervonenkis dimension of axis-parallel cuts
- Prequential analysis of complex data with adaptive model reselection
- Computation of the complexity of vector quantizers by affine modeling
- Information divergence estimation based on data-dependent partitions
- Learning with deep cascades
- An MLE strategy for combining optimally pruned decision trees
- scientific article; zbMATH DE number 2013257 (Why is no real title available?)
- An investigation on the conditions of pruning an induced decision tree
- Risk bounds for CART classifiers under a margin condition
- scientific article; zbMATH DE number 2219698 (Why is no real title available?)
- An optimal constrained pruning strategy for decision trees
- On signal representations within the Bayes decision framework
- Pruning boxes in a box-based classification method
- A comparison of pruning criteria for probability trees
- 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)