Keywords
Boosting (machine learning)AdaBoostArtificial intelligenceComputer scienceMachine learningDecision treePattern recognition (psychology)Word error rateMathematicsVotingNaive Bayes classifierStatisticsSupport vector machine
Affiliated Institutions
Related Publications
Bagging, boosting, and C4.S
Breiman's bagging and Freund and Schapire's boosting are recent methods for improving the predictive power of classifier learning systems. Both form a set of classifiers that ar...
Boosting the margin: a new explanation for the effectiveness of voting methods
One of the surprising recurring phenomena observed in experiments\nwith boosting is that the test error of the generated classifier usually does\nnot increase as its size become...
Experiments with a new boosting algorithm
In an earlier paper, we introduced a new "boosting" algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learni...
A Communication-Efficient Parallel Algorithm for Decision Tree
Decision tree (and its extensions such as Gradient Boosting Decision Trees and Random Forest) is a widely used machine learning algorithm, due to its practical effectiveness and...
Boosting the margin: A new explanation for the effectiveness of voting methods
One of the surprising recurring phenomena observed in experiments with boosting is that the test error of the generated classifier usually does not increase as its size becomes ...
Publication Info
- Year
- 1999
- Type
- article
- Volume
- 36
- Issue
- 1-2
- Pages
- 105-139
- Citations
- 2607
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2607
OpenAlex
Cite This
Eric Bauer,
Ron Kohavi
(1999).
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants.
Machine Learning
, 36
(1-2)
, 105-139.
https://doi.org/10.1023/a:1007515423169
Identifiers
- DOI
- 10.1023/a:1007515423169