A Result of Vapnik with Applications
暂无分享,去创建一个
[1] Norman Biggs,et al. Combinatorics and connectionism , 1994, Discret. Math..
[2] John Shawe-Taylor,et al. Bounding Sample Size with the Vapnik-Chervonenkis Dimension , 1993, Discrete Applied Mathematics.
[3] David Haussler,et al. Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications , 1992, Inf. Comput..
[4] M. Anthony. Uniform convergence and learnability. , 1991 .
[5] John Shawe-Taylor,et al. The learnability of formal concepts , 1990, COLT '90.
[6] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[7] David Haussler,et al. What Size Net Gives Valid Generalization? , 1989, Neural Computation.
[8] David Haussler,et al. Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework , 1988, Artif. Intell..
[9] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[10] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory A.
[11] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[12] J. Lamperti. ON CONVERGENCE OF STOCHASTIC PROCESSES , 1962 .