Carlos Domingo, Nina Mishra, Leonard Pitt  Home/Search
Context Related
| hp.com/org/stl/dmsd/publica...cnfdnf.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: hp.com/org/stl/dmsd/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times ("read-k" monotone CNF). Let f : f0; 1g n ! f0; 1g be expressible as a read-k monotone CNF formula for some natural number k. We give an incremental output polynomial time algorithm for exact learning both the read-k CNF and (not necessarily read restricted) DNF descriptions of f . The algorithm's only method of obtaining information about f is through membership queries, i.e., by... (Update)
Context of citations to this paper: More
.... in machine learning is whether monotone Boolean functions are exactly learnable in polynomial time using only membership queries [2,5,4,3]. Given access to a membership query oracle, a function is considered to be identified if both its CNF and DNF representations are...
.... (see [15] are of interest in various areas such as database theory (e.g. 38, 49] machine learning and data mining (e.g. [6, 7, 12, 22]) game theory (e.g. 26, 42, 43] artificial intelligence (e.g. 21, 28, 29, 44] mathematical programming (e.g. 5] and...
Cited by: More
Abduction and the Dualization Problem - Eiter, Makino (2003) (Correct)
New Results on Monotone Dualization and Generating Hypergraph.. - Eiter, al. (2002) (Correct)
Almost all monotone Boolean functions are polynomially .. - Shmulevich.. (2001) (Correct)
Similar documents (at the sentence level):
60.0%: Efficient Read-Restricted Monotone CNF/DNF Dualization by.. - Domingo, Mishra, Pitt (1998) (Correct)
22.5%: Concept Learning: Theory, Applications and Related Problems - Domingo (1998) (Correct)
Active bibliography (related documents): More All
0.5: Polynomial Time Recognition Of 2-Monotonic Positive Boolean.. - Endre Boros Peter (1997) (Correct)
0.3: Complexity Theoretic Hardness Results for Query Learning - Aizenstein, Hegedüs.. (1998) (Correct)
0.3: Functional Dependencies in Horn Theories - Ibaraki, Kogan, Makino (1998) (Correct)
Similar documents based on text: More All
0.3: Towards the Visualization of Overlapping Sets - Boyen, Mishra, O'Callaghan (Correct)
0.3: On Learning Monotone Boolean Functions - Blum, Burch, Langford (1998) (Correct)
0.2: Streaming-Data Algorithms for High-Quality Clustering - O'Callaghan, Mishra.. (2002) (Correct)
Related documents from co-citation: More All
3: Identifying the minimal transversals of a hypergraph and related problems - Eiter, Gottlob - 1991
3: The maximum latency and identification of positive boolean functions (context) - Makino, Ibaraki - 1994
3: Complexity of identification and dualization of positive boolean functions (context) - Bioch, Ibaraki - 1995
BibTeX entry: (Update)
C. Domingo, N. Mishra, L. Pitt, Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries, Mach. Learning 37 (1) (1999) 89--110. http://citeseer.ist.psu.edu/domingo99efficient.html More
@article{ domingo99efficient,
author = "Carlos Domingo and Nina Mishra and Leonard Pitt",
title = "Efficient Read-Restricted Monotone {CNF}/{DNF} Dualization by Learning with Membership Queries",
journal = "Machine Learning",
volume = "37",
number = "1",
pages = "89-110",
year = "1999",
url = "citeseer.ist.psu.edu/domingo99efficient.html" }
Citations (may not include all citations):4212 Computers and intractability --- A guide to the theory of NP.. (context) - Garey, Johnson - 1979
910 Fast Algorithms for Mining Association Rules - Agrawal, Srikant - 1994
537 A theory of the learnable (context) - Valiant - 1984
441 Queries and concept learning (context) - Angluin - 1988
400 Fast discovery of association rules (context) - Agrawal, Mannila et al. - 1996
274 Generalization as search (context) - Mitchell - 1982
268 Mining Generalized Association Rules - Srikant, Agrawal - 1995
100 Levelwise Search and Borders of Theories in Knowledge Discov.. - Mannila, Toivonen - 1997
97 Learning read-once formulas with queries - Angluin, Hellerstein et al. - 1993
97 Knowledge compilation using horn approximations - Selman, Kautz - 1991
72 On generating all maximal independent sets (context) - Johnson, Papadimitriou et al. - 1988
71 A fast parallel algorithm for the maximal independent set pr.. (context) - Karp, Wigderson - 1985
69 the complexity of dualization of monotone disjunctive normal.. (context) - Fredman, Khachiyan - 1996
67 Identifying the minimal transversals of a hypergraph and rel.. - Eiter, Gottlob - 1995
64 The Design of Relational Databases (context) - Mannila, Raiha - 1992
61 Mining associations between sets of items in massive databas.. (context) - Agrawal, Imielinski et al. - 1993
57 Oracles and queries that are sufficient for exact learning - Bshouty, Cleve et al. - 1996
48 Reasoning with models - Khardon, Roth - 1994
44 Complexity of identification and dualization of positive Boo.. (context) - Bioch, Ibaraki - 1995
39 Reasoning with characteristic models - Kautz, Kearns et al. - 1993
37 Discovering All Most Specific Sentences by Randomized Algori.. - Gunopulos, Mannila et al. - 1997
28 Generating all maximal independent sets: NP-hardness and pol.. (context) - Lawler, Lenstra et al. - 1980
26 an algorithm for finding all interesting sentences (context) - Mannila, Toivonen - 1996
26 Learning arithmetic read-once formulas (context) - Bshouty, Hancock et al. - 1995
25 A new algorithm for generating all the maximal independent s.. (context) - Tsukiyama, Ide et al. - 1977
23 Version spaces without boundary sets (context) - Hirsh, Mishra et al. - 1997
22 DNF formulas on product distributions (context) - Hancock, Mansour et al. - 1991
18 The maximum latency and identification of positive Boolean f.. (context) - Makino, Ibaraki - 1997
18 Generating the irredundant conjunctive and disjunctive norma.. (context) - Gurvich, Khachiyan - 1995
17 Translating between horn representations and their character.. - Khardon - 1995
17 A fast and simple algorithm for identifying 2-monotonic posi.. (context) - Makino, Ibaraki - 1998
15 Reasoning with examples: Propositional formulae and database.. - Khardon, Mannila et al.
14 Discrete Mathematical Structures with Applications to Comput.. (context) - Tremblay, Manohar - 1961
12 the limits of proper learnability of subclasses of DNF formu.. (context) - Pillaipakkamnatt, Raghavan - 1996
12 Complexity theoretic hardness results for query learning - Aizenstein, Hegedus et al. - 1998
11 Minimization in Cooperative Response to Failing Database Que.. - Godfrey - 1998
11 Minimization in Cooperative Response to Failing Queries - Godfrey - 1997
10 Read-twice DNF formulas are properly learnable (context) - Pillaipakkamnatt, Raghavan - 1995
10 Approximate inference of functional dependencies from relati.. (context) - Kivinen, Mannila - 1995
8 Learning Boolean read-once formulas over generalized bases - Bshouty, Hancock et al. - 1995
3 On one criterion of optimality of an algorithm for evaluatin.. (context) - Gainanov - 1984
2 DAMATH: Discrete Applied Mathematics and Combinatorial Opera.. (context) - Mannila, Raiha et al. - 1992
1 On Monotone Functions of the Algebra of Logic (context) - Korobkov - 1965
1 On learning read-k-satisfy-j DNF - Aizenstein, Blum et al. - 1998
Documents on the same site (http://www.hpl.hp.com/org/stl/dmsd/pubs.html): More
A Data-Warehouse / OLAP Framework for Scalable.. - Chen, Hsu, Dayal (2000) (Correct)
Dynamic-Agents for Dynamic Service Provisioning - Chen, Chundi, Dayal, Hsu (1998) (Correct)
An OLAP-based Scalable Web Access Analysis Engine - Chen, Dayal, Hsu (2000) (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