Abstract

Boosting is a general method for improving the accuracy of any given learning algorithm. Focusing primarily on the AdaBoost algorithm, this chapter overviews some of the recent work on boosting including analyses of AdaBoost's training error and generalization error; boosting's connection to game theory and linear programming; the relationship between boosting and logistic regression; extensions of AdaBoost for multiclass classification problems; methods of incorporating human knowledge into boosting; and experimental and applied work using boosting.

Citations

565	Learnability and the Vapnik Chervonenkis dimension - Blumer, Ehrenfeucht, et al. - 1989
449	An Empirical Comparison of Voting Classification Algorithms - Bauer, Kohavi - 1999
332	Reducing multiclass to binary: A unifying approach for margin classifiers - Allwein, Schapire, et al. - 2000
296	What size net gives valid generalization - Baum, Haussler - 1989
156	The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network - Bartlett
62	Boosting applied to tagging and PP attachment - Abney, Schapire, et al. - 1999