Queries revisited

Theoretical Computer Science

Volumn 313, Issue 2, 2004, Pages 175-194

  Angluin, Dana ^a  

^a Yale University   (United States)

Author keywords

Learning dimension; Learning with queries; Query complexity

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; LEARNING ALGORITHMS; MEMBERSHIP FUNCTIONS; PROBLEM SOLVING; QUERY LANGUAGES;

LEARNING DIMENSION; LEARNING WITH QUERIES; QUERY COMPLEXITY;

LEARNING SYSTEMS;

EID: 0742284346     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.11.004     Document Type: Conference Paper

References (19)

1. Angluin D. Queries and concept learning. Mach. Learning. 2:1988;319-342.
2. Angluin D. Negative results for equivalence queries. Mach. Learning. 5:1990;121-150.
3. E.M. Arkin, H. Meijer, J.S.B. Mitchell, D. Rappaport, S.S. Skiena, Decision trees for geometric models, in: Proc. of the Nineth Annual Symp. on Computational Geometry, San Diego, CA, ACM Press, New York, 1993, pp. 369-378.
4. J.L. Balcázar, J. Castro, D. Guijarro, A general dimension for exact learning, in: Proc. of the 14th Annual Conf. on Computational Learning Theory, Amsterdam, The Netherlands, 2001.
5. Balcázar J.L., Castro J., Guijarro D. A new abstract combinatorial dimension for exact learning via queries. J. Comput. System Sci. 64(1):2002;2-21.
6. Balcázar J.L., Castro J., Guijarro D., Simon H.-U. The consistency dimension and distribution-dependent learning from queries. Theoret. Comput. Sci. 288(2):2002;197-215.
7. Blumer A., Ehrenfeucht A., Haussler D., Warmuth M.K. Learnability and the Vapnik-Chervonenkis dimension. J. ACM. 36:1989;929-965.
8. Ehrenfeucht A., Haussler D., Kearns M., Valiant L. A general lower bound on the number of examples needed for learning. Inform. Comput. 82:1989;247-261.
9. R. Gavaldà, On the power of equivalence queries, in: EUROCOLT: European Conf. on Computational Learning Theory, Clarendon Press, Oxford, 1993, pp. 193-203.
10. Goldman S.A., Kearns M.J. On the complexity of teaching. J. Comput. System Sci. 50:1995;20-31.
11. Y. Hayashi, S. Matsumoto, A. Shinohara, M. Takeda, Uniform characterizations of polynomial-query learnabilities, in: Proc. of the 1st Internat. Conf. on Discovery Science (DS-98), London, UK, Lecture Notes in Artificial Intelligence, vol. 1532, 1998, pp. 84-92.
12. T. Hegedüs, Generalized teaching dimensions and the query complexity of learning, in: Proc. of the 8th Ann. Conf. on Computational Learning Theory, ACM Press, New York, NY, 1995, pp. 108-117.
13. Hellerstein L., Pillaipakkamnatt K., Raghavan V., Wilkins D. How many queries are needed to learn? J. Assoc. Comput. Mach. 43(5):1996;840-862.
14. Hyafil R., Rivest R.L. Constructing optimal binary trees is NP-complete. Inform. Process. Lett. 5:1976;15-17.
15. Littlestone N. Learning quickly when irrelevant attributes abound. a new linear-threshold algorithm Mach. Learning. 2:1988;285-318.
16. Maass W., Turán G. Lower bound methods and separation results for on-line learning models. Mach. Learning. 9:1992;107-145.
17. M. Moshkov, Test theory and problems of machine learning, in: Proc. of the Internat. School-Seminar on Discrete Mathematics and Mathematical Cybernetics, MAX Press, Moscow, 2001, pp. 6-10.
18. Shinohara A., Miyano S. Teachability in computational learning. New Generation Comput. 8(4):1991;337-348.
19. Valiant L.G. A theory of the learnable. Commun. ACM. 27:1984;1134-1142.