Learning Functions from Examples
暂无分享,去创建一个
[1] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[2] Jerome A. Feldman,et al. On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.
[3] Alan W. Biermann,et al. On the Inference of Turing Machines from Sample Computations , 1972, Artif. Intell..
[4] E. Mark Gold,et al. Complexity of Automaton Identification from Given Data , 1978, Inf. Control..
[5] DANA ANGLUIN,et al. On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..
[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[7] Juris Hartmanis,et al. Generalized Kolmogorov complexity and the structure of feasible computations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[9] B. K. Natarajan. The Homogenous Capture of Random Strings , 1985 .
[10] David Haussler,et al. Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.
[11] 이종원,et al. Explanation - Based Generalization 의 문제점 및 이의 해결방안 , 1986 .
[12] José L. Balcázar,et al. On Generalized Kolmogorov Complexity , 1986, STACS.
[13] Balas K. Natarajan,et al. On learning Boolean functions , 1987, STOC.