An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants

Explore this paper's citation graph

Summary

It is found that Bagging improves when probabilistic estimates in conjunction with no-pruning are used, as well as when the data was backfit, and that Arc-x4 behaves differently than AdaBoost if reweighting is used instead of resampling, indicating a fundamental difference.

Type
article
Published
1999-07-01
Cited by
2,829
References
61
Access
Open access

Keywords

Boosting (machine learning), AdaBoost, Artificial intelligence, Computer science, Machine learning

References

Cited by

Related papers