Arcing classifiers

Annals of Statistics

Volumn 26, Issue 3, 1998, Pages 801-849

  Breiman, Leo ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bagging; Boosting; Decision trees; Ensemble methods; Error correcting; Markov chain; Monte Carlo; Neural networks; Output coding

Indexed keywords

EID: 0346786584     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. ALI, K. (1995). Learning probabilistic relational concept descriptions. Ph.D. dissertation, Dept. Computer Science, Univ. California, Irvine.
2. BREIMAN, L. (1996a). Bagging predictors. Machine Learning 26 123-140.
3. BREIMAN, L. (1996b). The heuristics of instability in model selection. Ann. Statist. 24 2350-2383.
4. BREIMAN, L., FRIEDMAN, J., OLSHEN, R. and STONE, C. (1984). Classification and Regression Trees. Chapman and Hall, London.
5. DRUCKER, H. and CORTES, C. (1996). Boosting decision trees. Advances in Neural Information Processing Systems 8 479-485.
6. FREUND, Y. and SCHAPIRE, R. (1996). Experiments with a new boosting algorithm. In Machine Learning: Proceedings of the Thirteenth International Conference (L. Saitta, ed.) 148-156. Morgan Kaufmann, San Francisco.
7. FREUND, Y. and SCHAPIRE, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. System Sci. 55 119-139.
8. FRIEDMAN, J. H. (1996). On bias, variance, 0/1-loss, and the curse of dimensionality. Journal of Knowledge Discovery and Data Mining. To appear.
9. GEMAN, S., BIENENSTOCK, E. and DOURSAT, R. (1992). Neural networks and the bias/variance dilemma. Neural Computations 4 1-58.
10. HASTIE, T. and TIBSHIRANI, R. (1994). Handwritten digit recognition via deformable prototypes. Unpublished manuscript. Available at ftp stat.stanford.edu/pub/hastie/ zip.ps.z.
11. KEARNS, M. and VALIANT, L. G. (1988). Learning Boolean formulae or finite automata is as hard as factoring. Technical Report TR-14-88, Aiken Computation Laboratory, Harvard Univ.
12. KEARNS, M. and VALIANT, L. G. (1989). Cryptographic limitations on learning Boolean formulae and finite automata. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing. 433-444. ACM Press, New York.
13. KOHAVI, R. and WOLPERT, D. H. (1996). Bias plus variance decomposition for zero-one loss functions. In Machine Learning: Proceedings of the Thirteenth International Conference. (L. Saitta, ed.) 275-283. Morgan Kaufmann, San Francisco.
14. KONG, E. B. and DIETTERICH, T. G. (1995). Error-correcting output coding corrects bias and variance. In Proceedings of the Twelfth International Conference on Machine Learning (A. Prieditis and S. Russell, eds.) 313-321. Morgan Kaufmann, San Francisco.
15. LE CUN, Y., BOSER, B., DENKER, J., HENDERSON, D., HOWARD, R., HUBBARD, W. and JACKEL, L. (1990). Handwritten digit recognition with a back-propagation network. Advances in Neural Information Processing Systems 2 396-404.
16. MICHIE, D., SPIEGELHALTER, D. and TAYLOR, C. (1994). Machine Learning, Neural and Statistical Classification. Ellis Horwood, London.
17. QUINLAN, J. R. (1996). Bagging, Boosting, and C4.5. In Proceedings of AAAI '96 National Conference on Artificial Intelligence 725-730.
18. SCHAPIRE, R. (1990). The strength of weak learnability. Machine Learning 5 197-227.
19. SIMARD, P., LE CUN, Y. and DENKER, J. (1993). Efficient pattern recognition using a new transformation distance. Advances in Neural Information Processing Systems 5 50-58.
20. TIBSHIRANI, R. (1996). Bias, variance, and prediction error for classification rules. Technical Report, Dept. Statistics, Univ. Toronto.
21. VAPNIK, V. (1995). The Nature of Statistical Learning Theory. Springer, New York.