Leo Breiman

Leo Breiman is a person.

• See: CART Algorithm, Bagging Algorithm, Gradient Boosting.

---

---

References

• DBLP Author Page: http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/b/Breiman:Leo.html
• Google Scholar Author Page: https://scholar.google.com/citations?user=mXSv_1UAAAAJ

2001

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

2001

• (Breiman, 2001) ⇒ Leo Breiman. (2001). “Statistical Modeling: The Two Cultures.” In: Quality control and applied statistics, 48(1).

1998

• (Breiman, 1998) ⇒ Leo Breiman. (1998). “Arcing classifier (with discussion and a rejoinder by the author)." The annals of statistics 26, no. 3 (1998): 801-849.

1997

• (Breiman, 1997) ⇒ Leo Breiman. (1997). “Arcing the Edge.” Technical Report 486, Statistics Department, University of California at Berkeley,

1996

• (Breiman, 1996) ⇒ Leo Breiman. (1996). “Bagging Predictors.” In: Machine Learning, 24(2). doi:10.1023/A:1018054314350

1994

• (Breiman, 1994) ⇒ Leo Breiman. (1994). “Bagging Predictors." Technical Report.

1992

• (Breiman, 1992) ⇒ Leo Breiman. (1992). “Probability." CRC Press. ISBN:0898712963

1984

• (Breiman et al., 1984) ⇒ Leo Breiman, Jerome H. Friedman, Charles J. Stone, and R. A. Olshen. (1984). “Classification and Regression Trees." Chapman & Hall/CRC. ISBN:0412048418
  • BOOK OVERVIEW: The methodology used to construct tree structured rules is the focus of this monograph. Unlike many other statistical procedures, which moved from pencil and paper to calculators, this text's use of trees was unthinkable before computers. Both the practical and theoretical sides have been developed in the authors' study of tree methods. Classification and Regression Trees reflects these two sides, covering the use of trees as a data analysis method, and in a more mathematical framework, proving some of their fundamental properties.

---