|
|
||||||||
Letter |
ttakashi{at}ism.ac.jp, Department of Statistical Science, Graduate University of Advanced Studies, Tokyo, Japan
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:
![]() |
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] |
||||
![]() |
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] |
||||
![]() |
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 |