57 search results - page 3 / 12 » Low-Rank Similarity Metric Learning in High Dimensions |
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
We present a method for training a similarity metric from data. The method can be used for recognition or verification applications where the number of categories is very large an...
DEXAW
2008
IEEE
14 years 3 months ago
2008
IEEE
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
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...
DEXAW
1999
IEEE
14 years 26 days ago
1999
IEEE
This paper presents two metrics for the Nearest Neighbor Classifier that share the property of being adapted, i.e. learned, on a set of data. Both metrics can be used for similari...
ADC
2003
Springer
14 years 1 months ago
2003
Springer
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...