PAC Learning Axis-Aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples
暂无分享,去创建一个
[1] D. Pollard. Convergence of stochastic processes , 1984 .
[2] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[3] Leslie G. Valiant,et al. Computational limitations on learning from examples , 1988, JACM.
[4] Leslie G. Valiant,et al. A general lower bound on the number of examples needed for learning , 1988, COLT '88.
[5] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[6] Philip M. Long,et al. Composite geometric concepts and polynomial predictability , 1990, COLT '90.
[7] Robert E. Schapire,et al. Efficient distribution-free learning of probabilistic concepts , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[8] Kenji Yamanishi,et al. A learning criterion for stochastic rules , 1990, COLT '90.
[9] Thomas G. Dietterich,et al. Solving the Multiple Instance Problem with Axis-Parallel Rectangles , 1997, Artif. Intell..
[10] Aravind Srinivasan,et al. Approximating hyper-rectangles: learning and pseudo-random sets , 1997, STOC '97.