Towards convergence rate analysis of random forests for classification
Authors:
- Wei GaoWGWei Gao
- Fan XuFXFan Xu
- Zhi-Hua ZhouZZZhi-Hua Zhou
- 21 September 2022
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 313
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (61876078, 61921006)
- National Key Research and Development Program of China (2021ZD0112802)
This publication has 30 references indexed in Scilit:
- Dynamic Trees for Learning and DesignJournal of the American Statistical Association, 2011
- Enriched random forestsBioinformatics, 2008
- Random Forests and Adaptive Nearest NeighborsJournal of the American Statistical Association, 2006
- Random Forest: A Classification and Regression Tool for Compound Classification and QSAR ModelingJournal of Chemical Information and Computer Sciences, 2003
- The height of a random binary search treeJournal of the ACM, 2003
- Minimax nonparametric classification .I. Rates of convergenceIEEE Transactions on Information Theory, 1999
- The random subspace method for constructing decision forestsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
- Shape Quantization and Recognition with Randomized TreesNeural Computation, 1997
- A note on the height of binary search treesJournal of the ACM, 1986
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963