A Short Introduction to Boosting

Abstract

Boosting is a general method for improving the accuracy of any given learning algorithm. This short overview paper introduces the boosting algorithm AdaBoost, and explains the underlying theory of boosting, including an explanation of why boosting often does not suffer from overfitting as well as boosting's relationship to support-vector machines. Some examples of recent applications of boosting are also described.

Extracted Key Phrases

5 Figures and Tables

Showing 1-10 of 911 extracted citations
0100200'01'03'05'07'09'11'13'15'17
Citations per Year

2,164 Citations

Semantic Scholar estimates that this publication has received between 1,892 and 2,470 citations based on the available data.

See our FAQ for additional information.