论文信息 - Results on learnability and the Vapnick-Chervonenkis dimension - 字舞流文

Results on learnability and the Vapnick-Chervonenkis dimension

Nathan Linial | Ronald L. Rivest | Yishay Mansour | Y. Mansour | R. Rivest | N. Linial

[1] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[2] Ronald L. Rivest,et al. Inferring Decision Trees Using the Minimum Description Length Principle , 1989, Inf. Comput..

[3] David Haussler,et al. Equivalence of models for polynomial learnability , 1988, COLT '88.

[4] Leslie G. Valiant,et al. A general lower bound on the number of examples needed for learning , 1988, COLT '88.

[5] Uzi Vishkin,et al. On Finding a Minimum Dominating Set in a Tournament , 1988, Theor. Comput. Sci..

[6] Alon Itai,et al. Nonuniform Learnability , 1988, J. Comput. Syst. Sci..

[7] Leslie G. Valiant,et al. On the learnability of Boolean formulae , 1987, STOC.

[8] M. Kearns,et al. Recent Results on Boolean Concept Learning , 1987 .

[9] David Haussler,et al. Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.

[10] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.

[11] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..

[12] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[13] J. Lamperti. ON CONVERGENCE OF STOCHASTIC PROCESSES , 1962 .