HackerPapers

arXiv:1403.1452stat.ME

The Evolution of Boosting Algorithms - From Machine Learning to Statistical Modelling

Andreas Mayr, Harald Binder, Olaf Gefeller, Matthias Schmid

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

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.

arXiv comments
Journal reference
Methods Inf Med 2014; 53(6): 419-427
DOI
doi:10.3414/ME13-01-0122
Subjects
stat.MEMethodology (Statistics)

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Nov 2014 to Nov 2014. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.