Sciweavers

26 search results - page 1 / 6
» Similarity between Euclidean and cosine angle distance for n...
Sort
View
SAC
2004
ACM
13 years 10 months ago
Similarity between Euclidean and cosine angle distance for nearest neighbor queries
Understanding the relationship among different distance measures is helpful in choosing a proper one for a particular application. In this paper, we compare two commonly used dis...
Gang Qian, Shamik Sural, Yuelong Gu, Sakti Pramani...
ICIP
2002
IEEE
14 years 6 months ago
A comparative analysis of two distance measures in color image databases
Euclidean distance measure has been used in comparing feature vectors of images, while cosine angle distance measure is used in document retrieval. In this paper, we theoretically...
Shamik Sural, Gang Qian, Sakti Pramanik
NIPS
2001
13 years 6 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
ICAPR
2009
Springer
13 years 11 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri
VLSISP
2010
254views more  VLSISP 2010»
13 years 3 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...