TY - JOUR

T1 - Efficient search for approximate nearest neighbor in high dimensional spaces

AU - Kushilevitz, Eyal

AU - Ostrovsky, Rafail

AU - Rabani, Yuval

PY - 2000

Y1 - 2000

N2 - 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.)

AB - 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.)

KW - Data structures

KW - Nearest neighbor search

KW - Random projections

UR - http://www.scopus.com/inward/record.url?scp=0037492265&partnerID=8YFLogxK

U2 - 10.1137/S0097539798347177

DO - 10.1137/S0097539798347177

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0037492265

SN - 0097-5397

VL - 30

SP - 457

EP - 474

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -