An empirical comparison of three boosting algorithms on real data sets with artificial class noise

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2709, Issue , 2003, Pages 35-44

  McDonald, Ross A ^a   Hand, David J ^a   Eckley, Idris A ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b SHELL Research   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; ERRORS;

AVERAGE ERRORS; BASE LEARNERS; BOOSTING ALGORITHM; CONFIDENCE INTERVAL; EMPIRICAL - COMPARISONS; EMPIRICAL STUDIES; ENSEMBLE CLASSIFIERS; REAL DATA SETS;

ALGORITHMS;

EID: 33846991416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44938-8_4     Document Type: Review

References (23)

1. ∼mlearn/MLRepository.html.
2. E. L. Allwein, R. E. Schapire, and Y. Singer. Reducing multiclass to binary: A unifying approach for margin classifiers. Journal of Machine Learning Research, 1:113-141, 2000.
3. E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Machine Learning, 36:105-142, 1999.
4. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, U.S., 1984.
5. T. G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. AI Magazine, 18:97-136, 1997.
6. C. Domingo and O. Watanabe. Madaboost: A modification of adaboost. In Thirteenth Annual Conference on Computational Learning Theory, 2000.
7. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121, 1995.
8. Y. Freund. An adaptive version of the boost by majority algorithm. Machine Learning 43, 3:293-318, 2001.
9. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. In Second European Conference on Computational Learning Theory, 1995.
10. Y. Freund and R. E. Schapire. A short introduction to boosting. Journal of Japanese Society for Artificial Intelligence, 14:771-780, 1999.
11. J. H. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: A statistical view of boosting. The Annals of Statistics, 28:337-374, 2000.
12. D. J. Hand. Construction and Assessment of Classification Rules. John Wiley & Sons, Chichester, 1997.
13. W. Jiang. Some results on weakly accurate base learners for boosting regression and classification. In Proceedings of the First International Workshop on Multiple Classifier Systems, pages 87-96, 2000.
14. M. Kearns and L. G. Valiant. Learning boolean formulae or finite automata is as hard as factoring. Technical Report TR-14-88, Harvard University Aiken Computation Laboratory, 1988.
15. O. L. Mangasarian and W. H. Wolberg. Cancer diagnosis via linear programming. SIAM News, 23(5):1-18, 1990.
16. R. A. McDonald, I. A. Eckley, and D. J. Hand. A multi-class extension to the brownboost algorithm. In Submission.
17. J. R. Quinlan. The effect of noise on concept learning. In R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach, volume 2, San Mateo, CA, 1986. Morgan Kauffmann.
18. J. R. Quinlan. C4-5: Programs for Machine Learning. Morgan Kaufmann, 1993.
19. J. R. Quinlan. Bagging, boosting and c4.5. AAAI/IAAI, 1:725-730, 1996.
20. R. E. Schapire. The strength of weak learnability. Machine Learning, 5:197-227, 1990.
21. R. E. Schapire, Y. Freund, P. Bartlett, and W. S. Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26:1651-1686, 1998.
22. R. E. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37:297-336, 1999.
23. L. G. Valiant. A theory of the learnable. Artificial Intelligence and Language Processing, 27:1134-1142, 1984.