Timezone: »

 
Poster
Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions
Parikshit Ram · Dongryeol Lee · Hua Ouyang · Alexander Gray

Mon Dec 07 07:00 PM -- 11:59 PM (PST) @ None #None

The long-standing problem of efficient nearest-neighbor (NN) search has ubiquitous applications ranging from astrophysics to MP3 fingerprinting to bioinformatics to movie recommendations. As the dimensionality of the dataset increases, exact NN search becomes computationally prohibitive; (1+eps)-distance-approximate NN search can provide large speedups but risks losing the meaning of NN search present in the ranks (ordering) of the distances. This paper presents a simple, practical algorithm allowing the user to, for the first time, directly control the true accuracy of NN search (in terms of ranks) while still achieving the large speedups over exact NN. Experiments with high-dimensional datasets show that it often achieves faster and more accurate results than the best-known distance-approximate method, with much more stable behavior.

Author Information

Pari Ram (IBM Research)
Dongryeol Lee (Independent Researcher)
Hua Ouyang
Alexander Gray (Skytree Inc. and Georgia Tech)

More from the Same Authors