Theoretical views of boosting

Research output: Chapter in Book/Report/Conference proceedingConference contribution

73 Scopus citations


Boosting is a general method for improving the accuracy of any given learning algorithm. Focusing primarily on the AdaBoost algorithm, we briefly survey theoretical work on boosting including analyses of AdaBoost’s training error and generalization error, connections between boosting and game theory, methods of estimating probabilities using boosting, and extensions of AdaBoost for multiclass classification problems. We also briefly mention some empirical work.

Original languageEnglish (US)
Title of host publicationComputational Learning Theory - 4th European Conference, EuroCOLT 1999, Proceedings
EditorsPaul Fischer, Hans Ulrich Simon
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540657010, 9783540657019
StatePublished - 1999
Externally publishedYes
Event4th European Conference on Computational Learning Theory, EuroCOLT 1999 - Nordkirchen, Germany
Duration: Mar 29 1999Mar 31 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th European Conference on Computational Learning Theory, EuroCOLT 1999

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Theoretical views of boosting'. Together they form a unique fingerprint.

Cite this