An asymptotic analysis of AdaBoost in the binary classification case (1998)
| Venue: | PROCEEDING OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL NEURAL NETWORKS |
| Citations: | 11 - 5 self |
BibTeX
@INPROCEEDINGS{Onoda98anasymptotic,
author = {T. Onoda and G. Rätsch and K.-R. Müller},
title = {An asymptotic analysis of AdaBoost in the binary classification case},
booktitle = {PROCEEDING OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL NEURAL NETWORKS},
year = {1998},
pages = {195--200},
publisher = {In Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recent work has shown that combining multiple versions of weak classifiers such as decision trees or neural networks results in reduced test set error. To study this in greater detail, we analyze the asymptotic behavior of AdaBoost type algorithms. The theoretical analysis establishes the relation between the distribution of margins of the training examples and the generated voting classification rule. The paper shows asymptotic experimental results for the binary classification case underlining the theoretical findings. Finally, the relation between the model complexity and noise in the training data, and how to improve AdaBoost type algorithms in practice are discussed.
Citations
| 6696 | The Nature of Statistical Learning Theory - Vapnik - 1995 |
| 1998 | Bagging predictors - Breiman - 1996 |
| 113 | Prediction games and arcing algorithms - Breiman - 1997 |
| 2 | Neural Networks for Pattern Recognation - Bishop - 1995 |
| 1 | et al. Neural Networks - LeCun - 1995 |
