New Generation Computing, 25(2007)117-141
Ohmsha, Ltd. and Springer

Tutorial Series on Brain-Inspired Computing
Part 6: Geometrical Structure of Boosting Algorithm

Takafumi KANAMORI
Tokyo Institute of Technology
2-12-1 Ookayama, Meguro-ku, Tokyo 152-8550, Japan
kanamori@is.titech.ac.jp
Takashi TAKENOUCHI
Nara Institute of Science and Technology
8916-5 Takayama-cho, Ikoma-shi, Nara 630-0192, Japan
ttakashi@is.naist.jp
Noboru MURATA
Waseda University
3-4-1 Okubo, Shinjuku-ku, Tokyo 169-8555, Japan
noboru.murata@eb.waseda.ac.jp

Received 18 July 2006
Revised manuscript received 28 August 2006

Abstract

In this article, several boosting methods are discussed, which are notable implementations of the ensemble learning. Starting from the firstly introduced “boosting by filter” which is an embodiment of the proverb ”Two heads are better than one”, more advanced versions of boosting methods “AdaBoost” and “U-Boost” are introduced. A geometrical structure and some statistical properties such as consistency and robustness of boosting algorithms are discussed, and then simulation studies are presented for con- firming discussed behaviors of algorithms.

Keywords:Boosting, Classification Problem, Large-scale Learning Machine, Statistical Learning Theory.

[Back]