Author:
Denis François,Gilleron Rémi
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. D. Angluin, Learning regular sets from Queries and Counterexamples, Inform. and Computation 75 (1987) 87–106.
2. D. Angluin, Queries and Concept Learning, Machine Learning 2 (1988) 319–342.
3. G. Benedek and A. Itai, Learnability by fixed distribution, Proc. 1st ACM Workshop on Computational Learning Theory, (1988) 80–90.
4. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Occam's razor, Inform. Proc. Lett. 24 (1987) 377–380.
5. R. Board and L. Pitt, On the necessity of Occam algorithms, Proc. 22th ACM Symposium on Theory of Computing, (1990) 54–63.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献