The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Mining data with random forests: current options for real‐world applications
Abstract
Random Forests are fast, flexible, and represent a robust approach to mining high‐dimensional data. They are an extension of classification and regression trees (CART). They perform well even in the presence of a large number of features and a small number of observations. In analogy to CART, random forests can deal with continuous outcome, categorical outcome, and time‐to‐event outcome with censoring. The tree‐building process of random forests implicitly allows for interaction between features and high correlation between features. Approaches are available to measuring variable importance and reducing the number of features. Although random forests perform well in many applications, their theoretical properties are not fully understood. Recently, several articles have provided a better understanding of random forests, and we summarize these findings. We survey different versions of random forests, including random forests for classification, random forests for probability estimation, and random forests for estimating survival data. We discuss the consequences of (1) no selection, (2) random selection, and (3) a combination of deterministic and random selection of features for random forests. Finally, we review a backward elimination and a forward procedure, the determination of trees representing a forest, and the identification of important variables in a random forest. Finally, we provide a brief overview of different areas of application of random forests. WIREs Data Mining Knowl Discov 2014, 4:55–63. doi: 10.1002/widm.1114 This article is categorized under: Algorithmic Development > Statistics Application Areas > Data Mining Software Tools Technologies > Classification Technologies > Machine Learning
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
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
Bias in random forest variable importance measures: Illustrations, sources and a solution
Strobl, C., Boulesteix, A.-L., Zeileis, A., & Hothorn, T. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-25 · Cited by 3,688
Random forest classifier for remote sensing classification
Pal, M. (2005) · International Journal of Remote Sensing · doi:10.1080/01431160412331269698 · Cited by 3,283
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
An empirical comparison of supervised learning algorithms
Caruana, R., & Niculescu-Mizil, A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143865 · Cited by 2,780
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
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
Strobl, C., Malley, J., & Tutz, G. (2009) · Psychological Methods · doi:10.1037/a0016973 · Cited by 2,583
Classification and regression trees
Loh, W. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.8 · Cited by 2,285
Ishwaran, H., Kogalur, U. B., Blackstone, E. H., & Lauer, M. S. (2008) · Cited by 1,310
Random forests for genomic data analysis
Chen, X., & Ishwaran, H. (2012) · Genomics · doi:10.1016/j.ygeno.2012.04.003 · Cited by 953
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
Self-citationAn experimental comparison of classification algorithms for imbalanced credit scoring data sets
Brown, I., & Mues, C. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.09.033 · Cited by 730
Mining data with random forests: A survey and results of new tests
Verikas, A., Gelzinis, A., & Bacauskiene, M. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.08.011 · Cited by 719
Hothorn, T. (2005) · Biostatistics · doi:10.1093/biostatistics/kxj011 · Cited by 684
Analysis of a Random Forests Model
Gérard Biau, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.0208 · Cited by 661
Rokach, L., & Maimon, O. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_9 · Cited by 594
Consistency of Random Forests and Other Averaging Classifiers
Gérard Biau, A., Devroye, L., & Lugosi, G. (2008) · Cited by 457
Data mining in the Life Sciences with Random Forest: a walk in the park or lost in the jungle?
Touw, W. G., Bayjanov, J. R., Overmars, L., Backus, L., Boekhorst, J., Wels, M., & van Hijum, S. A. F. T. (2013) · Briefings in Bioinformatics · doi:10.1093/bib/bbs034 · Cited by 453
Nicodemus, K. K., Malley, J. D., Strobl, C., & Ziegler, A. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-110 · Cited by 376
Self-citationTree-structured survival analysis.
Gordon, L., & Olshen, R. A. (1985) · PubMed · Cited by 274
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
Self-citationIshwaran, H., & Kogalur, U. B. (2007) · Cited by 207
Risk estimation and risk prediction using machine-learning methods
Kruppa, J., Ziegler, A., & König, I. R. (2012) · Human Genetics · doi:10.1007/s00439-012-1194-y · Cited by 181
Self-citationPredictor 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
Bias of the Random Forest Out-of-Bag (OOB) Error for Certain Input Parameters
Mitchell, M. W. (2011) · Open Journal of Statistics · doi:10.4236/ojs.2011.13024 · Cited by 154
Boulesteix, A., Bender, A., Bermejo, J. L., & Strobl, C. (2011) · Briefings in Bioinformatics · doi:10.1093/bib/bbr053 · Cited by 148
Gérard Biau, A., & Devroye, L. (2010) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2010.06.019 · Cited by 124
Chen, C. C. M., Schwender, H. R., Keith, J. M., Nunkesser, R., Mengersen, K. L., & Macrossan, P. E. (2011) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2011.46 · Cited by 107
Search for the smallest random forest
Wang, M., & Zhang, H. (2009) · Statistics and Its Interface · doi:10.4310/sii.2009.v2.n3.a11 · Cited by 106
Performance of random forest when SNPs are in linkage disequilibrium
Meng, Y., Yu, Y., Cupples, L. A., Farrer, L. A., & Lunetta, K. L. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-78 · Cited by 102
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
Self-citation[23] Random Forests for Microarrays
Cutler, A., & Stevens, J. R. (2006) · Methods in enzymology on CD-ROM/Methods in enzymology · doi:10.1016/s0076-6879(06)11023-x · Cited by 92
Variance reduction in purely random forests
Genuer, R. (2012) · Journal of nonparametric statistics · doi:10.1080/10485252.2012.677843 · Cited by 89
Identifying representative trees from ensembles
Banerjee, M., Ding, Y., & Noone, A. (2012) · Statistics in Medicine · doi:10.1002/sim.4492 · Cited by 69
Multigenic Modeling of Complex Disease by Random Forests
Sun, Y. V. (2010) · Advances in genetics · doi:10.1016/b978-0-12-380862-2.00004-7 · Cited by 37
Rodin, A. S., Litvinenko, A., Klos, K. L. E., Morrison, A. C., Woodage, T., Coresh, J., & Boerwinkle, E. (2009) · Journal of Computational Biology · doi:10.1089/cmb.2008.0037 · Cited by 22
Lin, H., Juo, S. H., & Cheng, R. (2005) · BMC Genetics · doi:10.1186/1471-2156-6-s1-s7 · Cited by 8
Research works printed but not linked: 5
- Genuer R Poggi JM Tuleau C. Random Forests: some methodological insights. arXiv: 0811.3619.2008. Available at:http://hal.inria.fr/inria‐00340725/en/;
- Al Ghoson AM, 2010, Decision tree induction & clustering techniques in SAS Enterprise Miner, SPSS Clementine, and IBM Intelligent Miner – a comparative analysis, Int J Manag Inf Syst, 14, 57
- Kursa MB. Robustness of the random forest‐based gene selection methods.2013. Available at:http://arxiv.org/abs/1305.4525. · arXiv
- Sandri M, 2006, Proceedings of the Meeting of the Classification and Data Analysis Group (CLADAG) of the Italian Statistical Society, University of Parma, June 6–8, 2005, 263
- 10.1175/JAS3918.1 · doi:10.1175/jas3918.1
Cited by
Biau, G., & Scornet, E. (2016) · Test · doi:10.1007/s11749-016-0481-7 · Cited by 4,149
ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R
Wright, M. N., & Ziegler, A. (2017) · Journal of Statistical Software · doi:10.18637/jss.v077.i01 · Cited by 3,340
Self-citationHyperparameters 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
Tyralis, H., Papacharalampous, G., & Langousis, A. (2019) · Water · doi:10.3390/w11050910 · Cited by 771
The revival of the Gini importance?
Nembrini, S., König, I. R., & Wright, M. N. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty373 · Cited by 751
Self-citation
Metadata
- Authors
- Ziegler, A., & König, I. R.
- Venue
- WIREs Data Mining and Knowledge Discovery
- Publisher
- Wiley
- Published
- 2013-12-23
- Volume
- 4
- Issue
- 1
- Pages
- 55-63
- ISSN
- 1942-4787 (ISSN-L)
- 1942-4795
- OpenAlex
- W1489463871
- Cited by
- 288
- References
- 42
- FWCI
- 4.59
- Type
- journal article
- Language
- en
- Open access
- closed
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.
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.