591 search results - page 15 / 119 » An Efficient Algorithm for Local Distance Metric Learning |
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
95
Voted
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper addresses the problem of clustering images of objects seen from different viewpoints. That is, given an unlabelled set of images of n objects, we seek an unsup...
SIAMSC
2008
14 years 9 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
DAGM
2007
Springer
15 years 3 months ago
2007
Springer
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...