The 2002 wald memorial lectures population theory for boosting ensembles

Annals of Statistics

Volumn 32, Issue 1, 2004, Pages 1-11

  Breiman, Leo ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

AdaBoost; Bayes risk; Trees

Indexed keywords

EID: 14644395930     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/aos/1079120126     Document Type: Article

References (20)

1. BAUER, E. and KOHAVI, R. (1999). An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Machine Learning 36 105-139.
2. BREIMAN, L. (1996). Bagging predictors. Machine Learning 24 123-140.
3. BREIMAN, L. (1997). Arcing the edge. Technical Report 486, Dept. Statistics, Univ. California, Berkeley. Available at www.stat.berkeley.edu.
4. BREIMAN, L. (1998). Arcing classifiers (with discussion). Ann. Statist. 26 801-849.
5. BREIMAN, L. (1999). Prediction games and arcing algorithms. Neural Computation 11 1493-1517.
6. BREIMAN, L. (2000). Some infinite theory for predictor ensembles. Technical Report 577, Dept. Statistics, Univ. California, Berkeley.
7. 2 loss: Regression and classification. J. Amer. Statist. Assoc. 98 324-339.
8. DIETTERICH, T. (2000). An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting and randomization. Machine Learning 40 139-157.
9. DRUCKER, H. and CORTES, C. (1996). Boosting decision trees. In Advances in Neural Information Processing Systems 8 479-485. MIT Press, Cambridge, MA.
10. DUNFORD, N. and SCHWARTZ, J. (1958). Linear Operators. I. Interscience Publishers, New York.
11. FORSYTHE, G. E. and WASOW, W. R. (1960). Finite-Difference Methods for Partial Differential Equations. Wiley, New York.
12. FREUND, Y. and SCHAPIRE, R. (1996). Experiments with a new boosting algorithm. In Proc. 13th International Conference on Machine Learning 148-156. Morgan Kaufmann, San Francisco.
13. FRIEDMAN, J., HASTIE, T. and TIBSHIRANI, R. (2000). Additive logistic regression: A statistical view of boosting (with discussion). Ann. Statist. 28 337-407.
14. JIANG, W. (2004). Process consistency for AdaBoost. Ann. Statist. 32 13-29.
15. LUGOSI, G. and VAYATIS, N. (2004). On the Bayes-risk consistency of regularized boosting methods. Ann. Statist. 32 30-55.
16. MANNOR, S., MEIR, R. and ZHANG, T. (2002). The consistency of greedy algorithms for classification. In Proc. 15th Annual Conference on Computational Learning Theory. Lecture Notes in Comp. Sci. 2375 319-333. Springer, New York.
17. SCHAPIRE, R., FREUND, Y., BARTLETT, P. and LEE, W. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. Ann. Statist. 26 1651-1686.
18. SCHAPIRE, R. and SINGER, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning 37 297-336.
19. WHEWAY, V. (1999). Variance reduction trends on "boosted" classifiers. Unpublished manuscript.
20. ZHANG, T. and YU, B. (2003). Boosting with early stopping: Convergence and consistency. Technical Report 635, Dept. Statistics, Univ. California, Berkeley. Available from www.stat.berkeley.edu/~binyu/publications.html.