Leo Breiman

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Leo Breiman
Leo Breiman.jpg
Leo Breiman in 2003
Born (1928-01-27)January 27, 1928
New York City, USA
Died July 5, 2005(2005-07-05) (aged 77)
Berkeley, California, USA
Nationality  USA
Fields Statistics
Institutions University of California, Berkeley
Alma mater University of California, Berkeley
Thesis Homogeneous Processes (1954)
Doctoral advisor Michel Loève
Doctoral students Smarajit Bose, Samuel Buttrey, Chao Chen, Adele Cutler, Robert Koyak, Nong Shang
Known for CART, Bagging, Random forest

Leo Breiman (January 27, 1928 – July 5, 2005) was a distinguished statistician at the University of California, Berkeley. He was the recipient of numerous honors and awards, and was a member of the United States National Academy of Science.

Breiman's work helped to bridge the gap between statistics and computer science, particularly in the field of machine learning. His most important contributions were his work on classification and regression trees and ensembles of trees fit to bootstrap samples. Bootstrap aggregation was given the name bagging by Breiman. Another of Breiman's ensemble approaches is the random forest.

External links[edit]