Avrim Blum, Lisa Hellerstein, Nick Littlestone  Home/Search
Context Related
Links: ACM DBLP | cmu.edu/People/avrim/Papers/inf2.ps cmu.edu/~avrim/Papers/inf2.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 addresses the problem of learning boolean functions in query and mistake-bound (Update)
Context of citations to this paper: More
...direction for work on CARD is automatic derivation of dependencies. The idea here is to use either machine learning [AL88, Kea93, BHL91, KL88, Lit89] or association rule mining [AIS93, AS94] techniques to automatically determine dependencies. This approach requires having...
...problem of learning attribute efficiently using hypotheses that are formulas of small depth. Our results extend the work of Blum et al. [4] and Bshouty et al. 7] 1 Introduction Consider the problem of learning an unknown Boolean function on n variables where n is large....
Cited by: More
Toward Attribute Efficient Learning of Decision Lists and.. - Klivans, Servedio (2006) (Correct)
Testing Juntas - Eldar Fischer Guy (2002) (Correct)
Improved Algorithms for Theory Revision with Queries - Exte Nd Ed (2000) (Correct)
Active bibliography (related documents): More All
0.5: Learning in the Presence of Finitely or Infinitely.. - Blum, Hellerstein.. (1995) (Correct)
0.3: Learning From Examples With Unspecified Attribute Values - Goldman, Kwek (1997) (Correct)
0.1: Relevant Examples and Relevant Features: Thoughts from.. - Blum (1994) (Correct)
Similar documents based on text: More All
0.6: Attribute-Efficient Learning in Query and Mistake-Bound Models - Bshouty, Hellerstein (1996) (Correct)
0.2: Relative Loss Bounds for Entropy Based Updates (Preliminary.. - Herbater (Correct)
0.1: Empirical Support for Winnow and Weighted-Majority Algorithms.. - Blum (1997) (Correct)
Related documents from co-citation: More All
18: Learning quickly when irrelevant attributes abound: A new linearthreshold algori.. (context) - Littlestone - 1988
17: Learning boolean functions in an infinite attribute space - Blum - 1992
13: Queries and concept learning (context) - Angluin - 1988
BibTeX entry: (Update)
A. Blum, L. Hellerstein, and N. Littlestone. Learning in the presence of finitely or infinitely many irrelevant attributes. J. Comp. Syst. Sci., 50(1):32--40, 1995. http://citeseer.ist.psu.edu/blum95learning.html More
@inproceedings{ blum91learning,
author = "Blum and Hellerstein and Littlestone",
title = "Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes (Extended Abstract)",
booktitle = "{COLT}: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann Publishers",
year = "1991",
url = "citeseer.ist.psu.edu/blum95learning.html" }
Citations (may not include all citations):465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989 ACM DBLP
441 Queries and concept learning (context) - Angluin - 1987 ACM DBLP
317 Learning quickly when irrelevant attributes abound: a new li.. (context) - Littlestone - 1988 DBLP
149 Information Processing Letters (context) - Blumer, Ehrenfeucht et al. - 1987
97 Learning read-once formulas with queries - Angluin, Hellerstein et al. - 1989 ACM DBLP
48 Learning boolean functions in an infinite attribute space - Blum - 1992 ACM DBLP
19 the complexity of learning from counterexamples and membersh.. (context) - Maass, Turan - 1990
7 Theoretical Computer Science (context) - Board, Pitt et al. - 1992 ACM
3 Identifying -decision trees and -formulas with constrained i.. (context) - Hancock - 1989
The graph only includes citing articles where the year of publication is known.
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