Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth  Home/Search
Context Related
| uiuc.edu/~pitt/Papers/rksj.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: uiuc.edu/~pitt/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the learnability of Read-k-Satisfy-j (RkSj) DNF formulas. These are boolean formulas in disjunctive normal form (DNF), in which the maximum number of occurrences of a variable is bounded by k, and the number of terms satisfied by any assignment is at most j. After motivating the investigation of this class of DNF formulas, we present an algorithm that with high probability finds a DNF formula that is logically equivalent to any unknown RkSj DNF formula to be learned. The algorithm ... (Update)
Context of citations to this paper: More
.... (occurrences of each variable) in a formula, a restriction that has been well investigated in the learning theory literature [3, 38, 9, 10, 39, 1, 2]. Previous work has shown that it is possible to identify an arbitrary monotone read once ( formula under a stronger notion of...
Cited by: More
Efficient Read-Restricted Monotone CNF/DNF Dualization by.. - Domingo, Mishra, Pitt (1999) (Correct)
Similar documents (at the sentence level):
52.1%: On Learning Read-k-Satisfy-j DNF - al. (1998) (Correct)
Active bibliography (related documents): More All
0.5: On Learning Visual Concepts and DNF Formulae - Kushilevitz, Roth (1993) (Correct)
0.4: Weakly Learning DNF and Characterizing Statistical - Query Learning Using (Correct)
0.4: Generalized Graph Colorability and Compressibility of.. - Nock, Jappy, Sallantin (1998) (Correct)
Similar documents based on text: More All
0.5: Fast Learning of k-Term DNF Formulas with Queries - Blum, Rudich (1992) (Correct)
0.5: Learning k-term DNF Formulas with an Incomplete Membership.. - Goldman, Mathias (1992) (Correct)
0.4: Weakly Learning DNF and Characterizing Statistical Query Learning.. - Blum (1994) (Correct)
Related documents from co-citation: More All
2: Minimization in cooperative response to failing database queries - Godfrey - 1997
BibTeX entry: (Update)
H. Aizenstein, A. Blum, R. Khardon, E. Kushilevitz, L. Pitt, and D. Roth. On learning read-k-satisfy-j DNF. SIAM Journal on Computing, 27(6):1515--1530, 1998. 22 http://citeseer.ist.psu.edu/aizenstein98learning.html More
@article{ aizenstein98learning,
author = "Howard Aizenstein and Avrim Blum and Roni Khardon and Eyal Kushilevitz and Leonard Pitt and Dan Roth",
title = "On Learning Read-k-Satisfy-j {DNF}",
journal = "SIAM J. Comput.",
volume = "27",
number = "6",
pages = "1515-1530",
year = "1998",
url = "citeseer.ist.psu.edu/aizenstein98learning.html" }
Citations (may not include all citations):2177 Programs for machine learning (context) - Quinlan - 1993
1359 Induction of decision trees (context) - Quinlan - 1986
493 Communications of the ACM (context) - Valiant, of et al. - 1984
441 Queries and concept learning (context) - Angluin - 1988
190 Wadsworth International Group (context) - Breiman, Friedman et al. - 1984
144 Computational limitations on learning from examples (context) - Pitt, Valiant - 1988
97 Learning read-once formulas with queries - Angluin, Hellerstein et al. - 1993
96 Learning decision trees using the fourier spectrum - Kushilevitz, Mansour - 1991
84 Learning conjunctions of Horn clauses - Angluin, Frazier et al. - 1992
82 When won't membership queries help (context) - Angluin, Kharitonov - 1991
78 the learnability of Boolean formulae - Kearns, Li et al. - 1987
74 Exact learning via the monotone theory (context) - Bshouty - 1993
67 Negative results for equivalence queries (context) - Angluin - 1990
63 Weakly learning DNF and characterizing statistical query lea.. - Blum, Furst et al. - 1994
46 An efficient membership-query algorithm for learning DNF wit.. - Jackson - 1994
42 term DNF formulas with queries (context) - Blum, Rudich et al. - 1992
33 Exact learning of read-twice DNF formulas (context) - Aizenstein, Pitt - 1991
27 term DNF formulas using queries and counterexamples (context) - Angluin - 1987
22 Read-thrice DNF is hard to learn with membership and equival.. (context) - Aizenstein, Hellerstein et al. - 1992
19 On learning visual concepts and DNF formulae - Kushilevitz, Roth - 1996
16 On using the Fourier transform to learn disjoint DNF - Khardon - 1994
15 Exact learning of read-k disjoint DNF and not-sodisjoint DNF (context) - Aizenstein, Pitt - 1992
13 the Learnability of Disjunctive Normal Form Formulas and Dec.. (context) - Aizenstein - 1993
13 the learnability of disjunctive normal form formulas (context) - Aizenstein, Pitt - 1993
11 Learning 2 DNF formulas and k decision trees (context) - Hancock - 1991
11 bound on the time for parallel RAM's to compute nondegenerat.. (context) - Simon, tightmega et al. - 1983
9 On learning read-k satisfy-j DNF (context) - Blum, Khardon et al. - 1994
4 Read twice DNF formulas are properly learnable (context) - Pillapakkamnatt, Raghavan - 1995
2 Learning with minimal number of queries (context) - Matar - 1993
1 the limits of proper learnability of subsets of DNF formulas (context) - Pillapakkamnatt, Raghavan - 1996
Documents on the same site (http://www-sal.cs.uiuc.edu/~pitt/): More
On Exploiting Knowledge and Concept Use in Learning Theory - Pitt (Correct)
Learning Conjunctions of Horn Clauses - Angluin, Frazier, Pitt (1992) (Correct)
Criteria for Polynomial Time (Conceptual) Clustering - Pitt, Reinke (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