The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Hyperparameters and tuning strategies for random forest
Open accessAbstract
The random forest (RF) algorithm has several hyperparameters that have to be set by the user, for example, the number of observations drawn randomly for each tree and whether they are drawn with or without replacement, the number of variables drawn randomly for each split, the splitting rule, the minimum number of samples that a node must contain, and the number of trees. In this paper, we first provide a literature review on the parameters' influence on the prediction performance and on variable importance measures. It is well known that in most cases RF works reasonably well with the default values of the hyperparameters specified in software packages. Nevertheless, tuning the hyperparameters can improve the performance of RF. In the second part of this paper, after a presenting brief overview of tuning strategies, we demonstrate the application of one of the most established tuning strategies, model‐based optimization (MBO). To make it easier to use, we provide the tuneRanger R package that tunes RF with MBO automatically. In a benchmark study on several datasets, we compare the prediction performance and runtime of tuneRanger with other tuning implementations in R and RF with default hyperparameters. This article is categorized under:Algorithmic Development > Biological Data Mining Algorithmic Development > Statistics Algorithmic Development > Hierarchies and Trees 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
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
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
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
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
Sequential Model-Based Optimization for General Algorithm Configuration
Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25566-3_40 · Cited by 2,469
Random Forests and Adaptive Nearest Neighbors
Lin, Y., & Jeon, Y. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000001230 · Cited by 507
Cited by
The global distribution of known and undiscovered ant biodiversity
Kass, J. M., Guénard, B., Dudley, K. L., Jenkins, C. N., Azuma, F., Fisher, B. L., Parr, C. L., Gibb, H., Longino, J. T., Ward, P. S., et al. (2022) · Science Advances · doi:10.1126/sciadv.abp9908 · Cited by 194
State of charge estimation for electric vehicles using random forest
Sulaiman, M. H., & Mustaffa, Z. (2024) · Green Energy and Intelligent Transportation · doi:10.1016/j.geits.2024.100177 · Cited by 102
Agricultural input shocks affect crop yields more in the high-yielding areas of the world
Ahvo, A., Heino, M., Sandström, V., Chrisendo, D., Jalava, M., & Kummu, M. (2023) · Nature Food · doi:10.1038/s43016-023-00873-z · Cited by 78
“Random forest can be adjusted with different hyperparameter values 45 .”
BackgroundAutomated invoice processing: Machine learning-based information extraction for long tail suppliers
Krieger, F., Drews, P., & Funk, B. (2023) · Intelligent Systems with Applications · doi:10.1016/j.iswa.2023.200285 · Cited by 11
Ramian, A., & Elhajjar, R. (2024) · Journal of Composites Science · doi:10.3390/jcs8080326 · Cited by 10
“It is important to note that the quantity of trees directly impacts the stability of the predictions in the RF [70,71].”
Metadata
- Authors
- Probst, P., Wright, M. N., & Boulesteix, A.
- Venue
- WIREs Data Mining and Knowledge Discovery
- Publisher
- Wiley
- Published
- 2019-01-28
- Volume
- 9
- Issue
- 3
- ISSN
- 1942-4787 (ISSN-L)
- 1942-4795
- OpenAlex
- W2797928606
- Cited by
- 1,640
- References
- 7
- FWCI
- 75.53
- Type
- journal article
- Language
- en
- Open access
- green
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: Hyperparameters and tuning strategies for random forest. https://app.cochat.ai/papers/10.1002/widm.1301
- The paper
- Probst, P., Wright, M. N., & Boulesteix, A. (2019). Hyperparameters and tuning strategies for random forest. WIREs Data Mining and Knowledge Discovery. https://doi.org/10.1002/widm.1301
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.