Learning Boolean Functions in an Infinite Attribute Space School of Computer...  Home/Search
Context
Related
| cmu.edu/People/avrim/Pape...infinite.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: cmu.edu/People/avrim/Paper...pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a theoretical model for learning Boolean functions in domains having a (Update)
Active bibliography (related documents): More All
0.5: Information Filtering: Selection Mechanisms In Learning Systems - Markovitch (1989) (Correct)
0.0: Learning Read-Once Formulas with Queries - Angluin, Hellerstein, Karpinski (1989) (Correct)
0.0: Toward Attribute Efficient Learning of Decision Lists and.. - Klivans, Servedio (2006) (Correct)
Similar documents based on text: More All
0.2: Learning in the Presence of Finitely or Infinitely.. - Blum, Hellerstein.. (1995) (Correct)
0.1: Noise-tolerant learning, the parity problem, and the.. - Avrim Blum Carnegie (2003) (Correct)
0.1: A Note on Learning from Multiple-Instance Examples - Blum, Kalai (1998) (Correct)
BibTeX entry: (Update)
@misc{ computer-avrim,
author = "School Of Computer",
title = "Avrim Blum",
url = "citeseer.ist.psu.edu/442302.html" }
Citations (may not include all citations):537 A theory of the learnable (context) - Valiant - 1984
441 Queries and concept learning (context) - Angluin - 1988
244 Learning regular sets from queries and counter-examples (context) - Angluin - 1986
215 Learning decision lists - Rivest - 1987
84 Learning when irrelevant attributes abound: A new linear-thr.. (context) - Littlestone - 1987
74 Mistake bounds and logarithmic linear-threshold learning alg.. (context) - Littlestone - 1989
52 The Computational Complexity of Machine Learning (context) - Kearns - 1989
30 Learning in the presence of finitely or infinitely many irre.. - Blum, Hellerstein et al. - 1991
2 Recent results on boolean concept learning (context) - an, Space et al. - 1987
Documents on the same site (http://www.cs.cmu.edu/People/avrim/Papers/pubs.html): More
A Polynomial-time Algorithm for Learning Noisy Linear.. - Blum, Frieze, Kannan, .. (1996) (Correct)
A Note on Learning from Multiple-Instance Examples - Blum, Kalai (1998) (Correct)
Linear Approximation of Shortest Superstrings - Blum, Jiang, Li, Tromp.. (1991) (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