Sciweavers

76 search results - page 6 / 16
» On Index-Free Similarity Search in Metric Spaces
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 9 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
DATESO
2010
153views Database» more  DATESO 2010»
13 years 5 months ago
Answering Metric Skyline Queries by PM-tree
Abstract. The task of similarity search in multimedia databases is usually accomplished by range or k nearest neighbor queries. However, the expressing power of these "single-...
Tomás Skopal, Jakub Lokoc
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 11 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
SISAP
2008
IEEE
147views Data Mining» more  SISAP 2008»
14 years 2 months ago
An Empirical Evaluation of a Distributed Clustering-Based Index for Metric Space Databases
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
Veronica Gil Costa, Mauricio Marín, Nora Re...