Prediction Games and Arcing Algorithms

Neural Computation

Volumn 11, Issue 7, 1999, Pages 1493-1517

  Breiman, Leo ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000275022     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976699300016106     Document Type: Article

References (18)

1. Bauer, E., & Kohavi, R. (1998). An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Machine Learning, 1-33.
2. Blackwell, D., & Girshick, M. (1954). Theory of games and statistical decisions. New York: Wiley.
3. Breiman, L. (1996a). Bias, variance, and arcing classifiers (Tech. Rep. No. 460). Statistics Department, University of California. Available from: www.stat.berkeley.edu.
4. Breiman, L. (1996b). Bagging predictors. Machine Learning, 26, 123-140.
5. Breiman, L. (1997). Arcing the edge (Tech. Rep. No. 486). Statistics Department, University of California. Available from: www.stat.berkeley.edu.
6. Drucker, H., & Cortes, C. (1995). Boosting decision trees. Advances in Neural Information Processing Systems, 8, 479-485.
7. Freund, Y. (1998). Self bounding learning algorithms, (available from http://www.research.att.com/∼yoav; look under "publications".)
8. Freund, Y., and Schapire, R. (1996a). Experiments with a new boosting algorithm. Machine Learning: Proceedings of the Thirteenth International Conference (pp. 148-156).
9. Freund, Y., & Schapire, R. (1996b). Game theory, on-line prediction and boosting. In Proceedings of the 9th Annual Conference on Computational Learning Theory.
10. Freund, Y., & Schapire, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting, to appear, Journal of Computer and System Sciences, 55(1), 1219-1239.
11. Golea, M., Bartlett, P., Lee, W., & Mason, L. (1998). Generalization in decision trees and DNF: Does size matter? Advances in Neural Information Processing Systems, 10, 259-265.
12. Ji, C., and Ma, S. (1997). Combinations of weak classifiers. Special Issue of Neural Networks and Pattern Recognition, IEEE Trans. Neural Networks, Vol. 8, pp. 32-42.
13. Kong, E., & Dietterich, T. (1996). Error-correcting output coding corrects bias and variance. In Proceedings of the Twelfth International Conference on Machine Learning (pp. 313-321).
14. Leisch, F., & Hornik, K. (1997). ARC-LH: A new adaptive resampling algorithm for improving ANN classifiers. Advances in neural information processing systems, 9. Cambridge, MA: MIT Press.
15. Quinlan, J. R. (1996). Bagging, boosting, and C4.5. In Proceedings of AAAI '96 National Conference on Artificial Intelligence (pp. 725-730).
16. Robinson, J. (1951). An iterative method of solving a game. Ann. Math, 154, 296-301.
17. Schapire, R., Freund, Y., Bartlett, P., & Lee, W. (1997). Boosting the margin, (available from http://www.research.att.com/∼yoav; look under "publications".)
18. Szep, J., & Forgo, F. (1985). Introduction to the theory of games. D. Reidel Publishing Co.