Sciweavers

39 search results - page 2 / 8
» Large scale metric learning from equivalence constraints
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 5 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
ICDM
2008
IEEE
156views Data Mining» more  ICDM 2008»
13 years 12 months ago
Exploiting Local and Global Invariants for the Management of Large Scale Information Systems
This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. I...
Haifeng Chen, Haibin Cheng, Guofei Jiang, Kenji Yo...
ICML
2008
IEEE
14 years 6 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
ICCV
2009
IEEE
14 years 10 months ago
Is that you? Metric Learning Approaches for Face Identification
Face identification is the problem of determining whether two face images depict the same person or not. This is difficult due to variations in scale, pose, lighting, background...
Matthieu Guillaumin, Jakob Verbeek, Cordelia Schmi...
CVPR
2004
IEEE
14 years 7 months ago
Learning Distance Functions for Image Retrieval
Image retrieval critically relies on the distance function used to compare a query image to images in the database. We suggest to learn such distance functions by training binary ...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall