A robust boosting algorithm

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

Volumn 2430, Issue , 2002, Pages 319-331

  Nock, Richard ^a   Lefaucheur, Patrice ^a  

^a UNIVERSITÉ DES ANTILLES ET DE LA GUYANE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING;

AGNOSTIC LEARNING; BOOSTING ALGORITHM; ROBUST BOOSTING; SYMMETRIC FUNCTIONS;

MACHINE LEARNING;

EID: 84945298125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36755-1_27     Document Type: Conference Paper

References (24)

1. E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning Journal, 36: 105-139, 1999.
2. C. L. Blake, E. Keogh, and C. J. Merz. UCI repository of machine learning databases, 1998. http://www.ics.uci.edu/~mlearn/MLRepository.html.
3. S. Boucheron. Théorie de l’apprentissage, de l’approche formelle aux enjeux cognitifs. Hermes, 1992.
4. L. Breiman. Bagging predictors. Machine Learning Journal, 24: 123-140, 1996.
5. L. Breiman. Bias, Variance and Arcing classifiers. Technical Report 460, UC Berkeley, 1996.
6. J. Friedman, T. Hastie, and R. Tibshirani. Additive Logistic Regression: A StatisticalViewofBoosting. Annals of Statistics, 28: 337-374, 2000.
7. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121: 256-285, 1995.
8. Y. Freund and R. E. Schapire. A Decision-Theoretic generalization of on line learning and an application to Boosting. Journal of Computer and System Sciences, 55: 119-139, 1997.
9. K-U. Hoffgen and H. U. Simon. Robust trainability of single neurons. In Proceedings of the 5 th International Conference on Computational Learning Theory, 1992.
10. M. J. Kearns. Thoughts on Hypothesis Boosting, 1988. ML class project.
11. M. J. Kearns and M. Li. Learning in the presence of malicious errors. In Proceedings of the 20 th ACM Symposium on the Theory of Computing. pages 267-280, 1988.
12. M. J. Kearns and Y. Mansour. On the boosting ability of top-down decision tree learning algorithms. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pages 459-468, 1996.
13. M. J. Kearns, R. E. Schapire, and L. M. Sellie. Toward efficient agnostic learning. Machine Learning Journal, 17: 115-141, 1994.
14. M. J. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Proceedings of the 21 th ACM Symposium on the Theory of Computing, pages 433-444, 1989.
15. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. M. I. T. Press, 1994.
16. R. Nock and O. Gascuel. On learning decision committees. In Proceedings of the 12 th International Conference on Maschine Learning, pages 413-420, 1995.
17. R. Nock and P. Jappy. On the power of decision lists. In Proceedings of the 15 th International Conference on Maschine Learning, pages 413-420, 1998.
18. J. R. Quinlan. C4.5: programs for machine learning. Morgan Kaufmann, 1994.
19. J. R. Quinlan. Bagging, Boosting and C4.5. In Proceedings of AAAI’96, pages 725-730, 1996.
20. R. E. Schapire. The strength of weak learnability. Machine Learning Journal, pages 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. Annals of statistics, 26: 1651-1686, 1998.
22. R. E. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. In Proceedings of the 11 th International Conference on Computational Learning Theory, pages 80-91, 1998.
23. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27: 1134-1142, 1984.
24. V. Vapnik. Statistical Learning Theory. John Wiley, 1998.