Avrim Blum, Merrick Furst, Jeffrey Jackson, Michael Kearns, Yishay Mansour  Home/Search
Context Related
Links: ACM DBLP | duq.edu/~jackson/dnfsq.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: duq.edu/~jackson/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF formulas with membership queries with respect to the uniform distribution. This is the rst positive result known for learning general DNF in polynomial time in a nontrivial model. Our results should be contrasted with those of Kharitonov [12], who proved that AC 0 is not eciently learnable in this model based on... (Update)
Cited by: More
Active Learning with Multiple Views - Muslea (2002) (Correct)
Decision Trees: More Theoretical Justification for Practical.. - Fiat, Pechyony (Correct)
Decision Trees: More Theoretical Justification for Practical.. - Pechyony (2004) (Correct)
Similar documents (at the sentence level):
23.9%: Weakly Learning DNF and Characterizing Statistical Query Learning.. - Blum (1994) (Correct)
21.7%: Weakly Learning DNF and Characterizing Statistical - Query Learning Using (Correct)
Active bibliography (related documents): More All
0.7: Learning DNF Over The Uniform Distribution Using A Quantum.. - Bshouty, Jackson (1995) (Correct)
0.3: On Learning Read-k-Satisfy-j DNF - Aizenstein, Blum, Khardon.. (1998) (Correct)
0.3: An Efficient Membership-Query Algorithm for Learning DNF with.. - Jackson (1994) (Correct)
Similar documents based on text: More All
0.5: On Learning Monotone DNF under Product Distributions - Servedio (2001) (Correct)
0.5: Fast Learning of k-Term DNF Formulas with Queries - Blum, Rudich (1992) (Correct)
0.4: An O(n^(log log n)) Learning Algorithm for DNF under the Uniform.. - Mansour (1998) (Correct)
Related documents from co-citation: More All
27: Boosting a weak learning algorithm by majority - Freund - 1995
26: Communications of the ACM (context) - Valiant, of et al. - 1984
26: Learning decision trees using the fourier spectrum - Kushilevitz, Mansour - 1991
BibTeX entry: (Update)
A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich. Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In Proceedings of the 26th ACM Symposium on the Theory of Computing. ACM Press, New York, NY, 1994. http://citeseer.ist.psu.edu/blum94weakly.html More
@inproceedings{ blum94weakly,
author = "Avrim Blum and Merrick Furst and Jeffrey Jackson and Michael Kearns and Yishay Mansour and Steven Rudich",
title = "Weakly learning {DNF} and characterizing statistical query learning using {Fourier} analysis",
pages = "253--262",
year = "1994",
url = "citeseer.ist.psu.edu/blum94weakly.html" }
Citations (may not include all citations):493 Communications of the ACM (context) - Valiant, of et al. - 1984
96 Learning decision trees using the Fourier spectrum - Kushilevitz, Mansour - 1991 ACM DBLP
84 Learning conjunctions of Horn clauses - Angluin, Frazier et al. - 1990 ACM DBLP
74 Exact learning via the monotone theory (context) - Bshouty - 1993
66 Constant depth circuits (context) - Linial, Mansour et al. - 1989
46 Personal communication (context) - Lipton
42 term DNF formulas with queries (context) - Blum, Rudich et al. - 1992
33 Exact learning of read-twice DNF formulas (context) - Aizenstein, Pitt - 1991
22 Read-thrice DNF is hard to learn with membership and equival.. (context) - Aizenstein, Hellerstein et al. - 1992 DBLP
19 On learning visual concepts and DNF formulae - Kushilevitz, Roth - 1993
19 Improved learning of AC 0 functions - Furst, rey et al. - 1991
18 Ecient noise-tolerant learning from statistical queries (context) - Kearns - 1993
16 On using the Fourier transform to learn disjoint DNF - Khardon - 1993 ACM DBLP
15 Exact learning of read-k disjoint DNF and not-so-disjoint DN.. (context) - Aizenstein, Pitt - 1992
15 Toward ecient agnostic learning (context) - Kearns, Schapire et al. - 1992
14 learning algorithm for DNF under the uniform distribution - Mansour, log - 1992
7 Cryptographic hardness of distribution-specic learning (context) - Kharitonov - 1993
2 DNF formulas and k decision trees (context) - Hancock - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mathcs.duq.edu/~jackson/): More
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from.. - Jackson (2000) (Correct)
Improved Learning of AC 0 Functions - Furst, Jackson, al. (1991) (Correct)
An Efficient Membership-Query Algorithm for Learning DNF with.. - Jackson (1994) (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