9/20/21, 2:30 PM Random Forests | SpringerLink

Search Log in

Download PDF

Published: October 2001

Random Forests
Leo Breiman 

Machine Learning
 45, 5–32 (2001)

280k Accesses

42218 Citations

139 Altmetric

Metrics

Abstract

Random forests are a combination of tree predictors

Your privacy
such that each tree depends on the values of a
We use cookies
random to make
vector sure that
sampled our website works
independently andproperly, as well as some "optional" cookies to personalise
with the
content and advertising, provide social media features and analyse how people use our site. By accepting some or
same distribution for all trees in the forest. The
all optional cookies you give consent to the processing of your personal data, including transfer to third parties,
generalization error for
some in countries outside forests
of the converges
European a.s. that
Economic Area to ado not offer the same data protection standards as
the country where you live. You can decide which optional cookies to accept by clicking on "Manage Settings",
limit as the number of trees in the forest becomes
where you can also find more information about how your personal data is processed. View our privacy policy
large. The generalization error of a forest of tree
classifiers depends onAccept
Manage Settings the strength of the individual
All Cookies
trees in the forest and the correlation between them.
https://link.springer.com/article/10.1023/a:1010933404324 1/6
9/20/21, 2:30 PM Random Forests | SpringerLink

Using a random selection of features to split each

node yields error rates that compare favorably to
Adaboost (Y. Freund & R. Schapire, Machine
Learning: Proceedings of the Thirteenth
International conference, ***, 148–156), but are
more robust with respect to noise. Internal estimates
monitor error, strength, and correlation and these
are used to show the response to increasing the
number of features used in the splitting. Internal
estimates are also used to measure variable
importance. These ideas are also applicable to
regression.

Download to read the full article text

References

1. Amit, Y. & Geman, D. (1997). Shape

quantization and recognition with randomized
trees. Neural Computation, 9, 1545–1588.

2. Amit, Y., Blanchard, G., & Wilder, K. (1999).

Multiple randomized classifiers: MRCL
Technical Report, Department of Statistics,
University of Chicago.
Your privacy
We 3.useBauer,
cookies E. & Kohavi,
to make R.our
sure that (1999).
websiteAn empirical
works properly, as well as some "optional" cookies to personalise
content and advertising,
comparison ofprovide
votingsocial media features
classification and analyse how people use our site. By accepting some or
algorithms.
all optional cookies you give consent to the processing of your personal data, including transfer to third parties,
Machine Learning, 36(1/2), 105–139.
some in countries outside of the European Economic Area that do not offer the same data protection standards as
the country where you live. You can decide which optional cookies to accept by clicking on "Manage Settings",
where you can alsoL.
4. Breiman, find more information
(1996a). Baggingabout how your personal data is processed. View our privacy policy
predictors.
Machine Learning 26(2), 123–140.
Manage Settings Accept All Cookies

https://link.springer.com/article/10.1023/a:1010933404324 2/6
9/20/21, 2:30 PM Random Forests | SpringerLink

5. Breiman, L. (1996b). Out-of-bag estimation,

ftp.stat.berkeley.edu/pub/users/breiman/OOBestimation.ps

6. Breiman, L. (1998a). Arcing classifiers

(discussion paper). Annals of Statistics, 26,
801–824.

7. Breiman. L. (1998b). Randomizing outputs to

increase prediction accuracy. Technical Report
518, May 1, 1998, Statistics Department, UCB
(in press, Machine Learning).

8. Breiman, L. 1999. Using adaptive bagging to

debias regressions. Technical Report 547,
Statistics Dept. UCB.

9. Breiman, L. 2000. Some infinity theory for

predictor ensembles. Technical Report 579,
Statistics Dept. UCB.

10. Dietterich, T. (1998). An experimental

comparison of three methods for constructing
ensembles of decision trees: Bagging, boosting
and randomization, Machine Learning, 1–22.

11. Freund, Y. & Schapire, R. (1996). Experiments

Yourwith
privacy
a new boosting algorithm, Machine
We use cookies to make sure that our website works properly, as well as some "optional" cookies to personalise
Learning: Proceedings of the Thirteenth
content and advertising, provide social media features and analyse how people use our site. By accepting some or
International
all optional Conference,
cookies you give 148–156.
consent to the processing of your personal data, including transfer to third parties,
some in countries outside of the European Economic Area that do not offer the same data protection standards as
the country where you live. You can decide which optional cookies to accept by clicking on "Manage Settings",
12. Grove, A. & Schuurmans, D. (1998). Boosting in
where you can also find more information about how your personal data is processed. View our privacy policy
the limit: Maximizing the margin of learned
Manage Settings In
ensembles. Accept All Cookies
Proceedings of the Fifteenth

https://link.springer.com/article/10.1023/a:1010933404324 3/6
9/20/21, 2:30 PM Random Forests | SpringerLink

National Conference on Artificial Intelligence

(AAAI-98).

13. Ho, T. K. (1998). The random subspace method

for constructing decision forests. IEEE Trans.
on Pattern Analysis and Machine Intelligence,
20(8), 832–844.

14. Kleinberg, E. (2000). On the algorithmic

implementation of stochastic discrimination.
IEEE Trans. on Pattern Analysis and Machine
Intelligence, 22(5), 473–490.

15. Schapire, R., Freund, Y., Bartlett, P., & Lee,W.

(1998). Boosting the margin:Anewexplanation
for the effectiveness of voting methods. Annals
of Statistics, 26(5), 1651–1686.

16. Tibshirani, R. (1996). Bias, variance, and

prediction error for classification rules.
Technical Report, Statistics Department,
University of Toronto.

17. Wolpert, D. H. & Macready, W. G. (1997). An

efficient method to estimate Bagging's
generalization error (in press, Machine
Your privacy
Learning).
We use cookies to make sure that our website works properly, as well as some "optional" cookies to personalise
content and advertising, provide social media features and analyse how people use our site. By accepting some or

Author information
all optional cookies you give consent to the processing of your personal data, including transfer to third parties,
some in countries outside of the European Economic Area that do not offer the same data protection standards as
the country where you live. You can decide which optional cookies to accept by clicking on "Manage Settings",
Affiliations
where you can also find more information about how your personal data is processed. View our privacy policy

1. Statistics
Manage Department,
Settings University
Accept All Cookies of California,
Berkeley, CA, 94720
https://link.springer.com/article/10.1023/a:1010933404324 4/6
9/20/21, 2:30 PM Random Forests | SpringerLink

Leo Breiman

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Breiman, L. Random Forests.
Machine Learning 45,
5–32 (2001).
https://doi.org/10.1023/A:1010933404324

Issue DateOctober 2001

DOIhttps://doi.org/10.1023/A:1010933404324

Share this article

Anyone you share the following link with will be able
to read this content:

Get shareable link

Provided by the Springer Nature SharedIt content-

sharing initiative

Yourclassification
privacy
We use cookies to make sure that our website works properly, as well as some "optional" cookies to personalise
regression
content and advertising, provide social media features and analyse how people use our site. By accepting some or
ensemble
all optional cookies you give consent to the processing of your personal data, including transfer to third parties,
some in countries outside of the European Economic Area that do not offer the same data protection standards as
the country where you live. You can decide which optional cookies to accept by clicking on "Manage Settings",
Not logged
where in
-
you can also128.113.55.88
find more information about how your personal data is processed. View our privacy policy

North East Research

Manage Settings Libraries
Accept (8200828607)
All Cookies - The Libraries at Rensselaer Polytechnic Institute
(8200972206)
https://link.springer.com/article/10.1023/a:1010933404324 5/6
9/20/21, 2:30 PM Random Forests | SpringerLink

© 2021 Springer Nature Switzerland AG. Part of Springer Nature.

Your privacy
We use cookies to make sure that our website works properly, as well as some "optional" cookies to personalise
content and advertising, provide social media features and analyse how people use our site. By accepting some or
all optional cookies you give consent to the processing of your personal data, including transfer to third parties,
some in countries outside of the European Economic Area that do not offer the same data protection standards as
the country where you live. You can decide which optional cookies to accept by clicking on "Manage Settings",
where you can also find more information about how your personal data is processed. View our privacy policy

Manage Settings Accept All Cookies

https://link.springer.com/article/10.1023/a:1010933404324 6/6