Optimal dyadic decision trees
From MaRDI portal
Publication:2384139
DOI10.1007/s10994-007-0717-6zbMath1470.68085OpenAlexW2160603220MaRDI QIDQ2384139
C. Schäfer, Yves Rozenholc, Gilles Blanchard, Klaus-Robert Müller
Publication date: 20 September 2007
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-007-0717-6
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Ordered hypothesis machines, Algorithms for learning parsimonious context trees, A cross-validation framework for signal denoising with applications to trend filtering, dyadic CART and beyond, Quantile regression by dyadic CART, Risk bounds for CART classifiers under a margin condition, Algorithms for optimal dyadic decision trees, Combining regular and irregular histograms by penalized likelihood, Adaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection, Learning Bayesian networks with local structure, mixed variables, and exact algorithms, Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation of density functions by sequences of exponential families
- Risk bounds for model selection via penalization
- CART and best-ortho-basis: a connection
- Statistical performance of support vector machines
- Local Rademacher complexities
- Model Selection for CART Regression Trees
- Minimax-optimal classification with dyadic decision trees
- Sélection d'histogrammes à l'aide d'un critère de type Akaike
- Learning Theory
- Different Paradigms for Choosing Sequential Reweighting Algorithms
- Soft margins for AdaBoost
- Some applications of concentration inequalities to statistics
- Random forests
