Why Does Bagging Work? A Bayesian Account and its Implications

Proceedings - 3rd International Conference on Knowledge Discovery and Data Mining, KDD 1997

Volumn , Issue , 1997, Pages 155-158

  Domingos, Pedro ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; CLASSIFICATION (OF INFORMATION); STATISTICAL TESTS;

BAYESIAN; BAYESIAN LEARNING; BAYESIAN MODEL AVERAGING; ERROR RATE; EXPERIMENTAL EVIDENCE; LEARNING THEORY; MODEL SPACES; MULTIPLE-MODELING;

DECISION TREES;

EID: 85172419807     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Bernardo, J. M., and Smith, A. F. L. 1994. Bayesian Theory. New York, NY: Wiley.
2. Breiman, L. 1996a. Bagging predictors. Machine Learning 24:123-140.
3. Breiman, L. 1996b. Bias, variance and arcing classifiers. Technical Report 460, Statistics Department, University of California at Berkeley, Berkeley, CA.
4. Buntine, W. L. 1990. A Theory of Learning Classification Rules. Ph.D. Dissertation, School of Computing Science, University of Technology, Sydney, Australia.
5. Chan, P.; Stolfo, S.; and Wolpert, D., eds. 1996. Proc. AAAI-96 Workshop on Integrating Multiple Learned Models. Portland, OR: AAAI Press.
6. Cheeseman, P. 1990. On finding the most probable model. In Shrager, J., and Langley, P., eds., Computational Models of Scientific Discovery and Theory Formation. San Mateo, CA: Morgan Kaufmann. Domingos, P. 1997. Knowledge acquisition from examples via multiple models. In Proc. Fourteenth International Conference on Machine Learning. Nashville, TN: Morgan Kaufmann. Freund, Y., and Schapire, R. E. 1996. Experiments with a new boosting algorithm. In Proc. Thirteenth International Conference on Machine Learning, 148-156. Bari, Italy: Morgan Kaufmann.
7. Friedman, J. H. 1996. On bias, variance, 0/1 - loss, and the curse-of-dimensionality. Technical report, Department of Statistics and Stanford Linear Accelerator Center, Stanford University, Stanford, CA. Hyafi. 1, L., and Rivest, R. L. 1976. Constructing optimal binary decision trees is NP-complete. Information Processing Letters 5:15-17. Kohavi, R., and Wolpert, D. H. 1996. Bias plus variance decomposition for zero-one loss functions. In Proc. Thirteenth International Conference on Machine Learning, 275-283. Bari, Italy: Morgan Kaufmann.
8. Kong, E. B., and Dietterich, T. G. 1995. Error-correcting output coding corrects bias and variance. In Proc. Twelfth International Conference on Machine Learning, 313-321. Tahoe City, CA: Morgan Kaufmann.
9. Madigan, D.; Raftery, A. E.; Volinsky, C. T.; and Hoeting, J. A. 1996. Bayesian model averaging. In Proc. AAAI-96 Workshop on Integrating Multiple Learned Models, 77-83. Portland, OR: AAAI Press.
10. Merz, C. J.; Murphy, P. M.; and Aha, D. W. 1997. UCI repository of machine learning databases. Department of Information and Computer Science, University of California at Irvine, Irvine, CA.
11. Quinlan, J. R. 1993. C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann.
12. Wolpert, D. 1992. Stacked generalization. Neural Networks 5:241-259.