Sciweavers

31 search results - page 2 / 7
» Semi-Supervised Distance Metric Learning by Quadratic Progra...
Sort
View
KDD
2006
ACM
180views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning the unified kernel machines for classification
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel ...
Steven C. H. Hoi, Michael R. Lyu, Edward Y. Chang
ICML
2006
IEEE
14 years 7 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
JMLR
2012
11 years 9 months ago
Distance Metric Learning with Eigenvalue Optimization
The main theme of this paper is to develop a novel eigenvalue optimization framework for learning a Mahalanobis metric. Within this context, we introduce a novel metric learning a...
Yiming Ying, Peng Li
ICML
2008
IEEE
14 years 7 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul