Learning by distances
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Leslie G. Valiant,et al. A general lower bound on the number of examples needed for learning , 1988, COLT '88.
[3] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] R. Dudley. A course on empirical processes , 1984 .
[5] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[6] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[7] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[8] Jerome A. Feldman,et al. Learning automata from ordered examples , 1988, COLT 1988.
[9] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[10] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[11] Dana Angluin. Equivalence queries and approximate fingerprints , 1989, COLT '89.
[12] Gyora M. Benedek,et al. A parametrization scheme for classifying models of learnability , 1989, COLT '89.
[13] Tao Jiang,et al. Learning regular languages from counterexamples , 1988, COLT '88.