The consistency dimension and distribution-dependent learning from queries

Theoretical Computer Science

Volumn 288, Issue 2, 2002, Pages 197-215

  Balcázar, José L ^a   Castro, Jorge ^a   Guijarro, David ^a   Simon, Hans Ulrich ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; LEARNING ALGORITHMS; MEMBERSHIP FUNCTIONS; PROBABILITY DISTRIBUTIONS;

QUERY LEARNING;

QUERY LANGUAGES;

EID: 0037120729     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00400-5     Document Type: Conference Paper

References (9)

1. Angluin D. Learning regular sets from queries and counterexamples. Inform. and Comput. 75:1987;87-106.
2. Angluin D. Queries and concept learning. Mach. Learning. 2:1988;319-342.
3. Angluin D. Negative results for equivalence queries. Mach. Learning. 5:1990;121-150.
4. Castro J., Balcázar J.L. Simple pac learning of simple decision lists. Sixth International Workshop, ALT'95, Fukuoka, Japan, Lecture Notes in Artificial Intelligence. 1995;239-248 Springer, Berlin.
5. Gavaldà R. On the power of equivalence queries. EUROCOLT'93, Lecture Notes in Artificial Intelligence. 1993;193-203 Springer, Berlin.
6. Hayashi Y., Matsumoto S., Shinohara A., Takeda M. Uniform characterization of polynomial-query learnabilities. First International Conference, DS'98, Fukuoka, Japan, Lecture Notes in Artificial Intelligence. 1998;84-92 Springer, Berlin.
7. Hellerstein L., Pillaipakkamnatt K., Raghavan V., Wilkins D. How many queries are needed to learn? J. ACM. 43(5):1996;840-862.
8. Maass W. On-line learning with an oblivious environment and the power of randomization. Proc. Fourth Annual Workshop on Computer Learning Theory, San Mateo, CA. 1991;167-175 Morgan Kaufmann, Los Altos, CA.
9. Valiant L. A theory of the learnable. Comm. ACM. 27:1984;1134-1142.