• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

An experimental and theoretical comparison of model selection methods. Machine Learning 27 (1997)

Cached

  • Download as a PDF

Download Links

  • [www.cis.upenn.edu]
  • [www.informatik.uni-bonn.de]
  • [ftp.math.tau.ac.il]
  • [theory.lcs.mit.edu]
  • [www.math.tau.ac.il]
  • [www.cs.tau.ac.il]
  • [www.cs.huji.ac.il]
  • [www.cs.huji.ac.il]
  • [www.cis.upenn.edu]
  • [www.robotics.stanford.edu]
  • [ai.stanford.edu]
  • [www.cs.berkeley.edu]
  • [www.robotics.stanford.edu]
  • [ai.stanford.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Michael Kearns , Yishay Mansour Y , Andrew Y. Ng , Dana Ron Z
Citations:101 - 5 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Kearns97anexperimental,
    author = {Michael Kearns and Yishay Mansour Y and Andrew Y. Ng and Dana Ron Z},
    title = {An experimental and theoretical comparison of model selection methods. Machine Learning 27},
    year = {1997}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

In the model selection problem, we must balance the complexity of a statistical model with its goodness of fit to the training data. This problem arises repeatedly in statistical estimation, machine learning, and scientific inquiry in general.

Citations

6514 Elements of Information Theory - Cover, Thomas - 1991
1128 Probability inequalities for sums of bounded random variables - Hoeffding - 1963
891 Modeling by shortest data description - Rissanen - 1978
816 On the uniform convergence of relative frequencies of events to their probabilities. Theory of Prob. and its - Vapnik, Chervonenkis - 1971
687 Estimation of dependences based on empirical data - Vapnik - 1982
559 Cross-validatory choice and assessment of statistical predictions - STONE - 1974
274 Inferring decision trees using the minimum description length principle. Information and Computation 80.227–248 - QUINLAN, RIVEST - 1989
218 Stochastic complexity and modeling - Rissanen - 1986
182 Computational limitations on learning from examples - Pitt, Valiant - 1988
176 Minimum complexity density estimation - Barron, Cover - 1991
169 Toward efficient agnostic learning - KEARNS, SCHAPIRE, et al. - 1994
140 A Conservation Law for Generalization Performance - Schaffer - 1994
52 Rigorous learning curve bounds from statistical mechanics - Haussler, Kearns, et al. - 1994
41 Statistical mechanics of learning from examples - Seung, Sompolinsky, et al. - 1992
39 Stochastic Complexity in Statistical Inquiry, volume 15 - Rissanen - 1989
38 Asymptotics for and against cross-validation - Stone - 1977
32 Training a 3-node neural net is NP-complete - Blum, Rivest - 1989
3 A bound on the error of cross validation, with consequences for the training-test split - Kearns - 1996
1 Statistical mechanics of learning from examples - Sompolinsky - 1992
1 Cross-validatory choice and assessment of statistical predictions - tone - 1974
1 Asymptotics for and against cross-validation - tone - 1977
1 Stochastic Complexity in Statistical Inquiry,volume 15 - Rissanen - 1989
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University