Improvement of boosting algorithm by modifying the weighting rule

Annals of Mathematics and Artificial Intelligence

Volumn 41, Issue 1, 2004, Pages 95-109

  Nakamura, Masayuki ^a   Nomiya, Hiroki ^a   Uehara, Kuniaki ^a  

^a KOBE UNIVERSITY   (Japan)

Author keywords

AdaBoost; Errorbound; Hard example; NadaBoost; Weighting rule

Indexed keywords

EID: 3943060856     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:AMAI.0000018577.32783.d2     Document Type: Article

References (9)

1. T.G. Dietterich, Approximate statistical tests for comparing supervised classification learning algorithms, Neural Computation 10(7) (1998) 1895-1923.
2. T.G. Dietterich, An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization, Machine Learning 32(1) (1999) 1-22.
3. 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(1) (1997) 119-139.
4. L. Mason, J. Baxter, P. Bartlett and M. Frean, Boosting algorithms as gradient descent, Advances in Neural Information Processing Systems 12 (2000) 512-518.
5. J.R. Quinlan, Bagging, boosting and C4.5, in: Proc. of 13th AAAI (1996) pp. 725-730.
6. G. Rätsch, T. Onoda and K.R. Müller, Soft margins for AdaBoost, Machine Learning 42(3) (2000) 287-320.
7. R.E. Schapire, Theoretical views of boosting, in: Proc. of 4th EuroCOLT'99 (1999) pp. 1-10.
8. R.E. Schapire, Y. Freund, P. Bartlett and W.S. Lee, Boosting the margin: A new explanation for the effectiveness of voting methods, in: Proc. of 14th International Conference on Machine Learning (1997) pp. 322-330.
9. R.E. Schapire and Y. Singer, Improved boosting algorithms using confidence-rated predictions, in: Proc. of 11th Annual Conference on Computational Learning Theory (1998) pp. 80-91.