Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)

@inproceedings{Yianilos1999LocallyLT,
  title={Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)},
  author={Peter N. Yianilos},
  booktitle={SODA},
  year={1999}
}
A b s t r a c t We consider the problem of nearest neighbor search in the Euclidean hypercube [ -1 ,+1 ] d with uniform distributions, and the additional natural assumption that the nearest neighbor is located within a constant fraction R of the maximum interpoint distance in this space, i.e. within distance 2 R v ~ of the query. We introduce the idea of aggressive pruning and give a family of practical algorithms, an idealized analysis, and describe experiments. Our main result is that search… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 31 CITATIONS

Anytime k-nearest neighbor search for database applications

  • 2008 IEEE 24th International Conference on Data Engineering Workshop
  • 2008
VIEW 6 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Clustering Evaluation in High-Dimensional Data

  • EDML@SDM
  • 2016
VIEW 2 EXCERPTS
CITES BACKGROUND

Approximate Nearest Subspace Search

  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2011
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.

Multidimensional Divide-and-Conquer

  • Commun. ACM
  • 1980
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL