Efficient search for approximate nearest neighbor in high dimensional spaces

Eyal Kushilevitz*, Rafail Ostrovsky, Yuval Rabani

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

154 Scopus citations

Abstract

We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vectors in some high dimensional Euclidean space, we want to construct a space-efficient data structure that would allow us to search, given a query vector, for the closest or nearly closest vector in the database. We also address this problem when distances are measured by the L1 norm, and in the Hamming cube. Significantly improving and extending recent results of Kleinberg, we construct data structures whose size is polynomial in the size of the database, and search algorithms that run in time nearly linear or nearly quadratic in the dimension (depending on the case; the extra factors are polylogarithmic in the size of the database).

Original languageAmerican English
Pages (from-to)614-623
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA
Duration: 23 May 199826 May 1998

Fingerprint

Dive into the research topics of 'Efficient search for approximate nearest neighbor in high dimensional spaces'. Together they form a unique fingerprint.

Cite this