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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Mining data with random forests: current options for real‐world applications. https://app.cochat.ai/papers/10.1002/widm.1114
- The paper
- Ziegler, A., & König, I. R. (2014). Mining data with random forests: current options for real‐world applications. WIREs Data Mining and Knowledge Discovery. https://doi.org/10.1002/widm.1114
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.