An Investigation of Practical Approximate Nearest Neighbor Algorithms

Abstract

1 Introduction The k-nearest-neighbor searching problem is to find the k nearest points in a dataset X aeRD containing n points to a query point