A bias-variance analysis of a real world learning problem: The CoIL challenge 2000

Machine Learning

Volumn 57, Issue 1-2 SPEC. ISS., 2004, Pages 177-195

  Van Der Putten, Peter ^a   Van Someren, Maarten ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Bias variance decomposition; Overfitting; Real world applications

Indexed keywords

COMPETITIVE INTELLIGENCE; DATA MINING; DATA REDUCTION; ERROR DETECTION; INTELLIGENT AGENTS; LEARNING ALGORITHMS; MARKETING; PROBLEM SOLVING; REAL TIME SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS); STRATEGIC PLANNING;

BIAS-VARIANCE DECOMPOSITION; INSURANCE POLICY; OVERFITTING; REAL WORLD APPLICATIONS;

LEARNING SYSTEMS;

EID: 3242765279     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MACH.0000035476.95130.99     Document Type: Article

References (21)

1. Berka, P. (1999). Workshop notes on discovery challenge PKDD-99. Technical report, Laboratory of Intelligent Systems, University of Economics, Prague.
2. Blake, C., & Merz, C. (1998). UCI Repository of machine learning databases.
3. Breiman, L. (1996). Bias, variance, and arcing classifiers. Technical Report, Statistics Department, University of California.
4. Chapman, P., Clinton, J., Khabaza, T., Reinartz, T., & Wirth, R. (1999). The CRISP-DM process model. Technical Report, Crisp Consortium, http://www.crisp-dm.org/.
5. Domingos, P. (1997). The role of Occam's Razor in knowledge discovery. Data Mining and Knowledge Discovery, 3, 409-425.
6. Domingos, P. (2000). A unified bias-variance decomposition and its applications. In Proceedings of the Seventeenth International Conference on Machine Learning (pp. 231-238). CA: Morgan Kaufmann.
7. Domingos, P., & Pazzani, M. (1997). On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29, 103-130.
8. Elkan, C., (2001). Magical thinking in data mining: Lessons from CoIL challenge 2000. In Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining (KDD'01) (pp. 426-431).
9. Friedman, J. (1997). On bias, variance, 0/1 - loss, and the curse-of-dimensionality. Data Mining and Knowledge Discovery, 1, 55-77.
10. Geman, S., Bienenstock, E., & Doursat, R. (1992). Neural networks and the bias/variance dilemma. Neural Computation, 4, 1-58.
11. Guyon, I., & Elissee, A. (2003). An introduction to variable and feature selection. Journal of Machine Learning Research, 3, 1157-1182.
12. Hall, M. A. (1998). Correlation-based feature subset selection for machine learning. Ph.D. thesis, University of Waikato.
13. Holte, R. (1993). Very simple classification rules perform well on most commonly used datasets. Machine Learning, 11, 63-91.
14. James, G. M. (2003). Variance and bias for general loss functions. Machine Learning, 51, 115-135.
15. Kohavi, R. & John, G., (1997). Wrappers for feature subset selection. Artificial Intelligence, 97, 273-324.
16. Kohavi, R., & Wolpert, D. H. (1996). Bias plus variance decomposition for zero-one loss functions. In L. Saitta (Ed.), Machine learning: Proceedings of the thirteenth international conference (pp. 275-283). Morgan Kaufmann.
17. Quinlan, J. R., & Cameron-Jones, R. M. (1995). Oversearching and layered search in empirical learning. In IJCAI (pp. 1019-1024).
18. Tsamardinos, I., & Aliferis, C. (2003). Towards principled feature selection: Relevancy, filters and wrappers. In Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics.
19. van der Putten, P., & van Someren, M. (2000). CoiL challenge 2000: The insurance company case. Technical Report 2000-09, Leiden Institute of Advanced Computer Science, Universiteit van Leiden. http://www.liacs.nl/~putten/ library/cc2000.
20. Witten, I., & Frank, E. (2000). Data mining: Practical machine learning tools and techniques with Java implementations. San Francisco: Morgan Kaufmann Publishers.
21. Wolpert, D. H., & Macready, W. G. (1995). No free lunch theorems for search. Technical Report SFI-TR-95-02-010, The Santa Fe Institute.