Sciweavers

518 search results - page 57 / 104
» Object correspondence as a machine learning problem
Sort
View
IJON
2006
109views more  IJON 2006»
15 years 1 months ago
Associative memory of connectivity patterns
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
Junmei Zhu, Christoph von der Malsburg
PAMI
2010
192views more  PAMI 2010»
15 years 11 days ago
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
—A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual lea...
Carlos Alzate, Johan A. K. Suykens
NIPS
2001
15 years 3 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
COLT
2005
Springer
15 years 7 months ago
On Spectral Learning of Mixtures of Distributions
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
Dimitris Achlioptas, Frank McSherry
ICDM
2009
IEEE
154views Data Mining» more  ICDM 2009»
14 years 11 months ago
GSML: A Unified Framework for Sparse Metric Learning
There has been significant recent interest in sparse metric learning (SML) in which we simultaneously learn both a good distance metric and a low-dimensional representation. Unfor...
Kaizhu Huang, Yiming Ying, Colin Campbell