Version spaces and the consistency problem

Artificial Intelligence

Volumn 156, Issue 2, 2004, Pages 115-138

  Hirsh, Haym ^a   Mishra, Nina ^b   Pitt, Leonard ^c  

^a RUTGERS UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Boundary sets; Consistency problem; Inductive learning; Version spaces

Indexed keywords

ALGEBRA; BOUNDARY VALUE PROBLEMS; FUNCTIONS; LEARNING ALGORITHMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

BOUNDARY SETS; CONSISTENCY PROBLEMS; INDUCTIVE LEARNING; VERSION SPACES;

ARTIFICIAL INTELLIGENCE;

EID: 2442676919     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2003.04.003     Document Type: Article

References (30)

1. Aizenstein H., Hegedus T., Hellerstein L., Pitt L. Complexity theoretic hardness results for query learning. Comput. Complexity. 7:(1):1998;19-53.
2. Aizenstein H., Pitt L. On the learnability of disjunctive normal form formulas. Machine Learning. 19:(3):1995;183-208.
3. Blumer A., Ehrenfeucht A., Haussler D., Warmuth M.K. Learnability and the Vapnik-Chervonenkis dimension. J. ACM. 36:(4):1989;929-965.
4. Blum A., Mitchell T. Combining labeled and unlabeled data with co-training. Proceedings of the 11th Annual Conference on Computational Learning Theory (COLT-98). 1998;92-100 ACM Press, New York.
5. Domingo C., Mishra N., Pitt L. Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries. Machine Learning. 37:(1):1999;89-110.
6. Eiter T., Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24:(6):1995;1278-1304.
7. Eiter T., Gottlob G., Makino K. New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32:(2):2003;514-537.
8. T. Eiter, T. Ibaraki, K. Makino, Decision lists and related boolean functions, IFIG Research Report 9804, April 1998.
9. Fredman M., Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms. 21:(3):1996;618-628.
10. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
11. Haussler D. Quantifying inductive bias: AI learning algorithms and Valiant's learning framework. Artificial Intelligence. 36:1988;177-221.
12. Haussler D. Learning conjunctive concepts in structural domains. Machine Learning. 4:(1):1989;7-40.
13. Hirsh H. Polynomial-time learning with version spaces. Proc. AAAI-92, San Jose, CA. 1992;117-122 MIT Press, Cambridge, MA.
14. Hirsh H. Generalizing version spaces. Machine Learning. 17:(1):1994;5-46.
15. P. Idestam-Almquist, Demand networks: An alternative representation of version spaces, SYSLAB Report 75, Department of Computer and Systems Sciences, The Royal Institute of Technology and Stockholm University, 1989.
16. Johnson D., Papadimitriou C., Yannakakis M. On generating all maximal independent sets. Inform. Process. Lett. 27:(3):1988;119-123.
17. Kearns M.J., Vazirani U.V. An Introduction to Computational Learning Theory. 1994;MIT Press, Cambridge, MA.
18. Lawler E., Lenstra J., Rinnooy Kan A. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM J. Comput. 9:(3):1980;558-565.
19. Lau T., Wolfman S., Domingos P., Weld D. Programming by demonstration using version space algebra. Machine Learning. 53:(1-2):2003;111-156.
20. Mitchell T.M. Generalization as search. Art. Int. 18:1982;203-226.
21. Mitchell T.M. Machine Learning. 1997;McGraw-Hill, New York.
22. Norton S.W., Hirsh H. Classifier learning from noisy data as probabilistic evidence combination. Proc. AAAI-92, San Jose, CA. 1992;141-146 MIT Press, Cambridge, MA.
23. Pitt L., Valiant L. Computational limitations on learning from examples. J. ACM. 35:1988;965-984.
24. Rivest R.L. Learning decision lists. Machine Learning. 2:(3):1987;229-246.
25. B. Smith, Induction as knowledge integration, PhD Thesis, University of Southern California, Computer Science Department, December 1995.
26. Seung H.S., Opper M., Sompolinsky H. Query by committee. Haussler D. Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, Pittsburgh, PA. 1992;287-294 ACM Press, New York.
27. Smith B.D., Rosenbloom P.S. Incremental non-backtracking focusing: A polynomially bounded generalization algorithm for version spaces. Proc. AAAI-90, Boston, MA. 1990;848-853.
28. Utgoff P.E. Machine Learning of Inductive Bias. 1986;Kluwer, Boston, MA.
29. Valiant L.G. The complexity of enumeration and reliability problems. SIAM J. Comput. 8:(3):1979;410-421.
30. VanLehn K., Ball W. A version space approach to learning context-free grammars. Machine Learning. 2:(1):1987;39-74.