How boosting the margin can also boost classifier complexity

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 753-760

  Reyzin, Lev ^a   Schapire, Robert E ^b  

^a YALE UNIVERSITY   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; LEARNING SYSTEMS;

BOOSTING ALGORITHM; BOOSTING METHODS; MARGINS DISTRIBUTION; MARGINS THEORY;

CLASSIFICATION (OF INFORMATION);

EID: 34250705806     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143939     Document Type: Conference Paper

References (15)

1. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987). Occam's razor. Information Processing Letters, 24, 377-380.
2. Breiman, L. (1998). Arcing classifiers. The Annals of Statistics, 26, 801-849.
3. Breiman, L. (1999). Prediction games and arcing classifiers. Neural Computation, 11, 1493-1517.
4. Drucker, H., & Cortes, C. (1996). Boosting decisiontrees. Advances in Neural Information Processing Systems 8 (pp. 479-485).
5. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55, 119-139.
6. Grove, A. J., & Schuurmans, D. (1998). Boosting in the limit: Maximizing the margin of learned ensembles. Proceedings of the Fifteenth National Conference on Artificial Intelligence.
7. Koltchinskii, V., & Panchenko, D. (2002). Empirical margin distributions and bounding the generalization error of combined classifiers. The Annals of Statistics, 30.
8. Mason, L., Bartlett, P. L., & Golea, M. (2002). Generalization error of combined classifiers. Journal of Computer and System Sciences, 65, 415-438.
9. Meir, R., & Rätsch, G. (2003). An introduction to boosting and leveraging. In S. Mendelson and A. Smola (Eds.), Advanced lectures on machine learning (lnai2600), 119-184. Springer.
10. Quinlan, J. R. (1996). Bagging, boosting, and C4.5. Proceedings of the Thirteenth National Conference on Artificial Intelligence (pp. 725-730).
11. Rätsch, G., & Warmuth, M. (2002). Maximizing the margin with boosting. 15th Annual Conference on Computational Learning Theory (pp. 334-350).
12. Rudin, C., Schapire, R. E., & Daubechies, I. (2004). Boosting based on a smooth margin. 17th Annual Conference on Learning Theory (pp. 502-517).
13. Schapire, R. E. (2002). The boosting approach to machine learning: An overview. Nonlinear Estimation and Classification. Springer.
14. Schapire, R. E., Freund, Y., Bartlett, P., & Lee, W. S. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26, 1651-1686.
15. Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37, 297-336.