Back to Search
Start Over
An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs.
- Source :
- PLoS ONE; 1/18/2018, Vol. 13 Issue 1, p1-14, 14p
- Publication Year :
- 2018
-
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, ) 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 achieve the robust performance with better recall compared with “vanilla” , even when using the same amount of space. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 19326203
- Volume :
- 13
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- PLoS ONE
- Publication Type :
- Academic Journal
- Accession number :
- 127396497
- Full Text :
- https://doi.org/10.1371/journal.pone.0191175