Predicting {0,1}-functions on randomly drawn points
暂无分享,去创建一个
[1] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory, Ser. A.
[2] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[3] David Haussler,et al. Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.
[4] Leslie G. Valiant,et al. On the learnability of Boolean formulae , 1987, STOC.
[5] David Haussler,et al. Occam's Razor , 1987, Inf. Process. Lett..
[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] Noga Alon,et al. Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension , 1987, SCG '87.
[8] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[9] Leonard Pitt,et al. Reductions among prediction problems: on the difficulty of predicting automata , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[10] David Haussler,et al. Learning decision trees from random examples , 1988, COLT '88.
[11] Leonidas J. Guibas,et al. Implicitly representing arrangements of lines or segments , 2011, SCG '88.