4591 search results - page 210 / 919 » Learning from Dyadic Data |
188
click to vote
PR
2007
15 years 4 months ago
2007
The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this p...
172
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
The choice of the over-complete dictionary that sparsely represents data is of prime importance for sparse codingbased image super-resolution. Sparse coding is a typical unsupervi...
149
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
By representing images and image prototypes by linear subspaces spanned by "tangent vectors" (derivatives of an image with respect to translation, rotation, etc.), impre...
150
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
147
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
Challenging the implicit reliance on document collections, this paper discusses the pros and cons of using query logs rather than document collections, as self-contained sources o...