TY - JOUR
T1 - Tutorial series on brain-inspired computing part 6
T2 - Geometrical structure of boosting algorithm
AU - Kanamori, Takafumi
AU - Takenouchi, Takashi
AU - Murata, Noboru
PY - 2007/1/24
Y1 - 2007/1/24
N2 - 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 confirming discussed behaviors of algorithms.
AB - 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 confirming discussed behaviors of algorithms.
KW - Boosting
KW - Classification problem
KW - Large-scale learning machine
KW - Statistical learning theory
UR - http://www.scopus.com/inward/record.url?scp=33846302076&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33846302076&partnerID=8YFLogxK
U2 - 10.1007/s00354-006-0006-0
DO - 10.1007/s00354-006-0006-0
M3 - Article
AN - SCOPUS:33846302076
SN - 0288-3635
VL - 25
SP - 117
EP - 141
JO - New Generation Computing
JF - New Generation Computing
IS - 1
ER -