2014/01/01 by Andreas Mayr, H. Binder, Harald Binder +5 · 1 voice · 2 citations
Computer Science · Mathematics · #Machine Learning and Data Classification #Neural Networks and Applications #Statistical Methods and Inference #stat.ME
paper · pdf · doi:10.3414/me13-01-0122
published as Methods Inf Med 2014; 53(6): 419-427
crossref issued 2014/01/01 · crossref published 2014/01/01 · crossref published-print 2014/01/01 · crossref created 2014/08/12 · arxiv created 2014/11/18 · arxiv updated 2014/11/19 · openalex publication_date 2016/08/17 · crossref published-online 2018/01/20 · crossref deposited 2025/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28 · crossref indexed 2026/07/30
The concept of boosting emerged from the field of machine learning. The basic idea is to boost the accuracy of a weak classifying tool by combining various instances into a more accurate prediction. This general concept was later adapted to the field of statistical modelling. This review article attempts to highlight this evolution of boosting algorithms from machine learning to statistical modelling. We describe the AdaBoost algorithm for classification as well as the two most prominent statistical boosting approaches, gradient boosting and likelihood-based boosting. Although both appraoches are typically treated separately in the literature, they share the same methodological roots and follow the same fundamental concepts. Compared to the initial machine learning algorithms, which must be seen as black-box prediction schemes, statistical boosting result in statistical models which offer a straight-forward interpretation. We highlight the methodological background and present the most common software implementations. Worked out examples and corresponding R code can be found in the Appendix.