暂无分享,去创建一个
Mark Herbster | James Townsend | Paul K. Rubenstein | Paul Rubenstein | M. Herbster | James Townsend
[1] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[2] Claudio Gentile,et al. Online Similarity Prediction of Networked Data from Known and Unknown Graphs , 2013, COLT.
[3] S. Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .
[4] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[5] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory A.
[6] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[7] Leslie G. Valiant,et al. A general lower bound on the number of examples needed for learning , 1988, COLT '88.
[8] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .