The consistency dimension, compactness, and query learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1683, Issue , 1999, Pages 2-13

  Balcázar, José L ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY;

QUERY LEARNING; QUERY LEARNING MODELS; REPRESENTATION CLASS; TOPOLOGICAL SPACES;

COMPUTER CIRCUITS;

EID: 84956853301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_2     Document Type: Conference Paper

References (8)

1. J Balcázar, J Castro, D Guijarro, H-U Simon. The consistency dimension and distribution-dependent learning from queries. To appear in Algorithmic Learning Theory ALT99, Tokyo.
2. A Blumer, A Ehrenfeucht, D Haussler, M Warmuth: Learnability and the Vapnik- Chervonenkis dimension. Journal of the ACM 36, 4 (1989), 929-965
3. S Goldman, M Kearns: On the complexity of teaching. Journal of Computer and System Sciences 50 (1995), 20-31
4. D Guijarro: Ph D dissertation, in preparation
5. L Hellerstein, K Pillaipakkamnat, V Raghavan, D Wilkins: How many queries are needed to learn? Journal of the ACM 43, 5 (1996), 840-862
6. M Kearns, U Vazirani: An Introduction to Computational Learning Theory. MIT Press 1994.
7. M Raman: Understanding compactness: a historical perspective. M. A. thesis in Mathematics, UC Berkeley, 1997; found at the time of writing in the URL: http://socrates.berkeley.edu/˜manya
8. M Sipser: Borel sets and circuit complexity. 15th ACM Symp. on Theory of Com- puting (1983), 61-69. img width="474" height="73" src="98_files/image001.gif" />