260 search results - page 8 / 52 » An Adaptive Index Structure for High-Dimensional Similarity ... |
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
DAWAK
2001
Springer
15 years 2 months ago
2001
Springer
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
119
click to vote
JIIS
2002
14 years 9 months ago
2002
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
87
Voted
IJCSA
2006
14 years 9 months ago
2006
Approaches to indexing and searching feature vectors are an indispensable factor to support similarity search effectively and efficiently. Such feature vectors extracted from real...
WEBI
2009
Springer
15 years 4 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...