Robust boosting algorithm against mislabeling in multiclass problems

Neural Computation

Volumn 20, Issue 6, 2008, Pages 1596-1630

  Takenouchi, Takashi ^a   Eguchi, Shinto ^b,c   Murata, Noboru ^d   Kanamori, Takafumi ^e  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

^c GRADUATE UNIVERSITY FOR ADVANCED STUDIES   (Japan)

^d WASEDA UNIVERSITY   (Japan)

^e NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; CLASSIFICATION; METHODOLOGY; NONLINEAR SYSTEM; STATISTICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLASSIFICATION; MODELS, STATISTICAL; NEURAL NETWORKS (COMPUTER); NONLINEAR DYNAMICS;

EID: 45749120676     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/neco.2007.11-06-400     Document Type: Article

References (17)

1. Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006). Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101, 138-156.
2. Blake, C. L., & Merz, C. J. (1998). UCI repository of machine learning databases. Irvine: University of California, Department of Information and Computer Science.
3. Copas, J. B. (1988). Binary regression models for contaminated data. Journal of Royal Statistical Society B, 50, 225-265.
4. Crammer, K., & Singer, K. (2001). On the algorithmic implementation of multiclass kernel-based vector machines. Journal of Machine Learning Research, 2, 265-292.
5. Domingo, C., & Watanabe, O. (2000). MadaBoost: A modification of AdaBoost. In Proc. of the 13th Conference on Computational Learning Theory, COLT'00. San Francisco: Morgan Kaufmann.
6. Eguchi, S., & Copas, J. B. (2002). A class of logistic type discriminant functions. Biometrika, 89, 1-22.
7. Eibl, G., & Pfeiffer, K. P. (2002). How to make AdaBoost.M1 work for weak base classifiers by changing only one line of the code. In Proceedings of the Thirteenth European Conference on Machine Learning (pp. 72-83). Berlin: Springer-Verlag.
8. Eibl, G., & Pfeiffer, K. (2005). Multiclass boosting for weak classifiers. Journal of Machine Learning Research, 6, 189-210.
9. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119-139.
10. Friedman, J. H., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: A statistical view of boosting. Annals of Statistics, 28, 337-407.
11. Lebanon, G., & Lafferty, J. (2001). Boosting and maximum likelihood for exponential models (Tech. Rep. CMU-CS-01-144). Pittsburgh, PA: School of Computer Science, Carnegie Mellon University.
12. Murata, N., Takenouchi, T., Kanamori, T., & Eguchi, S. (2004). Information geometry of u-boost and Bregman divergence. Neural Computation, 16, 1437-1481.
13. R Development Core Team. (2006). R: A language and environment for statistical computing. Vienna, Austria: R Foundation for Statistical Computing. Available online at http://www.R-project.org.
14. Rätsch, G., Onoda, T., & Müller, K.-R. (2001). Soft margins for AdaBoost. Machine Learning, 42(3), 287-320.
15. Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3), 297-336.
16. Takenouchi, T., & Eguchi, S. (2004). Robustifying AdaBoost by adding the naive error rate. Neural Computation, 16(4), 767-787.
17. Tewari, A., & Bartlett, P. L. (2007). On the consistency of multiclass classification methods. Journal of Machine Learning Research, 8, 1007-1025.