5302 search results - page 738 / 1061 » Learning How to Separate |
210
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
153
click to vote
ICAI
2008
15 years 8 months ago
2008
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
192
click to vote
NIPS
2001
15 years 8 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
208
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
This article is inspired by recent psychological studies confirming that a child is not born a blank slate but has important innate capabilities. An important part of the "le...
241
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...