Why locality sensitive hashing works: A practical perspective
Authors:
- Kejing LuKLKejing Lu
- Hongya WangHWHongya Wang
- Yingyuan XiaoYXYingyuan Xiao
- Hui SongHSHui Song
- 1 August 2018
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 136, 49-58
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61370205, 91646117)
- NSF of Shanghai (13ZR1400800)
- Science Foundation of Tianjin (17JCYBJC15200)
- Tianjin Science and Technology Correspondent Project (16JCTPJC53600)
- Fundamental Research Funds for the Central Universities
This publication has 5 references indexed in Scilit:
- Streaming similarity search over one billion tweets using parallel locality-sensitive hashingProceedings of the VLDB Endowment, 2013
- Bayesian locality sensitive hashing for fast similarity searchProceedings of the VLDB Endowment, 2012
- Similarity join size estimation using locality sensitive hashingProceedings of the VLDB Endowment, 2011
- Lower Bounds on Locality Sensitive HashingSIAM Journal on Discrete Mathematics, 2008
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensionsCommunications of the ACM, 2008