Exact learning of DNF formulas using DNF hypotheses

Journal of Computer and System Sciences

Volumn 70, Issue 4, 2005, Pages 435-470

  Hellerstein, Lisa ^a   Raghavan, Vijay ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

Algorithms; Boolean functions; Certificates; Complexity theory; Computational learning theory; Disjunctive normal form; DNF

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; POLYNOMIALS; THEOREM PROVING;

CERTIFICATES; COMPLEXITY THEORY; COMPUTATIONAL LEARNING THEORY; DISJUNCTIVE NORMAL FORM (DNF);

LEARNING SYSTEMS;

EID: 17444399680     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.10.001     Document Type: Conference Paper

References (35)

1. A. Aizenstein, T. Hegedus, L. Hellerstein, and L. Pitt Complexity theoretic hardness results for query learning Comput. Complexity 7 1 1998 19 53
2. D. Angluin Queries and concept learning Mach. Learning 2 4 1988 319 342
3. D. Angluin, and M. Kharitonov When won't membership queries help? J. Comput. System Sci. 50 2 1995 336 355 doi:10.1006/jcss.1995.1026
4. A. Beimel, F. Bergadano, N.H. Bshouty, E. Kushilevitz, and S. Varricchio On the applications of multiplicity automata in learning IEEE Symposium on Foundations of Computer Science 1996 349 358
5. U. Berggren Linear time deterministic learning of k-term DNF Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory 1993 ACM Press New York 37 40
6. A. Blum Separating distribution-free and mistake-bound learning models over the Boolean domain SIAM J. Comput. 23 5 1994 990 1000
7. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich Weakly learning DNF and characterizing statistical query learning using Fourier analysis Proceedings of 26th ACM Symposium on Theory of Computing 1994
8. A. Blum, and S. Rudich Fast learning of κ-term DNF formulas with queries J. Comput. System Sci. 51 3 1995 367 373 doi:10.1006/jcss.1995.1075
9. N.H. Bshouty Exact learning via the monotone theory Inform. Comput. 123 1 1995 146 153
10. N.H. Bshouty A subexponential exact learning algorithm for DNF using equivalence queries Inform. Process. Lett. 59 1 1996 37 39
11. N.H. Bshouty Simple learning algorithms using divide and conquer Comput. Complexity 6 1997 174 194
12. N.H. Bshouty, Personal communication, 5 November 2003.
13. N.H. Bshouty, L. Burroughs, On the proper learning of axis parallel concepts, J. Machine Learning Research 4 (Jun) (2003) 157-176.
14. N.H. Bshouty, S.A. Goldman, T.R. Hancock, and S. Matar Asking questions to minimize errors J. Comput. System Sci. 52 2 1996 268 286 doi:10.1006/jcss.1996.0021
15. A. Chandra, and G. Markowsky On the number of prime implicants Discrete Math. 24 1978 7 11
16. O. Ekin, S. Foldes, P. Hammer, and L. Hellerstein Equational theories of Boolean functions Discrete Math. 211 2000 27 51
17. T. Hegedus Generalized teaching dimensions and the query complexity of learning Proceedings of the Eighth Annual Conference on Computational Learning Theory (COLT'95) 1995 ACM Press New York 108 117
18. L. Hellerstein On generalized constraints and certificates Discrete Math. 226 1-3 2001 211 232
19. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, and D. Wilkins How many queries are needed to learn? J. ACM 43 5 1996 840 862
20. L. Hellerstein, and V. Raghavan Exact learning of DNF formulas using DNF hypotheses Proceedings of the 34th Annual Symposium on Theory of Computing (STOC) 2002 465 473
21. J.C. Jackson An efficient membership-query algorithm for learning DNF with respect to the uniform distribution J. Comput. System Sci. 55 3 1997 414 440 doi:10.1006/jcss.1997.1533
22. 1/3) Proceedings of the 33rd Annual Symposium on Theory of Computing (STOC) 2001
23. p are sufficient for exact learning Proceedings of the Eighth International Workshop on Algorithmic Learning Theory (ALT) 1997 277 290
24. E. Kushilevitz A simple algorithm for learning o(log n) -term DNF Inform. Process. Lett. 61 6 1997 289 292
25. N. Linial, Y. Mansour, and N. Nisan Constant depth circuits, Fourier transform and learnability J. ACM 40 3 1993 607 620
26. W.J. Masek, Some NP-complete set covering problems, unpublished manuscript, 1979.
27. D.E. Muller, and F.P. Preparata Bounds to complexities of networks for sorting and for switching J. ACM 22 1975 195 201
28. M. Naor, L.J. Schulman, and A. Srinivasan Splitters and near-optimal derandomization IEEE Symposium on Foundations of Computer Science 1995 182 191
29. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley Reading, MA
30. C.H. Papadimitriou, and M. Yannakakis On limited nondeterminism and the complexity of the VC-dimension J. Comput. System Sci. 53 2 1996 161 170
31. K. Pillaipakkamnatt, and V. Raghavan On the limits of proper learnability of subclasses of DNF formulas Mach. Learning 25 2-3 1996 237 263
32. N. Pippenger Galois theory for minors of finite functions Discrete Math. 254 2002 405 419
33. J. Tarui, and T. Tsukiji Learning DNF by approximating inclusion-exclusion formulae Proceedings of the IEEE Conference on Computational Complexity 1999 215 220
34. C. Umas The minimum equivalent DNF problem and shortest implicants IEEE Symposium on Foundations of Computer Science 1998 556 563
35. p minimization problems Proceedings of IEEE Symposium on Foundations of Computer Science 1999 465 474