Publisher
Springer Berlin Heidelberg
Reference5 articles.
1. Lecture Notes in Artificial Intelligence;P. Auer,2004
2. Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36(4), 929–965 (1989)
3. Ehrenfeucht, A., Haussler, D., Kearns, M., Valiant, L.G.: A general lower bound on the number of examples needed for learning. Information and Computation 82, 247–261 (1989)
4. Haussler, D., Littlestone, N., Warmuth, M.K.: Predicting 0,1 functions on randomlydrawn points. Information and Computation 115(2), 284–293 (1994); Was in FOCS88, COLT88, and Univ. of California at Santa Cruz TR UCSC-CRL-90-54
5. Li, Y., Long, P.M., Srinivasan, A.: The one-inclusion grap h algorithm is nearoptimal for the prediction model of learning. Transaction on Information Theory 47(3), 1257–1261 (2002)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献