Michael J. Kearns The MIT Press Cambridge, Massachusetts London, England...  Home/Search
Context Related
| upenn.edu/~mkearns/papers...thesis.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: Contents 1 Introduction 1 2 Definitions and Motivation for Distribution-free Learning 6 2.1 Representing subsets of a domain : : : : : : : : : : : : : : : : 6 2.2 Distribution-free learning : : : : : : : : : : : : : : : : : : : : : 9 2.3 An example of efficient learning : : : : : : : : : : : : : : : : : 14 2.4 Other definitions and notation : : : : : : : : : : : : : : : : : : 17 2.5 Some representation classes : : : : : : : : : : : : : : : : : : : 19 3 Recent Research in Computational Learning ... (Update)
Similar documents based on text: More All
0.2: Toward Efficient Agnostic Learning - Kearns (1994) (Correct)
0.2: R-MAX - A General Polynomial Time Algorithm for.. - Brafman, Tennenholtz (2001) (Correct)
0.2: Exact Identification of Read-once Formulas Using Fixed Points.. - Sally Goldman (1993) (Correct)
BibTeX entry: (Update)
Haussler D., Kearns M. and Schapire R., Machine Learning, 14, pp. 83-115, 1994. http://citeseer.ist.psu.edu/haussler94machine.html More
@misc{ haussler94machine,
author = "D. Haussler and M. Kearns and R. Schapire",
title = "Machine Learning",
text = "Haussler D., Kearns M. and Schapire R., Machine Learning, 14, pp. 83-115,
1994.",
year = "1994",
url = "citeseer.ist.psu.edu/haussler94machine.html" }
Citations (may not include all citations):5 Polynomial learnability of semilinear sets (context) - Abe - 1989
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