582 search results - page 52 / 117 » Distance Measures for Well-Distributed Sets |
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Most clustering algorithms operate by optimizing (either implicitly or explicitly) a single measure of cluster solution quality. Such methods may perform well on some data sets bu...
VMV
2008
13 years 10 months ago
2008
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
MICCAI
2009
Springer
14 years 3 months ago
2009
Springer
This paper investigates an approach to model the space of brain images through a low-dimensional manifold. A data driven method to learn a manifold from a collections of brain imag...
SSD
2009
Springer
14 years 3 months ago
2009
Springer
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...