Towards convergence rate analysis of random forests for classification
From MaRDI portal
Publication:2093392
DOI10.1016/j.artint.2022.103788OpenAlexW3105237797MaRDI QIDQ2093392
Publication date: 8 November 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103788
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the asymptotics of random forests
- Generalized random forests
- Fast learning rates for plug-in classifiers
- Consistency of random forests
- A random forest guided tour
- Decision Forests: A Unified Framework for Classification, Regression, Density Estimation, Manifold Learning and Semi-Supervised Learning
- Learning from Non-iid Data: Fast Rates for the One-vs-All Multiclass Plug-in Classifiers
- Variance reduction in purely random forests
- The height of a random binary search tree
- A note on the height of binary search trees
- Minimax nonparametric classification .I. Rates of convergence
- Estimation and Inference of Heterogeneous Treatment Effects using Random Forests
- Iterative random forests to discover predictive and stable high-order interactions
- An adaptive multiclass nearest neighbor classifier
- Dynamic Trees for Learning and Design
- Probability Inequalities for Sums of Bounded Random Variables
- Machine Learning: ECML 2004
- Probability and Computing
- Understanding Machine Learning
- Nearest neighbor pattern classification
- Random Forests and Adaptive Nearest Neighbors
- Extremely randomized trees
- Random forests
This page was built for publication: Towards convergence rate analysis of random forests for classification
