Minimax-optimal classification with dyadic decision trees

DOI10.1109/TIT.2006.871056zbMATH Open1318.62216MaRDI QIDQ3547602FDOQ3547602

Authors: Clayton Scott, Robert D. Nowak 

Publication date: 21 December 2008

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

Recommendations

• Optimal dyadic decision trees
• Learning Theory
• Algorithms for optimal dyadic decision trees
• Optimal classification trees
• Feature minimization within decision trees

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Detection theory in information and communication theory (94A13)

Cited In (28)

• Penalized empirical risk minimization over Besov spaces
• Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees
• Online Adaptive Decision Trees
• Adaptive transfer learning
• A tree-based regressor that adapts to intrinsic dimension
• Learning Bayesian networks with local structure, mixed variables, and exact algorithms
• Minimax-optimal nonparametric regression in high dimensions
• Complexity-penalized estimation of minimum volume sets for dependent data
• Risk bounds for CART classifiers under a margin condition
• Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings
• Classifiers of support vector machine type with \(\ell_1\) complexity regularization
• Making decision trees feasible in ultrahigh feature and label dimensions
• Classification Trees for Imbalanced Data: Surface-to-Volume Regularization
• Quantile regression by dyadic CART
• Classification algorithms using adaptive partitioning
• On signal representations within the Bayes decision framework
• Regularized impurity reduction: accurate decision trees with complexity guarantees
• Intrinsic dimension adaptive partitioning for kernel methods
• Optimal dyadic decision trees
• Learning Theory
• Classification with minimax fast rates for classes of Bayes rules with sparse representation
• Adaptive learning rates for support vector machines working on data with low intrinsic dimension
• Uncertainty quantification for Bayesian CART
• Time-penalised trees (\texttt{TpT}): introducing a new tree-based data mining algorithm for time-varying covariates
• On the minimization of concave information functionals for unsupervised classification via decision trees
• Optimal survival trees
• Algorithms for optimal dyadic decision trees
• A cross-validation framework for signal denoising with applications to trend filtering, dyadic CART and beyond

This page was built for publication: Minimax-optimal classification with dyadic decision trees

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