Report · 1999
Random Forests--Random Features
UC Berkeley · Published 1 January 1999
In brief
“Random Forests--Random Features” is a 1999 report by Leo Breiman, published in UC Berkeley. OpenAlex counts 212 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 212
- Most cited in
- 2021 (24)
- References
- 10
- Authors
- 1
Abstract
Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. The generalization error for forests converges a.s. to a limit as the number of trees in the forest becomes large. The error… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Breiman, L. (1999). Random Forests--Random Features. UC Berkeley. http://stat-reports.lib.berkeley.edu/accessPages/567.html
MLA 9
Breiman, Leo. “Random Forests--Random Features.” UC Berkeley, 1999. http://stat-reports.lib.berkeley.edu/accessPages/567.html.
Chicago
Breiman, Leo. 1999. “Random Forests--Random Features.” UC Berkeley. http://stat-reports.lib.berkeley.edu/accessPages/567.html.
Harvard
Breiman, L. (1999) ‘Random Forests--Random Features’, UC Berkeley. Available at: http://stat-reports.lib.berkeley.edu/accessPages/567.html.
IEEE
L. Breiman, “Random Forests--Random Features,” UC Berkeley, 1999.
BibTeX
@article{breiman1999random,
title = {{Random Forests--Random Features}},
author = {Breiman, Leo},
journal = {UC Berkeley},
year = {1999},
url = {http://stat-reports.lib.berkeley.edu/accessPages/567.html}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2016 | 8 | |
| 2017 | 3 | |
| 2018 | 8 | |
| 2019 | 11 | |
| 2020 | 14 | |
| 2021 | 24 | |
| 2022 | 11 | |
| 2023 | 12 | |
| 2024 | 8 | |
| 2025 | 3 |
Topic and keywords
Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- random forest
- random features
- ensemble learning
- classification trees
- generalization error
- feature selection
- AdaBoost comparison
- noise robustness
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Breiman, L. (1999). Random Forests--Random Features. UC Berkeley. http://stat-reports.lib.berkeley.edu/accessPages/567.html
How many times has this paper been cited?
212 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Leo Breiman.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.