DMCA
Ensemble Methods in Machine Learning (2000)
Cached
Download Links
- [web.engr.oregonstate.edu]
- [web.engr.oregonstate.edu]
- [ftp.cs.orst.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | MULTIPLE CLASSIFIER SYSTEMS, LBCS-1857 |
| Citations: | 624 - 3 self |
BibTeX
@INPROCEEDINGS{Dietterich00ensemblemethods,
author = {Thomas G. Dietterich},
title = {Ensemble Methods in Machine Learning},
booktitle = {MULTIPLE CLASSIFIER SYSTEMS, LBCS-1857},
year = {2000},
pages = {1--15},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Ensemble methods are learning algorithms that construct a set of classifiers and then classify new data points by taking a (weighted) vote of their predictions. The original ensemble method is Bayesian averaging, but more recent algorithms include error-correcting output coding, Bagging, and boosting. This paper reviews these methods and explains why ensembles can often perform better than any single classifier. Some previous studies comparing ensemble methods are reviewed, and some new experiments are presented to uncover the reasons that Adaboost does not overfit rapidly.
