1039 search results - page 110 / 208 » Kernels and Regularization on Graphs |
113
click to vote
JCP
2006
15 years 3 months ago
2006
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
109
click to vote
CVPR
2010
IEEE
16 years 2 days ago
2010
IEEE
Learning models for recognizing objects with few or no training examples is important, due to the intrinsic longtailed distribution of objects in the real world. In this paper, we...
MICRO
2000
IEEE
15 years 8 months ago
2000
IEEE
Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data st...
125
click to vote
NIPS
2004
15 years 5 months ago
2004
We describe an algorithm for support vector machines (SVM) that can be parallelized efficiently and scales to very large problems with hundreds of thousands of training vectors. I...
148
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...