Michael J. Kearns, Robert E. Schapire  Home/Search
Context Related
Links: ACM DBLP | upenn.edu/~mkearns/pap...pconcepts.ps.Z 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: upenn.edu/~mkearns/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we investigate a new formal model of machine learning in which the concept (boolean function) to be learned may exhibit uncertain or probabilistic behavior---thus, the same input may sometimes be classified as a positive example and sometimes as a negative example. (Update)
Context of citations to this paper: More
.... this data, the learner is required to come up with a procedure that, given any unclassified instance, returns a confidence value [SS98, KS90] in the range ### ## that the given instance is in the concept. To simplify our treatment we assume that the instance space is #...
.... capacity measures are defined in the theory, the most popular one being the VC dimension [10] or scale sensitive versions of it [11], 12] For more details and examples of exact forms of , we refer the reader to [10] 4] and [12] Intuitively, if the capacity of the...
Cited by: More
Journal of Machine Learning Research 7 (2006) 283--306.. - Paul Goldberg Pwg (Correct)
Proceedings of the 26th Annual ACM Symposium on Theory of.. - Extended Michael (Correct)
Efficient Noise-Tolerant Learning From Statistical Queries - Kearns (1998) (Correct)
Active bibliography (related documents): More All
1.4: Efficient Distribution-free Learning of Probabilistic Concepts - Kearns, Schapire (1993) (Correct)
0.2: Part 1: Overview of the Probably Approximately Correct (PAC).. - Haussler (1995) (Correct)
0.1: PAB-Decisions for Boolean and Real-Valued Features - Svetlana Anoulova (1992) (Correct)
Similar documents based on text: More All
0.2: Toward Efficient Agnostic Learning - Kearns (1994) (Correct)
0.2: Exact Identification of Read-once Formulas Using Fixed Points.. - Sally Goldman (1993) (Correct)
0.2: Bounds On The Number Of Examples Needed For Learning Functions - Simon (1997) (Correct)
Related documents from co-citation: More All
55: Learnability and the Vapnik Chervonenkis Dimension (context) - Blumer, Ehrenfeucht et al. - 1989
41: Decision theoretic generalizations of the PAC model for neural net and other lea.. (context) - Haussler - 1992
36: Convergence of Stochastic Processes (context) - Pollard - 1984
BibTeX entry: (Update)
M. J. Kearns and R. E. Schapire, "Efficient distribution-free learning of probabilistic concepts," in 31st Annual IEEE Symposium on Foundations of Computer Science, pp. 382--391, 1990. http://citeseer.ist.psu.edu/article/kearns93efficient.html More
@incollection{ kearns94efficient,
author = "Kearns and Schapire",
title = "Efficient Distribution-free Learning of Probabilistic Concepts",
booktitle = "Computational Learning Theory and Natural Learning Systems, Volume I: Constraints and Prospect, edited by Stephen Jose Hanson, George A. Drastal, and Ronald L. Rivest, Bradford/{MIT} Press",
volume = "1",
year = "1994",
url = "citeseer.ist.psu.edu/article/kearns93efficient.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
2133 Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
526 Information and Control (context) - Zadeh - 1965
493 Communications of the ACM (context) - Valiant, of et al. - 1984
465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989 ACM DBLP
454 the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Ya et al. - 1971
375 Probability inequalities for sums of bounded random variable.. (context) - Hoeffding - 1963
348 Estimation of Dependences Based on Empirical Data (context) - Vapnik - 1982
318 Convergence of Stochastic Processes (context) - Pollard - 1984
215 Learning decision lists - Rivest - 1987 ACM DBLP
184 Cryptographic limitations on learning Boolean formulae and f.. - Kearns, Valiant - 1989 ACM DBLP
149 Information Processing Letters (context) - Blumer, Ehrenfeucht et al. - 1987
144 Computational limitations on learning from examples (context) - Pitt, Valiant - 1988 ACM DBLP
142 Learning from noisy examples (context) - Angluin, Laird - 1988 ACM DBLP
132 Fast probabilistic algorithms for Hamiltonian circuits and m.. (context) - Angluin, Valiant - 1979 ACM DBLP
102 Toward efficient agnostic learning - Kearns, Schapire et al. - 1992 ACM DBLP
99 Learning in artificial neural networks: A statistical perspe.. (context) - White - 1989
94 Learning in the presence of malicious errors - Kearns, Li - 1988 ACM DBLP
81 Equivalence of models for polynomial learnability (context) - Haussler, Kearns et al. - 1991 ACM DBLP
59 Central limit theorems for empirical measures (context) - Dudley - 1978
52 The Computational Complexity of Machine Learning (context) - Kearns - 1990 ACM
40 Types of noise in data for concept learning (context) - Sloan - 1988 ACM DBLP
27 Results on learnability and the VapnikChervonenkis dimension (context) - Linial, Mansour et al. - 1988
21 Generalizing the PAC model: Sample size bounds from metric d.. (context) - Haussler - 1989
18 A learning criterion for stochastic rules (context) - Yamanishi - 1990 ACM DBLP
17 An Introduction to Generalized Linear Models (context) - Dobson - 1990
15 Fuzzy Techniques in Pattern Recognition (context) - Kandel - 1982
12 Polynomial learnability of probabilistic concepts with respe.. (context) - Abe, Takeuchi et al. - 1991
11 Relating data compression and learnability - Littlestone, Warmuth - 1987
7 Learning the Fourier spectrum of probabilistic lists and tre.. (context) - Aiello, Mihail - 1991 ACM DBLP
4 Research Report IIAS-RR-91-22E (context) - Sakakibara, of et al. - 1991
2 Learning via Fourier transform (context) - Mansour - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~mkearns/): More
Graphical Economics - Sham Kakade Michael (Correct)
Efficient Algorithms for Learning to Play Repeated Games Against.. - al. (1995) (Correct)
On the Boosting Ability of Top-Down Decision Tree Learning.. - Kearns (1996) (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