Author:
Helmbold David,Sloan Robert,Warmuth Manfred K.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference28 articles.
1. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M.K. (1989). Learnability and the Vapnik-Chervonenkis dimension.Journal of the ACM,36, 929?965.
2. Board, R. and Pitt, L. (1990). On the necessity of Occam algorithms.Proceedings of the Twenty-Secnd Annual ACM Symposium on Theory of Computing.
3. Boucheron, S. (1988). Learnability from positive examples in the Valiant framework. Unpublished manuscript.
4. Dudley, R.M. (1984). A course on empirical processes.Lecture Notes in Mathematics No. 1097. New York: Springer-Verlag.
5. Ehrenfeucht, A., Haussler, D., Kearns, M., and Valiant, L. (1989). A general lower bound on the number examples needed for learning.Information and Computation,82, 247?261.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献