Richard Nock, Pascal Jappy, Jean Sallantin  Home/Search
Context Related
| lirmm.fr/~nock/RepScien...isaac98.ps.gz 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: lirmm.fr/~nock/Rep...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we study the existence of Occam's razors for a widely studied class of Boolean Formulae : Disjunctive Normal Forms (DNF). An Occam's razor is an algorithm which compresses the knowledge of observations (examples) in small formulae. We prove that approximating the minimally consistent DNF formula, and a generalization of graph colorability, is very hard. Other results on approximating Boolean formulae (and classical graph coloring) are negligible compared to ours. Our proof... (Update)
Cited by: More
Learning DNF Formulas: A Survey - Hellerstein (Correct)
Active bibliography (related documents): More All
0.4: On Learning Read-k-Satisfy-j DNF - Aizenstein, Blum, Khardon.. (1996) (Correct)
0.2: Learning nearly monotone k-term DNF - Castro, Guijarro, Lavín (1996) (Correct)
0.2: Boolean Formulas are Hard to Learn for Most - Gate Bases Ictor (Correct)
Similar documents based on text: More All
0.3: Application of Linear Matroids to Graph Colorability - Jensen (2001) (Correct)
0.3: Partial Occam's Razor and its Applications - Domingo, Tsukiji, Watanabe (1996) (Correct)
0.2: An Overview of Learning in the Multi-TAC System - Minton, Allen, Wolfe, Philpot (1995) (Correct)
BibTeX entry: (Update)
Nock, Jappy, and Sallantin. Generalized graph colorability and compressibility of boolean formulae. In ISAAC: 9th International Symposium on Algorithms and Computation (formerly SIGAL International Symposium on Algorithms), 1998. http://citeseer.ist.psu.edu/nock98generalized.html More
@inproceedings{ nock98generalized,
author = "Nock and Jappy and Sallantin",
title = "Generalized Graph Colorability and Compressibility of Boolean Formulae",
booktitle = "{ISAAC}: 9th International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1998",
url = "citeseer.ist.psu.edu/nock98generalized.html" }
Citations (may not include all citations):2177 programs for machine learning (context) - Quinlan - 1994
686 a guide to the theory of NP-Completeness (context) - Garey, Johnson et al. - 1979
493 Communications of the ACM (context) - Valiant, of et al. - 1984
492 Learning logical definition from relations (context) - Quinlan - 1990
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
271 Efficient induction of logic programs - Muggleton, Feng - 1994
248 An Introduction to Computational Learning Theory (context) - Kearns, Vazirani - 1994
248 Fast effective rule induction - Cohen - 1995
216 Very simple classification rules perform well on most common.. (context) - Holte - 1993
149 Information Processing Letters (context) - Blumer, Ehrenfeucht et al. - 1987
147 Boolean feature discovery in empirical learning (context) - Pagallo, Haussler - 1990
144 Computational limitations on learning from examples (context) - Pitt, Valiant - 1988
98 Zero knowledge and the chromatic number - Feige, Kilian - 1996
84 Learning disjunctions of conjunctions (context) - Valiant - 1985
78 the learnability of boolean formulae - Kearns, Li et al. - 1987
66 Structural Complexity (context) - Balcazar, Diaz et al. - 1988
46 Learning non-recursive definitions of relations with linus (context) - Lavrac, Dzeroski et al. - 1991
24 MDL and categorical theories (context) - Quinlan - 1995
16 On using the fourier transform to learn disjoint DNF - Khardon - 1994
15 Exact learning of read-k-disjoint DNF and not-so-disjoint-DN.. (context) - Aizenstein, Pitt - 1992
13 the learnability of Disjunctive Normal Form formulas (context) - Aizenstein, Pitt - 1995
12 PAC-learning a restricted class of recursive logic programs - Cohen - 1993
12 the limits of proper learnability of subclasses of DNF formu.. (context) - Pillaipakkamnatt, Raghavan - 1994
12 Clique is hard to approximate within n 1\Gammaffl (context) - astad - 1996
11 term-DNF formulas with an incomplete membership oracle (context) - Goldman, Mathias - 1992
9 On learning read-k-satisfy-j DNF (context) - Blum, Khardon et al. - 1994
8 On learning decision committees (context) - Nock, Gascuel - 1995
7 ITOU: induction of first-order theories (context) - Rouveirol - 1992
5 Characteristic sets for polynomial grammatical inference (context) - Higuera - 1996
4 Linear time deterministic learning of k-term-DNF (context) - Berggren - 1993
1 DNF formulas (context) - Bshouty, Chen et al. - 1995
1 Noise-tolerant relational concept learning (context) - Brunk, Pazzani - 1991
1 Iterative concept learning and construction by analogy (context) - de Raedt - 1992
1 algorithm for dnf under the uniform distribution (context) - Mansour, log - 1992
1 Hypothesis-driven constructive induction in AQ (context) - Wnek, Michalski - 1991
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