Sciweavers

51 search results - page 6 / 11
» On learning with kernels for unordered pairs
Sort
View
ICML
2004
IEEE
14 years 9 months ago
Online and batch learning of pseudo-metrics
We describe and analyze an online algorithm for supervised learning of pseudo-metrics. The algorithm receives pairs of instances and predicts their similarity according to a pseud...
Shai Shalev-Shwartz, Yoram Singer, Andrew Y. Ng
SIGIR
2004
ACM
14 years 2 months ago
A joint framework for collaborative and content filtering
This paper proposes a novel, unified, and systematic approach to combine collaborative and content-based filtering for ranking and user preference prediction. The framework inco...
Justin Basilico, Thomas Hofmann
BIOINFORMATICS
2005
140views more  BIOINFORMATICS 2005»
13 years 8 months ago
Profile-based direct kernels for remote homology detection and fold recognition
Motivation: Remote homology detection between protein sequences is a central problem in computational biology. Supervised learning algorithms based on support vector machines are ...
Huzefa Rangwala, George Karypis
CVPR
2003
IEEE
14 years 10 months ago
Kernel Principal Angles for Classification Machines with Applications to Image Sequence Interpretation
We consider the problem of learning with instances defined over a space of sets of vectors. We derive a new positive definite kernel f(A B) defined over pairs of matrices A B base...
Lior Wolf, Amnon Shashua
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer