Fast locality-sensitive hashing
KDD, pp. 1073-1081, 2011.
widely-used euclidean realizationtime improvementnew lshd-dimensional vectoreuclidean distanceMore(11+)
Locality-sensitive hashing (LSH) is a basic primitive in several large-scale data processing applications, including nearest-neighbor search, de-duplication, clustering, etc. In this paper we propose a new and simple method to speed up the widely-used Euclidean realization of LSH. At the heart of our method is a fast way to estimate the E...More
PPT (Upload PPT)