3718 search results - page 206 / 744 » On learning with dissimilarity functions |
164
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
165
click to vote
PKDD
2009
Springer
16 years 21 days ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
170
Voted
AI
2008
Springer
15 years 6 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
151
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
153
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...