A Unified Bias-Variance Decomposition for Zero-One and Squared Loss

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 564-569

  Domingos, Pedro ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECOMPOSITION; LEARNING ALGORITHMS;

BASE LEARNERS; BIAS AND VARIANCE; BIAS VARIANCE DECOMPOSITION; CLASSIFIERS ENSEMBLE; GENERALIZATION ERROR; LOSS FUNCTIONS; MACHINE LEARNING ALGORITHMS; MISCLASSIFICATION COSTS; TRAINING EXAMPLE; ZERO-ONE;

LEARNING SYSTEMS;

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

References (15)

1. Bauer, E., and Kohavi, R. 1999. An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Machine Learning 36:105-142.
2. Blake, C., and Merz, C. J. 2000. UCI repository of machine learning databases. Machine-readable data repository, Department of Information and Computer Science, University of California at Irvine, Irvine, CA. http://www.ics.uci.edu/-~mlearn/MLRepository.html.
3. Breiman, L. 1996a. Bagging predictors. Machine Learning 24:123-140.
4. Breiman, L. 1996b. Bias, variance and arcing classifiers. Technical Report 460, Statistics Department, University of California at Berkeley, Berkeley, CA.
5. Breiman, L. 1997. Arcing the edge. Technical Report 486, Statistics Department, University of California at Berkeley, Berkeley, CA.
6. Domingos, P., and Pazzani, M. 1997. On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning 29:103-130.
7. Domingos, P. 2000. A unified bias-variance decomposition. Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA.
8. Friedman, J. H. 1997. On bias, variance, 0/1 - loss, and the curse-of-dimensionality. Data Mining and Knowledge Discovery 1:55-77.
9. Geman, S.; Bienenstock, E.; and Doursat, R. 1992. Neural networks and the bias/variance dilemma. Neural Computation 4:1-58.
10. Holte, R. C. 1993. Very simple classification rules perform well on most commonly used datasets. Machine Learning 11:63-91.
11. Kohavi, R., and Wolpert, D. H. 1996. Bias plus variance decomposition for zero-one loss functions. In Proceedings of the Thirteenth International Conference on Machine Learning, 275-283. Bari, Italy: Morgan Kaufmann.
12. 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, 313-321. Tahoe City, CA: Morgan Kaufmann.
13. Quinlan, J. R. 1993. C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann.
14. Schapire, R. E.; Freund, Y.; Bartlett, P.; and Lee, W. S. 1997. Boosting the margin: A new explanation for the effectiveness of voting methods. In Proceedings of the Fourteenth International Conference on Machine Learning, 322-330. Nashville, TN: Morgan Kaufmann.
15. Tibshirani, R. 1996. Bias, variance and prediction error for classification rules. Technical report, Department of Preventive Medicine and Biostatistics and Department of Statistics, University of Toronto, Toronto, Canada.