T. R. Hancock, Learning 2DNF formulas and k decision trees, in Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991, pp. 199-209.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of polynomial size Disjunctive Normal Form expressions. The DNF learning problem has a long history. Valiant [32] introduced the problem and gave ecient algorithms for learning certain subclasses of DNF. Since then, learning algorithms have been developed for a number of other subclasses of DNF [25, 4, 2, 21, 3, 1, 11, 27, 13, 10] and recently for the unrestricted class of DNF expressions [22] but almost all of these results and in particular the results for the unrestricted class use membership queries (the learner is told the output value of the target function on learner speci ed inputs) While Angluin and Kharitonov ....

T. R. Hancock, Learning 2DNF formulas and k decision trees, in Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991, pp. 199-209.

....cryptographic assumptions. In fact, at the time of Kharitonov s result, it appeared possible that his results would soon be extended to DNF; our result shows otherwise. Due to the lack of positive results for unrestricted DNF, various restricted DNF classes have attracted considerable attention [4, 2, 8, 3, 1, 5, 14, 6]. We extend these results. In particular, it is known that the class of read k DNF (DNF in which every variable appears at most k times) is learnable in polynomial time using membership queries for k 2 [2, 8] but is as hard to learn in the distribution free PAC model as unrestricted DNF for k ....

....various restricted DNF classes have attracted considerable attention [4, 2, 8, 3, 1, 5, 14, 6] We extend these results. In particular, it is known that the class of read k DNF (DNF in which every variable appears at most k times) is learnable in polynomial time using membership queries for k 2 [2, 8] but is as hard to learn in the distribution free PAC model as unrestricted DNF for k 3 [8] Also, Aizenstein and Pitt [3] have shown that read k SAT DNF (DNF which are both read k and such that at most terms are Actually, they show exact with mem eq query learning. satis ed by any ....

[Article contains additional citation context not shown here]

Thomas R. Hancock. Learning 2DNF formulas and k decision trees. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 199-209, 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