Process-oriented estimation of generalization error

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1999, Pages 714-719

  Domingos, Pedro ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ADEQUATE MODELS; GENERALIZATION ERROR; OVERFITTING; PROCESS-ORIENTED; RULE INDUCTION; SEARCH PROCESS;

ARTIFICIAL INTELLIGENCE;

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

References (29)

1. J. M. Bernardo and A. F. M. Smith. Bayesian Theory. Wiley, New York, NY, 1994.
2. C. Blake, E. Keogh, and C. J. Merz. UCI repository of machine learning databases. Machine-readable data repository, Department of Information and Computer Science, University of California at Irvine, Irvine, CA, 1998. http://www.ics.uci.edu/~mleam/MLRepository.html.
3. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, Belmont, CA, 1984.
4. C. Brunk and M. J. Pazzani. An investigation of noise-tolerant relational concept learning algorithms. In Proceedings of the Eighth International Workshop on Machine Learning, pages 389-393, Evanston, I L, 1991. Morgan Kaufmann.
5. B. Cestnik. Estimating probabilities: A crucial task in machine learning. In Proceedings of the Ninth European Conference on Artificial Intelligence, pages 147-149, Stockholm, Sweden, 1990. Pitman.
6. C. Chatfield. Model uncertainty, data mining and statistical inference. Journal of the Royal Statistical Society A, 158, 1995.
7. D. M. Chickering and D. Heckerman. Efficent approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning, 29:181-212, 1997. (Pubitemid 127510038)
8. P. Clark and R. Boswell. Rule induction with CN2: Some recent improvements. In Proceedings of the Sixth European Working Session on Learning, pages 151-163, Porto, Portugal, 1991. Springer-Verlag.
9. P. Clark and T. Niblett. The CN2 induction algorithm. Machine Learning, 3:261-283, 1989.
10. P. Domingos. Occam's two razors: The sharp and the blunt. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 37-43, New York, NY, 1998. AAAI Press.
11. P. Domingos. A process-oriented heuristic for model selection. In Proceedings of the Fifteenth International Conference on Machine Learning, pages 127-135, Madison, W I, 1998. Morgan Kaufmann.
12. B. Efron and R. J. Tibshirani. An Introduction to the Bootstrap. Chapman and Hall, New York, NY, 1993.
13. Y. Freund. Self bounding learning algorithms. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, Madison, WI, 1998. Morgan Kaufmann.
14. B. R. Gaines. An ounce of knowledge is worth a ton of data: Quantitative studies of the trade-off between expertise and data based on statistically well-founded empirical induction. In Proceedings of the Sixth International Workshop on Machine Learning, pages 156-159, Ithaca, NY, 1989. Morgan Kaufmann.
15. R. C. Holte, L. E. Acker, and B. W. Porter. Concept learning and the problem of small disjuncts. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 813-818, Detroit, M I, 1989. Morgan Kaufmann.
16. D. Jensen and P. R. Cohen. Multiple comparisons in induction algorithms. Machine Learning, 1998. To appear.
17. D. Jensen and M. Schmill. Adjusting for multiple comparisons in decision tree pruning. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pages 195-198, Newport Beach, CA, 1997. AAAI Press.
18. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, Cambridge, MA, 1994.
19. M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proceedings of the Twenty-Fifth ACM Symposium on the Theory of Computing, pages 392-401, New York, NY, 1993. ACM Press.
20. A. J. Klockars and G. Sax. Multiple Comparisons. Sage, Beverly Hills, CA, 1986.
21. R. S. Michalski. A theory and methodology of inductive learning. Artificial Intelligence, 20:111-161, 1983.
22. A. Y. Ng. Preventing "overfitting" of cross-validation data. In Proceedings of the Fourteenth International Conference on Machine Learning, pages 245-253, Nashville, TN, 1997. Morgan Kaufmann.
23. G. Pagallo and D. Haussler. Boolean feature discovery in empirical learning. Machine Learning, 3:71-99, 1990. (Pubitemid 23621640)
24. J. R. Quinlan and R. M. Cameron-Jones. Oversearching and layered search in empirical learning. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1019-1024, Montreal, Canada, 1995. Morgan Kaufmann.
25. J. R. Quinlan. C4-5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993.
26. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
27. J. Shawe-Taylor, P. L. Bartlett, R. C. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. Technical Report NC-TR-96-053, Department of Computer Science, Royal Holloway, University of London, Egham, UK, 1996.
28. M. Stone. Cross-validatory choice and assessment of statistical predictions. Journal of the Royal Statistical Society B, 36:111-147,1974.
29. V. N. Vapnik. The Nature of Statistical Learning Theory. Springer-Verlag, New York, NY, 1995.