127 search results - page 2 / 26 » Learning Monotone Decision Trees in Polynomial Time |
ECCC
2002
13 years 7 months ago
2002
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
COLT
2001
Springer
13 years 12 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
COLT
2001
Springer
13 years 12 months ago
2001
Springer
We present results concerning the learning of Monotone DNF (MDNF) from Incomplete Membership Queries and Equivalence Queries. Our main result is a new algorithm that allows effici...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE