An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs.

ABSTRACT: Many modern applications of AI such as web search, mobile browsing, image processing, and natural language processing rely on finding similar items from a large database of complex objects. Due to the very large scale of data involved (e.g., users' queries from commercial search engines), computing such near or nearest neighbors is a non-trivial task, as the computational cost grows significantly with the number of items. To address this challenge, we adopt Locality Sensitive Hashing (a.k.a, LSH) methods and evaluate four variants in a distributed computing environment (specifically, Hadoop). We identify several optimizations which improve performance, suitable for deployment in very large scale settings. The experimental results demonstrate our variants of LSH achieve the robust performan

SUBMITTER: Cormode G 

PROVIDER: S-EPMC5773183 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature