Sciweavers

51 search results - page 5 / 11
» A Cost Model For Nearest Neighbor Search in High-Dimensional...
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 6 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
SAC
2004
ACM
14 years 3 days 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...
SPIRE
2005
Springer
14 years 5 days ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 11 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 6 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu