The DOI matches its Crossref record; 124 of the 124 references it cites were found in a registry or an index; 4 of the 112 sources its claims cite were checked for support.
A random forest guided tour
Open accessAbstract
The random forest algorithm, proposed by L. Breiman in 2001, has been extremely successful as a general-purpose classification and regression method. The approach, which combines several randomized decision trees and aggregates their predictions by averaging, has shown excellent performance in settings where the number of variables is much larger than the number of observations. Moreover, it is versatile enough to be applied to large-scale problems, is easily adapted to various ad hoc learning tasks, and returns measures of variable importance. The present article reviews the most recent theoretical and methodological developments for random forests. Emphasis is placed on the mathematical forces driving the algorithm, with special attention given to the selection of parameters, the resampling mechanism, and variable importance measures. This review is intended to provide non-experts easy access to the main ideas.
Overview
CoChat Summary
## TL;DR
This paper is a survey of random forests that reviews the algorithm’s construction, theoretical analyses, variable importance measures, and several extensions. It emphasizes that random forests are highly successful in practice, but that much of their behavior still lacks complete mathematical explanation.
## Key findings
- Breiman’s original random forest builds M randomized trees, each from aₙ sampled observations, using mtry randomly chosen split directions at each node and stopping when a node has fewer than nodesize points; the default implementation cited is M = 500, mtry = ⌈p/3⌉ for regression, aₙ = n, and nodesize = 5 for regression.
- The paper states that the variance of the forest decreases as M grows, and that choosing a large number of trees does not lead to overfitting; it also notes that the error of the finite forest can be made arbitrarily close to that of the infinite forest.
- For simplified forest models, the review reports consistency results such as centered forests being consistent when k → ∞ and n / 2^k → ∞, and states that for sparse regression the convergence rate depends on the number of active variables |S| rather than the ambient dimension p.
- For variable importance, the paper describes two measures: MDI and MDA; it reports that correlated variables can harm MDA performance, and in a Gaussian setting the variable importance decreases as the inverse of the square of p when the number of correlated variables increases.
## Methods
- This is a narrative theoretical review, not an empirical study; it surveys the random forest literature and focuses on the mathematical structure of the method, parameter tuning, resampling, split selection, variable importance, and extensions.
- The paper’s “data” are the cited results from prior theoretical and methodological work on random forests, including Breiman’s original algorithm, simplified forest models, bootstrap/subsampling analyses, and variable-importance theory.
- The main analysis is synthesis and comparison of existing results, including descriptions of algorithmic steps, consistency and asymptotic normality results, kernel/nearest-neighbor connections, and known behavior of importance measures.
## Limitations
- The authors state that little has been proven mathematically for the original Breiman procedure, and that the role of the bootstrap in random forests is still poorly understood.
- They explicitly note that the consistency of the unpruned procedure comes at the price of a conjecture regarding CART behavior that is difficult to verify.
- Evident from the text: this is a review article, so it does not present a new dataset or new experimental evaluation of random forests itself.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
4 Valid · 4 Not valid · 83 Not checked · 47 Own results and interpretations
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“He also establishes that the infinitesimal jackknife (Efron, 1979) consistently estimates the forest variance.”
What the sources say
- Not checked yetcites Wager (2014)
- Supportedcites Efron (1979) source
The citation to Efron (1979) is attached to “infinitesimal jackknife,” identifying the method, not attributing Wager’s forest-variance result to Efron. Section 5 (p. 11) explicitly discusses Jaeckel’s infinitesimal jackknife. (LLM, conf=0.92)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Every source the paper cites for this claim was checked and supports it.
In the paper
“Assuming some regularity conditions on the regression model, and considering a modification of Breiman's forests in which all directions are preselected for splitting, Scornet et al. (2015) prove that, with probability 1 -ξ , for all n large enough and all 1 ≤ q ≤ k ,”
What the sources say
- Supportedcites Scornet et al. (2015) source
Split into 2 atoms — 2 confirmed, 0 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
boostedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Scornet et al. (2015) proved a consistency result in the context of additive regression models for the pruned version of Breiman's forest.”
What the sources say
- Partly supportedcites Scornet et al. (2015) sourceExperimental — accuracy not yet measured
Our copy confirms the core attribution: the Abstract and Section 3 (assumption H1) state an L2 consistency result for Breiman's (2001) random forest in the context of additive regression models. However, the paper never describes its result as holding for a 'pruned version': Section 2/Section 3 set out two regimes — Theorem 1, where trees are 'not fully developed' because growth stops at t_n leaves (t_n < a_n), and Theorem 2, where trees are 'fully grown' (t_n = a_n, Breiman's default) and consistency comes from the subsampling rate — and the paper presents both as results for Breiman's original procedure (bootstrapping replaced by subsampling), not for a pruned variant. The 'pruned version' qualifier is therefore not supported by our copy. (LLM, conf=0.72)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“It is shown in Scornet et al. (2015) that random forests asymptotically perform, with high probability, splits along the S informative variables (in the sense of Section 3.1).”
What the sources say
- Supportedcites Scornet et al. (2015) source
Section 3 (Main results) of our copy states verbatim that 'Proposition 1 below shows that random forests nicely adapt to the sparsity setting by asymptotically performing, with high probability, splits along the S informative variables,' and Proposition 1 formalizes this (with probability 1−ξ, for n large enough, the first k cut directions j_{q,n}(X) lie in {1,...,S}). The same section defines the S informative variables as the first S components of the additive model Y = Σ_{j≤S} m_j(X^{(j)}) + ε under the sparsity constraint S < p, matching the claim's qualifier. The claim omits the proposition's conditions (m_try = p, (H1), and no m_j constant on an interval), but that level of specificity is not carried by the citing sentence. (LLM, conf=0.92)
boostedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
In the paper
“The resulting Dynamic Random Forest (DRF) shows significant improvement in terms of accuracy on 20 real-based data sets compared to the standard, static, algorithm.”
What the sources say
- Not checked yetcites Bernard et al. (2012)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
51 more claims
Create a free account to see all 138 claims and to verify the 108 references still open.
- Probably not a substantial claim. 63
- It may state two separate claims as one. 40
- The quote only partly states this claim. 1
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Classification and Regression by randomForest
Liaw, A. I., & Wiener, M. C. (2007) · Cited by 18,594
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Bootstrap methods: another look at the jackknife
Efron, B. (1979) · The Annals of Statistics · doi:10.1214/aos/1176344552 · Cited by 17,602
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954
Geurts, P., Ernst, D., & Wehenkel, L. (2006) · Machine Learning · doi:10.1007/s10994-006-6226-1 · Cited by 9,300
Learning Deep Architectures for AI
Bengio, Y. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000006 · Cited by 9,239
Ensemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
The Jackknife, the Bootstrap and Other Resampling Plans
Efron, B. (1982) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970319 · Cited by 8,120
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842
Kuhn, M., & Johnson, K. (2013) · doi:10.1007/978-1-4614-6849-3 · Cited by 6,788 · cited 2×
“Random forests can naturally be adapted to fit the unbalanced data framework by down-sampling the majority class and growing each tree on a more balanced data set (Chen et al. 2004; Kuhn and Johnson 2013).”
BackgroundRandom forests for classification in ecology
Cutler, D. R., Edwards, T. C., Beard, K. H., Cutler, A., Hess, K. T., Gibson, J., & Lawler, J. J. (2007) · Ecology · doi:10.1890/07-0539.1 · Cited by 4,950
Learning Deep Architectures for AI
Bengio, Y. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982957 · Cited by 4,941
Unbiased Recursive Partitioning: A Conditional Inference Framework
Hothorn, T., Hornik, K., & Zeileis, A. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x133933 · Cited by 4,021
Random Forest: A Classification and Regression Tool for Compound Classification and QSAR Modeling
Svetnik, V., Liaw, A., Tong, C., Culberson, J. C., Sheridan, R. P., & Feuston, B. P. (2003) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci034160g · Cited by 3,573
Real-time human pose recognition in parts from single depth images
Shotton, J., Fitzgibbon, A., Cook, M., Sharp, T., Finocchio, M., Moore, R., Kipman, A., & Blake, A. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995316 · Cited by 3,491
Nadaraya, E. A. (1964) · Theory of Probability & Its Applications · doi:10.1137/1109020 · Cited by 3,462
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Conditional variable importance for random forests
Strobl, C., Boulesteix, A.-L., Kneib, T., Augustin, T., & Zeileis, A. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-307 · Cited by 3,254
Gene selection and classification of microarray data using random forest
Díaz-Uriarte, R., & Alvarez de Andrés, S. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-3 · Cited by 2,929
Ishwaran, H., Kogalur, U. B., Blackstone, E. H., & Lauer, M. S. (2008) · The Annals of Applied Statistics · doi:10.1214/08-aoas169 · Cited by 2,714
Watson, G. S. (1964) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 2,661
Variable selection using random forests
Genuer, R., Poggi, J.-M., & Tuleau-Malot, C. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.03.014 · Cited by 2,619
Prasad, A. M., Iverson, L. R., & Liaw, A. (2006) · Ecosystems · doi:10.1007/s10021-005-0054-1 · Cited by 1,987
Consistent Nonparametric Regression
Stone, C. J. (1977) · The Annals of Statistics · doi:10.1214/aos/1176343886 · Cited by 1,792
A Distribution-Free Theory of Nonparametric Regression
Györfi, L., Kohler, M., Krzyżak, A., & Walk, H. (2002) · Springer Series in Statistics · doi:10.1007/b97848 · Cited by 1,738
Big Data: New Tricks for Econometrics
Varian, H. R. (2014) · Journal of Economic Perspectives · doi:10.1257/jep.28.2.3 · Cited by 1,557
Meinshausen, N. (2006) · Cited by 1,521
Optimal Global Rates of Convergence for Nonparametric Regression
Stone, C. J. (1982) · The Annals of Statistics · doi:10.1214/aos/1176345969 · Cited by 1,497
Understanding variable importances in forests of randomized trees
Louppe, G., Wehenkel, L. A., Sutera, A., & Geurts, P. (2013) · ORBi (University of Liège) · Cited by 1,364
Ishwaran, H., Kogalur, U. B., Blackstone, E. H., & Lauer, M. S. (2008) · Cited by 1,310
Shape Quantization and Recognition with Randomized Trees
Amit, Y., & Geman, D. (1997) · Neural Computation · doi:10.1162/neco.1997.9.7.1545 · Cited by 1,275
Empirical characterization of random forest variable importance measures
Archer, K. J., & Kimes, R. V. (2008) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2007.08.015 · Cited by 1,123
Correlation and variable importance in random forests
Gregorutti, B., Michel, B., & Saint-Pierre, P. (2017) · Statistics and Computing · doi:10.1007/s11222-016-9646-1 · Cited by 1,073
International Conference on Machine Learning (ICML-99).
Scheffer, T. (1999) · Künstliche Intell. · Cited by 1,003
Boulesteix, A., Janitza, S., Kruppa, J., & König, I. R. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1072 · Cited by 924
Optimal Rates of Convergence for Nonparametric Estimators
Stone, C. J. (1980) · The Annals of Statistics · doi:10.1214/aos/1176345206 · Cited by 795
Politis, D. N., Romano, J. P., & Wolf, M. (1999) · Springer Series in Statistics · doi:10.1007/978-1-4612-1554-7 · Cited by 760
Criminisi, A. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985415 · Cited by 703
Consistency of Random Forests and Other Averaging Classifiers
Gérard Biau, A., Devroye, L., & Lugosi, G. (2008) · HAL · Cited by 678
Criminisi, A., Shotton, J., & Konukoglu, E. (2012) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000035 · Cited by 677
Analysis of a Random Forests Model
Gérard Biau, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.0208 · Cited by 661
Scornet, E., Biau, G., & Vert, J.-P. (2015) · The Annals of Statistics · doi:10.1214/15-aos1321 · Cited by 612
Self-citationBühlmann, P., & Yu, B. (2002) · The Annals of Statistics · doi:10.1214/aos/1031689014 · Cited by 602
Random Forests and Adaptive Nearest Neighbors
Lin, Y., & Jeon, Y. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000001230 · Cited by 507
Classification and Regression Trees
(2022) · The R Book · doi:10.1002/9781119634461.ch20 · Cited by 499
Regression Trees for Censored Data
Segal, M. R. (1988) · Biometrics · doi:10.2307/2531894 · Cited by 495
Saffari, A., Leistner, C., Santner, J., Godec, M., & Bischof, H. (2009) · 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops · doi:10.1109/iccvw.2009.5457447 · Cited by 481
Classification with correlated features: unreliability of feature ranking and solutions
Toloşi, L., & Lengauer, T. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr300 · Cited by 445
yaImpute: An R Package for k NN Imputation
Crookston, N. L., & Finley, A. O. (2008) · Journal of Statistical Software · doi:10.18637/jss.v023.i10 · Cited by 418
Real-Time Human Pose Recognition in Parts from Single Depth Images
Shotton, J., Fitzgibbon, A., Cook, M., Sharp, T., Finocchio, M., Moore, R., Kipman, A., & Blake, A. (2013) · Studies in Computational Intelligence · doi:10.1007/978-3-642-28661-2_5 · Cited by 411
Classification Trees With Unbiased Multiway Splits
Kim, H., & Loh, W.-Y. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753168271 · Cited by 391
A Scalable Bootstrap for Massive Data
Kleiner, A., Talwalkar, A., Sarkar, P., & Jordan, M. I. (2014) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12050 · Cited by 389
Variable importance in binary regression trees and forests
Ishwaran, H. (2012) · Cited by 379
Variable importance in binary regression trees and forests
Ishwaran, H. (2007) · Electronic Journal of Statistics · doi:10.1214/07-ejs039 · Cited by 353
Gene selection with guided regularized random forest
Deng, H., & Runger, G. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.018 · Cited by 304
Random Forests and Kernel Methods
Scornet, E. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2514489 · Cited by 296
Self-citationMining data with random forests: current options for real‐world applications
Ziegler, A., & König, I. R. (2014) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1114 · Cited by 288
Randomizing Outputs to Increase Prediction Accuracy
Breiman, L. (2000) · Machine Learning · doi:10.1023/a:1007682208299 · Cited by 276
Consistency of random survival forests
Ishwaran, H., & Kogalur, U. B. (2010) · Statistics & Probability Letters · doi:10.1016/j.spl.2010.02.020 · Cited by 271
On safari to Random Jungle: a fast implementation of Random Forests for high-dimensional data
Schwarz, D. F., König, I. R., & Ziegler, A. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq257 · Cited by 269
CONSISTENCY FOR A SIMPLE MODEL OF RANDOM FORESTS
Breiman, L. (2004) · Cited by 255
Spatiotemporal exploratory models for broad‐scale survey data
Fink, D., Hochachka, W. M., Zuckerberg, B., Winkler, D. W., Shaby, B., Munson, M. A., Hooker, G., Riedewald, M., Sheldon, D., & Kelling, S. (2010) · Ecological Applications · doi:10.1890/09-1340.1 · Cited by 252
Probability Machines: Consistent Probability Estimation Using Nonparametric Learning Machines
Malley, J. D., Kruppa, J., Dasgupta, A., Malley, K. G., & Ziegler, A. (2012) · Methods of Information in Medicine · doi:10.3414/me00-01-0052 · Cited by 242
Mondrian Forests: Efficient Online Random ForestsPreprint
Lakshminarayanan, B., Roy, D. M., & Teh, Y. W. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.2673 · Cited by 238
Quantifying Uncertainty in Random Forests via Confidence Intervals and Hypothesis TestsPreprint
MentchLucas, & HookerGiles (2014) · arXiv (Cornell University) · doi:10.5555/2946645.2946671 · Cited by 237
The effect of splitting on random forests
Ishwaran, H. (2015) · Machine Learning · doi:10.1007/s10994-014-5451-2 · Cited by 230
Amaratunga, D., Cabrera, J., & Lee, Y.-S. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn356 · Cited by 228
Random survival forests for high‐dimensional data
Ishwaran, H., Kogalur, U. B., Chen, X., & Minn, A. J. (2011) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10103 · Cited by 214
Menze, B. H., Kelm, B. M., Splitthoff, D. N., Koethe, U., & Hamprecht, F. A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23783-6_29 · Cited by 212
Two statistical methods for the detection of environmental thresholds
Qian, S. S., King, R. S., & Richardson, C. J. (2003) · Ecological Modelling · doi:10.1016/s0304-3800(03)00097-8 · Cited by 208
Consumer credit risk: Individual probability estimates using machine learning
Kruppa, J., Schwarz, A., Arminger, G., & Ziegler, A. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.03.019 · Cited by 195
Feature selection via regularized trees
Deng, H., & Runger, G. (2012) · The 2012 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2012.6252640 · Cited by 180
Désir, C., Bernard, S., Petitjean, C., & Heutte, L. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.022 · Cited by 170
Narrowing the Gap: Random Forests In Theory and In Practice
Denil, M., Matheson, D., & de Freitas, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.1415 · Cited by 170
Predictor correlation impacts machine learning algorithms: implications for genomic studies
Nicodemus, K. K., & Malley, J. D. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp331 · Cited by 170
Zhu, R., Zeng, D., & Kosorok, M. R. (2015) · Journal of the American Statistical Association · doi:10.1080/01621459.2015.1036994 · Cited by 168
Gérard Biau, A., & Devroye, L. (2010) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2010.06.019 · Cited by 156
Bernard, S., Adam, S., & Heutte, L. (2012) · Pattern Recognition Letters · doi:10.1016/j.patrec.2012.04.003 · Cited by 144
On the asymptotics of random forests
Scornet, E. (2015) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2015.06.009 · Cited by 135
Self-citationA weighted random forests approach to improve predictive performance
Winham, S. J., Freimuth, R. R., & Biernacka, J. M. (2013) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11196 · Cited by 134
Variance reduction in purely random forests
Genuer, R. (2012) · Journal of nonparametric statistics · doi:10.1080/10485252.2012.677843 · Cited by 127
Empirical comparison of tree ensemble variable importance measures
Auret, L., & Aldrich, C. (2010) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2010.12.004 · Cited by 125
Limiting the Number of Trees in Random Forests
Latinne, P., Debeir, O., & Decaestecker, C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48219-9_18 · Cited by 124
Analysis of purely random forests biasPreprint
Arlot, S., & Genuer, R. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.3939 · Cited by 100
Kruppa, J., Liu, Y., Biau, G., Kohler, M., König, I. R., Malley, J. D., & Ziegler, A. (2014) · Biometrical Journal · doi:10.1002/bimj.201300068 · Cited by 97
On the Rate of Convergence of the Bagged Nearest Neighbor Estimate
Gérard Biau, A., Cérou, F., Rennes, I., Atlantique, B., Guyader, A., & Lugosi, G. (2009) · HAL · Cited by 95
On the Distribution of the Number of Admissible Points in a Vector Random Sample
Barndorff-Nielsen, O. E., & Sobel, M. (1966) · Theory of Probability and Its Applications · doi:10.1137/1111020 · Cited by 93
Consistency of Online Random ForestsPreprint
Denil, M., Matheson, D., & de Freitas, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4853 · Cited by 88
The Random Forest Kernel and other kernels for big data from random partitionsPreprint
Davies, A., & Ghahramani, Z. (2014) · Cambridge University Engineering Department Publications Database · doi:10.48550/arxiv.1402.4293 · Cited by 82
Asymptotic Theory for Random ForestsPreprint
Wager, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.0352 · Cited by 79
Kruppa, J., Liu, Y., Diener, H., Holste, T., Weimar, C., König, I. R., & Ziegler, A. (2014) · Biometrical Journal · doi:10.1002/bimj.201300077 · Cited by 70
Clémençon, S., & Vayatis, N. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2025558 · Cited by 64
yaImpute: An R Package for kNN Imputation
Finley, A. O., & Crookston, N. L. (2007) · DOAJ (DOAJ: Directory of Open Access Journals) · Cited by 64
Confidence sets for split points in decision trees
Banerjee, M., & McKeague, I. W. (2007) · The Annals of Statistics · doi:10.1214/009053606000001415 · Cited by 64
Spatially Adaptive Random Forests
Geremia, E., Menze, B. H., & Ayache, N. (2013) · IEEE International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi.2013.6556781 · Cited by 60
Clémençon, S., Depecker, M., & Vayatis, N. (2013) · HAL · Cited by 59
Forest-RK: A New Random Forest Induction Method
Bernard, S., Heutte, L., & Adam, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85984-0_52 · Cited by 58
Yan, D., Chen, A., & Jordan, M. I. (2013) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2013.04.010 · Cited by 52
Confidence sets for split points in decision treesPreprint
Banerjee, M., & McKeague, I. W. (2006) · Cited by 49
Casting Random Forests as Artificial Neural Networks (and Profiting from It)
Welbl, J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11752-2_66 · Cited by 44
Bai, Z., Devroye, L., Hwang, H., & Tsai, T. (2005) · Random Structures and Algorithms · doi:10.1002/rsa.20053 · Cited by 40
Random Forests with Missing Values in the Covariates
Rieger, A., Hothorn, T., & Strobl, C. (2010) · Open access LMU (Ludwid Maxmilian's Universitat Munchen) · doi:10.5282/ubm/epub.11481 · Cited by 37
Joly, A., Geurts, P., & Wehenkel, L. A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44848-9_39 · Cited by 26
Meinshausen, N. (2009) · Electronic Journal of Statistics · doi:10.1214/09-ejs434 · Cited by 22
Fast growing and interpretable oblique trees via logistic regression models
Truong, A. K. Y. (2009) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.5287/ora-2z7n81pnz · Cited by 18
On safari to Random Jungle: a fast implementation of Random Forests for high-dimensional data
Schwarz, D. F., König, I. R., & Ziegler, A. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr004 · Cited by 18
Ensemble Trees and CLTs: Statistical Inference for Supervised LearningPreprint
Mentch, L., & Hooker, G. (2014) · arXiv (Cornell University) · Cited by 17
Non-uniform feature sampling for decision tree ensembles
Kyrillidis, A., & Zouzias, A. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6854463 · Cited by 12
Imputation of Missing Values for Unsupervised Data Using the Proximity in Random Forests
Ishioka, T. (2013) · Cited by 12
Approximate False Positive Rate Control in Selection Frequency for Random ForestPreprint
Konukoğlu, E., & Ganz, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.2838 · Cited by 10
Gérard Biau, A., & Devroye, L. (2013) · Electronic Journal of Statistics · doi:10.1214/13-ejs829 · Cited by 8
Zeng, D., Zhu, R., & Kosorok, M. R. (2020) · Carolina Digital Repository (University of North Carolina at Chapel Hill) · doi:10.17615/v9dj-6b88 · Cited by 8
Gérard Biau, A., & Devroye, L. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11662-4_2 · Cited by 7
Yi, Z., Soatto, S., Dewan, M., et al. (2012) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2012.6181810 · Cited by 4
Kernel induced random survival forestsPreprint
Yang, F., Wang, J., & Fan, G. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1008.3952 · Cited by 3
A Novel Test for Additivity in Supervised Ensemble LearnersPreprint
Mentch, L., & Hooker, G. (2014) · arXiv (Cornell University) · Cited by 2
Random forests and kernel methodsPreprint
Scornet, E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.03836 · Cited by 2
Self-citationFormal Hypothesis Tests for Additive Structure in Random ForestsPreprint
Mentch, L., & Hooker, G. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.1845
Research works printed but not linked: 3
- Cutler A, Zhao G (2001) PERT—perfect random tree ensembles. Comput Sci Stat 33:490–497
- Howard J, Bowles M (2012) The two most important algorithms in predictive modeling today. In: Strata Conference: Santa Clara. http://strataconf.com/strata2012/public/schedule/detail/22658
- Wager S, Hastie T, Efron B (2014) Confidence intervals for random forests: the jackknife and the infinitesimal jackknife. J Mach Learn Res 15:1625–1651
Cited by
Athey, S., Tibshirani, J., & Wager, S. (2019) · The Annals of Statistics · doi:10.1214/18-aos1709 · Cited by 1,870
Hyperparameters and tuning strategies for random forest
Probst, P., Wright, M. N., & Boulesteix, A. (2019) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1301 · Cited by 1,640
A systematic literature review of machine learning methods applied to predictive maintenance
Carvalho, T. P., Soares, F. A. A. M. N., Vita, R., Francisco, R. D. P., Basto, J. P., & Alcalá, S. G. S. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106024 · Cited by 1,576
Hengl, T., Nussbaum, M., Wright, M. N., Heuvelink, G. B. M., & Gräler, B. (2018) · PeerJ · doi:10.7717/peerj.5518 · Cited by 1,094
Global soil pollution by toxic metals threatens agriculture and human health
Hou, D., Jia, X., Wang, L., McGrath, S. P., Zhu, Y.-G., Hu, Q., Zhao, F.-J., Bank, M. S., O’Connor, D., & Nriagu, J. (2025) · Science · doi:10.1126/science.adr5214 · Cited by 1,016
Metadata
- Authors
- Biau, G., & Scornet, E.
- Affiliations
- Centre National de la Recherche Scientifique (FR)
- ORCID
- Scornet, Erwan
- Venue
- Test
- Published
- 2016-04-19
- Volume
- 25
- Issue
- 2
- Pages
- 197-227
- ISSN
- 1133-0686 (ISSN-L)
- 1863-8260
- OpenAlex
- W2216946510
- Cited by
- 4,149
- References
- 124
- Citations by year
- 2026: 570 · 2025: 934 · 2024: 829 · 2023: 701 · 2022: 463 · 2021: 317 · 2020: 170 · 2019: 100 · 2018: 43 · 2017: 15 · 2016: 6
- FWCI
- 55.39
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Test (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- HAL (submittedVersion, other-oa)
- HAL (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Applications
- Keywords
- random forest, ensemble learning, decision tree, variable importance measures, resampling, parameter selection, classification, regression analysis, high-dimensional data
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.