Abstract

1 INTRODUCTION The AdaBoost algorithm [7, 16] has recently proved to be an important component in practical learning algorithms. Two of the most successful combinations have been boosting decision trees and boosting stumps [6, 1, 13, 8]. Stumps are the simplest special case of decision trees which consist of a single decision node and two prediction leaves. Boosting decision trees learning algorithms, such as CART [2] and C4.5 [14], yields very good classifiers.

Citations

3144	Classification and Regression Trees - Breiman, Friedman, et al. - 1984
1714	Schapire R: A decision-theoretic generalization of online learning and an application to boosting - Freund - 1997
1326	Schapire R: Experiments with a new boosting algorithm - Freund
897	Tibshirani R: Additive logistic regression: a statistical view of boosting. Annl Stat 2000, 28:337-374. Results of nonlinear tree harvest procedure applied to lymphoma data Node Parent Score -2Log-likelihood Size Nonlinear? 1 - Friedman, Hastie
173	Classi cation and Regression Trees - Breiman, Friedman, et al. - 1984
112	Learning classification trees - BUNTINE - 1992
77	arcing classifiers - Bias - 1996
65	Extracting Comprehensible Models from Trained Neural Networks - Craven - 1996
51	Knowledge acquisition from examples via multiple models - Domingos - 1997
14	Learning classi cation trees - Buntine