Olivier Bousquet, François Yvon  Home/Search
Context
Related
| cmap.polytechnique.fr/~...kolmogorov.ps 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: cmap.polytechnique.fr/~bousque... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we only consider the context of concept learning : Let X be a set called the instance space. A concept is a subset of X . Usually concepts are identi ed with their indicating function (by abuse of notations c(x) = 1 x 2 c) A concept class is a set C 2 (Update)
Active bibliography (related documents): More All
0.5: Narrowing confidence interval width of SVM learning risk.. - Apolloni, Malchiodi (Correct)
0.4: Comparing the Bayes and typicalness frameworks - Melluish, Saunders.. (2001) (Correct)
0.3: Confidence Evaluation for Risk Prediction - Gilardi, al. (2001) (Correct)
Similar documents based on text: More All
0.3: Survey of the research conducted at ENST in the domain of.. - Yvon (1997) (Correct)
0.2: Two Philosophical Applications of Algorithmic Information Theory - Chaitin (Correct)
0.2: Adaptable and Mobile-Aware Distributed Objects - Baggio (1999) (Correct)
BibTeX entry: (Update)
@inproceedings{ bousquet00algorithmic,
author = "Olivier Bousquet and Andre Elisseeff",
title = "Algorithmic Stability and Generalization Performance",
booktitle = "{NIPS}",
pages = "196-202",
year = "2000",
url = "citeseer.ist.psu.edu/bousquet00algorithmic.html" }
Citations (may not include all citations):660 An Introduction to Kolmogorov Complexity and Its Application.. - Li, Vit - 1997
493 Communications of the ACM (context) - Valiant, of et al. - 1984
190 Inductive Inference : Theory and Methods (context) - Angluin, Smith - 1983
56 A Formal Theory of Inductive Inference (context) - Solomono - 1964
56 A Formal Theory of Inductive Inference (context) - Solomono - 1964
55 Language Identication in the Limit (context) - Gold - 1967
42 Learning simple concepts under simple distributions - Li, Vit - 1991
40 Inductive Reasoning and Kolmogorov Complexity (context) - Li, Vit - 1992
25 Generalization as search (context) - Mitchell - 1982
23 Theory of Recursive Functions and E ective Computability (context) - Jr - 1967
21 Learning by transduction - Gammerman, Vovk et al. - 1998
19 the length of programs for computing nite binary sequences (context) - Chaitin - 1966
15 The complexity of nite objects and the development of the co.. (context) - Zvonkin, Levin - 1970
14 PAC Learning with Simple Examples - cois, Cyrille et al. - 1996
11 Three approaches to the quantitative denition of information (context) - Kolmogorov - 1965
11 Machine-learning applications of algorithmic randomness - Vovk, Gammerman et al. - 1999
3 Transduction with condence and credibility (context) - Saunders, Gammerman et al. - 1999
2 Sample size lower bounds in pac learning by algorithmic comp.. - Apolloni, Gentile - 1998
1 Learning DFA frome simple examples (context) - Parekh, Honavar - 1997
1 Centre for Discrete Mathematics and Theoretical Computer Sci.. (context) - Legg, induction et al. - 1997
1 Special Issue on Kolmogorov Complexity (context) - Vovk, Gammerman et al. - 1999
1 Center for Mathematics and Computer Science (context) - Gr, Automatic et al. - 1994
1 General limitations on machine learning - Ho - 1990
Documents on the same site (http://www.cmap.polytechnique.fr/~bousquet/): More
About Notions of Complexity in Learning - Bousquet (2000) (Correct)
Algorithmic Stability and Generalization Performance - Bousquet, Elisseeff (2000) (Correct)
Stability and Generalization - Bousquet, Elisseeff (2000) (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