Michael Kearns, Yishay Mansour, Andrew Y. Ng, Dana Ron  Home/Search
Context Related
| eng.tau.ac.il/~danar/Pu...methodsml.ps math.tau.ac.il/~mansour/p...97mlj.ps.gz mit.edu/pub/people/d...methodsml.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: eng.tau.ac.il/~danar/papers (more) From: math.tau.ac.il/~mansour/cv (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the problem of model selection in the setting of supervised learning of boolean functions from independent random examples. More precisely, we compare methods for finding a balance between the complexity of the hypothesis chosen and its observed error on a random training sample of limited size, when the goal is that of minimizing the resulting generalization error. We undertake a detailed comparison of three well-known model selection methods --- a variation of Vapnik's... (Update)
Similar documents based on text: More All
0.4: An Experimental and Theoretical Comparison of Model.. - Kearns, Mansour, Ng, Ron (Correct)
0.3: On the Boosting Ability of Top-Down Decision Tree Learning.. - Kearns, Mansour (1996) (Correct)
0.3: An Information-Theoretic Analysis of Hard and Soft.. - Kearns, Mansour, Ng (1997) (Correct)
BibTeX entry: (Update)
M. Kearns, Y. Mansour, A. Y. Ng and D. Ron, "An Experimental and Theoretical Comparison of Model Selection Methods", in Proceedings of the seventh workshop on Computational Learning Theory ", ACM Press, http://citeseer.ist.psu.edu/702360.html More
@inproceedings{ kearns95experimental,
author = "Michael J. Kearns and Yishay Mansour and Andrew Y. Ng and Dana Ron",
title = "An Experimental and Theoretical Comparison of Model Selection Methods",
booktitle = "Computational Learing Theory",
pages = "21-30",
year = "1995",
url = "citeseer.ist.psu.edu/702360.html" }
Citations (may not include all citations):2319 Elements of Information Theory (context) - Cover, Thomas - 1991
493 Modeling by shortest data description (context) - Rissanen - 1978
454 the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Chervonenkis - 1971
417 Stochastic Complexity in Statistical Inquiry (context) - Rissanen - 1989
375 Probability inequalities for sums of bounded random variable.. (context) - Hoeffding - 1963
348 Estimation of Dependences Based on Empirical Data (context) - Vapnik - 1982
258 Cross-validatory choice and assessment of statistical predic.. (context) - Stone - 1974
185 Inferring decision trees using the minimum description lengt.. (context) - Quinlan, Rivest - 1989
144 Computational limitations on learning from examples (context) - Pitt, Valiant - 1988
139 Stochastic complexity and modeling (context) - Rissanen - 1986
102 Toward efficient agnostic learning - Kearns, Schapire et al. - 1992
101 Minimum complexity density estimation (context) - Barron, Cover - 1991
84 A conservation law for generalization performance (context) - Schaffer - 1994
58 Statistical mechanics of learning from examples (context) - Seung, Sompolinsky et al. - 1992
45 the connection between in-sample testing and generalization .. (context) - Wolpert
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.eng.tau.ac.il/~danar/papers.html): More
Exactly Learning Automata of Small Cover Time - Ron, Rubinfeld (1997) (Correct)
Efficient Learning of Typical Finite Automata from.. - Freund, Kearns, Ron, .. (1993) (Correct)
An Experimental and Theoretical Comparison of Model.. - Kearns, Mansour, Ng, Ron (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC