Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Takenouchi, T.
Right arrow Articles by Eguchi, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Takenouchi, T.
Right arrow Articles by Eguchi, S.
(Neural Computation. 2004;16:767-787.)
© 2004 The MIT Press


Letter

Robustifying AdaBoost by Adding the Naive Error Rate

Takashi Takenouchi

ttakashi{at}ism.ac.jp, Department of Statistical Science, Graduate University of Advanced Studies, Tokyo, Japan

Shinto Eguchi

eguchi{at}ism.ac.jp, Institute of Statistical Mathematics, Japan, and Department of Statistical Science, Graduate University of Advanced Studies, Tokyo, Japan

AdaBoost can be derived by sequential minimization of the exponential loss function. It implements the learning process by exponentially reweighting examples according to classification results. However, weights are often too sharply tuned, so that AdaBoost suffers from the nonrobustness and overlearning. We propose a new boosting method that is a slight modification of AdaBoost. The loss function is defined by a mixture of the exponential loss and naive error loss functions. As a result, the proposed method incorporates the effect of forgetfulness into AdaBoost. The statistical significance of our method is discussed, and simulations are presented for confirmation.




This article has been cited by other articles:


Home page
Neural Comput.Home page
T. Takenouchi, S. Eguchi, N. Murata, and T. Kanamori
Robust Boosting Algorithm Against Mislabeling in Multiclass Problems
Neural Comput., June 1, 2008; 20(6): 1596 - 1630.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
T. Kanamori, T. Takenouchi, S. Eguchi, and N. Murata
Robust loss functions for boosting.
Neural Comput., August 1, 2007; 19(8): 2183 - 2244.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
N. Murata, T. Takenouchi, T. Kanamori, and S. Eguchi
Information Geometry of U-Boost and Bregman Divergence
Neural Comput., July 1, 2004; 16(7): 1437 - 1481.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2004 by The MIT Press.