Fast similarity search for learned metrics

We introduce a method that enables scalable similarity search for learned metrics. Given pairwise similarity and dissimilarity constraints between some examples, we learn a Mahalanobis distance function that captures the examples' underlying relationships well. To allow sublinear time similarit...

Description complète

Détails bibliographiques
Publié dans:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 31(2009), 12 vom: 20. Dez., Seite 2143-57
Auteur principal: Kulis, Brian (Auteur)
Autres auteurs: Jain, Prateek, Grauman, Kristen
Format: Article en ligne
Langue:English
Publié: 2009
Accès à la collection:IEEE transactions on pattern analysis and machine intelligence
Sujets:Journal Article Research Support, Non-U.S. Gov't Research Support, U.S. Gov't, Non-P.H.S.