Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference10 articles.
1. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1986). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (pp. 273?282). Berkeley, CA.
2. Blumer, A., Ehrenfeucht, A., Haussler, D. & Warmuth, M. K. (1987). Occam's Razor. Information Processing Letters, 24, 377?380.
3. Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987). On the learnability of Boolean formulae. Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (pp. 285?295). New York, NY.
4. Masek, W. (1976). Some NP-complete set-covering problems. Unpublished manuscript, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
5. Pearl, J. (1978). On the connection between the complexity and credibility of inferred models. Journal of General Systems, 4, 255?264.
Cited by
242 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献