Oracle bounds and exact algorithm for dyadic classification trees

DOI10.1007/978-3-540-27819-1_26MaRDI QIDQ4680891zbMATH OpenOpenAlexFDO

Authors Gilles Blanchard, C. Schäfer, Yves Rozenholc

Publication date 13 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98522

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Algorithms in computer science (68W99)

Recommendations

• Minimax-optimal classification with dyadic decision trees
• Optimal dyadic decision trees
• Algorithms for optimal dyadic decision trees
• Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees
• A novel algorithm to optimize classification trees

Cited in

(13)

• Algorithms for optimal dyadic decision trees
• Minimax bounds for Besov classes in density estimation
• Uncertainty quantification for Bayesian CART
• Adaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection
• Optimal dyadic decision trees
• Smoothing and adaptation of shifted Pólya tree ensembles
• Minimax-optimal classification with dyadic decision trees
• Estimation of the transition density of a Markov chain
• Classification algorithms using adaptive partitioning
• Automatic locally adaptive smoothing for tree-based set estimation
• Density estimation under local differential privacy and Hellinger loss
• Time-penalised trees (\texttt{TpT}): introducing a new tree-based data mining algorithm for time-varying covariates
• Complexity-penalized estimation of minimum volume sets for dependent data

This page was built for publication: Oracle bounds and exact algorithm for dyadic classification trees

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