Sciweavers

24 search results - page 1 / 5
» Density-Based Indexing for Approximate Nearest-Neighbor Quer...
Sort
View
KDD
1999
ACM
141views Data Mining» more  KDD 1999»
13 years 9 months ago
Density-Based Indexing for Approximate Nearest-Neighbor Queries
Kristin P. Bennett, Usama M. Fayyad, Dan Geiger
EDBT
2006
ACM
154views Database» more  EDBT 2006»
13 years 8 months ago
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
Christoph Brochhaus, Marc Wichterich, Thomas Seidl
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 6 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
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
13 years 10 months ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 5 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis