Why locality sensitive hashing works: a practical perspective

DOI10.1016/J.IPL.2018.03.018MaRDI QIDQ1751421zbMATH OpenOpenAlexWikidataFDO

Authors Kejing Lu, Hongya Wang, Yingyuan Xiao, Hui Song

Publication date 25 May 2018

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2018.03.018

zbMATH Keywords

analysis of variancerandomized algorithmslocality sensitive hashingprobability of collisionrecall rate

Mathematics Subject Classification ID

Randomized algorithms (68W20) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
• Locality-sensitive hashing without false negatives
• Lattice-based locality sensitive hashing is optimal
• CoveringLSH: locality-sensitive hashing without false negatives
• A refined analysis of LSH for well-dispersed data points

Cites work

• scientific article; zbMATH DE number 1559575 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• Locality-sensitive hashing scheme based on \(p\)-stable distributions
• Lower Bounds on Locality Sensitive Hashing

Cited in

(6)

• Sharing hash codes for multiple purposes
• VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
• A refined analysis of LSH for well-dispersed data points
• CoveringLSH: locality-sensitive hashing without false negatives
• ForestDSH: a universal hash design for discrete probability distributions
• On the Distortion of Locality Sensitive Hashing

This page was built for publication: Why locality sensitive hashing works: a practical perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751421)