8 search results - page 1 / 2 » Learning DNF by Approximating Inclusion-Exclusion Formulae |
COCO
1999
Springer
13 years 9 months ago
1999
Springer
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
JCSS
2007
13 years 5 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
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 form...