Report · 1999

Random Forests--Random Features

Leo Breiman

UC Berkeley · Published 1 January 1999

View at the publisherCite this paper

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

YearCitationsShare of the best year
201688
201733
201888
20191111
20201414
20212424
20221111
20231212
202488
202533

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

All highly cited Mathematics papers

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.