Sciweavers

92 search results - page 4 / 19
» Quality and efficiency in high dimensional nearest neighbor ...
Sort
View
140
Voted
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 1 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
15 years 9 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
68
Voted
STOC
1999
ACM
80views Algorithms» more  STOC 1999»
15 years 1 months ago
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
Allan Borodin, Rafail Ostrovsky, Yuval Rabani
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
NIPS
2004
14 years 11 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...