26 search results - page 5 / 6 » Similarity between Euclidean and cosine angle distance for n... |
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
Conventional approaches to similarity search and case-based retrieval, such as nearest neighbor search, require the specification of a global similarity measure which is typically ...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
ICDE
1999
IEEE
14 years 8 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...