Classification algorithms using adaptive partitioning
DOI10.1214/14-AOS1234zbMATH Open1310.62074arXiv1411.0839MaRDI QIDQ482871FDOQ482871
Authors: Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald DeVore
Publication date: 6 January 2015
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0839
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Neural nets and related approaches to inference from stochastic processes (62M45) Computational learning theory (68Q32) Numerical interpolation (65D05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal aggregation of classifiers in statistical learning.
- Universal algorithms for learning theory. II: Piecewise polynomial functions
- Fast learning rates for plug-in classifiers
- Theory of Classification: a Survey of Some Recent Advances
- Tree approximation and optimal encoding
- Risk bounds for statistical learning
- Adaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection
- Minimax-optimal classification with dyadic decision trees
- Classification algorithms using adaptive partitioning
Cited In (5)
- Improved classification rates under refined margin conditions
- A method to enrich experimental datasets by means of numerical simulations in view of classification tasks
- Classification algorithms using adaptive partitioning
- Rate of convergence of \(k\)-nearest-neighbor classification rule
- Exact asymptotic orders of various randomized widths on Besov classes
This page was built for publication: Classification algorithms using adaptive partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482871)