2001 RandomForests

• (Breiman, 2001) ⇒ Leo Breiman. (2001). “Random Forests.” In: Machine Learning, 45(1). doi:10.1023/A:1010933404324

Subject Headings: Random Forest Training Algorithm, Random Forest Model.

Notes

• http://www.stat.berkeley.edu/~breiman/RandomForests/

Cited By

• ~4505 http://scholar.google.com/scholar?q=%22Random+Forests%22+2001

Quotes

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 as to a limit as the number of trees in the forest becomes large. The generalization error of a forest of tree classifiers depends on the strength of the individual trees in the forest and the correlation between them. 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.

---

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2001 RandomForests	Leo Breiman			Random Forests		Machine Learning (ML) Subject Area	ftp://ftp.stat.berkeley.edu/pub/users/breiman/randomforest2001.pdf	10.1023/A:1010933404324		2001