Author:
Köbler Johannes,Lindner Wolfgang
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. H. Aizenstein, T. Hegedüs, L. Hellerstein, and L. Pitt. Complexity theoretic hardness results for query learning. Computational Complexity, 7:19–53, 1998.
2. D. Angluin. Queries and concept learning. Machine Learning, 2:319–342, 1988.
3. D. Angluin and M. Kharitonov. When won’t membership queries help? Journal of Computer and System Sciences, 50:336–355, 1995.
4. J. Balcázar, J. Castro, and D. Guijarro. Abstract combinatorial characterizations of exact learning via queries. In Proc. 13th ACM Conference on Computational Learning Theory, pages 248–254. Morgan Kaufmann, 2000.
5. J. Balcázar, J. Castro, and D. Guijarro. A general dimension for exact learning. In Proc. 14th ACM Conference on Computational Learning Theory, volume 2111 of Lecture Notes in Artificial Intelligence, pages 354–367. Springer-Verlag, Berlin Heidelberg New York, 2001.