article · 2011

Ensemble Learning

Martin Sewell

Cited by 0Abstract and details only

Abstract

This note presents a chronological review of the literature on ensemble learning which has accumulated over the past twenty years. The idea of ensemble learning is to employ multiple learners and combine their predictions. If we have a committee of M models with uncorrelated errors, simply by averaging them the average error of a model can be reduced by a factor of M. Unfortunately, the key assumption that the errors due to the individual models are uncorrelated is unrealistic; in practice, the errors are typically highly correlated, so the reduction in overall error is generally small. However, by making use of Cauchy’s inequality, it can be shown that the expected committee error will not exceed the expected error of the constituent models. In this article the literature in general is reviewed, with, where possible, an emphasis on both theory and practical advice, then a taxonomy is provided, and finally four ensemble methods are covered in greater detail: bagging, boosting (including AdaBoost), stacked generalization and the random subspace method. Ensemble Learning

Cite this paper

APA 7

Sewell, M. (2011). Ensemble Learning.

MLA 9

Sewell, Martin. “Ensemble Learning.” 2011.

Chicago

Sewell, Martin. 2011. “Ensemble Learning.”

Harvard

Sewell, M. (2011) ‘Ensemble Learning’.

BibTeX

@article{sewell2011ensemble,
  title = {{Ensemble Learning}},
  author = {Sewell, Martin},
  year = {2011}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.