Multi-level Spherical Locality Sensitive Hashing For Approximate Near Neighbors

Abstract

This paper introduces "Multi-Level Spherical LSH": parameter-free, a multi-level, data-dependant Locality Sensitive Hashing data structure for solving the Approximate Near Neighbors Problem (ANN). This data structure uses a modified version of a multi-probe adaptive querying algorithm, with the potential of achieving a \(O(n^p + t)\) query run time, for all inputs n where \(t <= n\).

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keybrooks2017multi

Related papers

• MP-RW-LSH: An Efficient Multi-probe LSH Solution To ANNS In \(L_1\) Distance (2021)0.00
• Experimental Analysis Of Locality Sensitive Hashing Techniques For High-dimensional Approximate Nearest Neighbor Searches (2020)6.34
• DET-LSH: A Locality-sensitive Hashing Scheme With Dynamic Encoding Tree For Approximate Nearest Neighbor Search (2024)9.92
• Fast Locality-sensitive Hashing Frameworks For Approximate Near Neighbor Search (2017)7.81
• PM-LSH: A Fast And Accurate In-memory Framework For High-dimensional Approximate NN And Closest Pair Search (2021)8.09
• Parameter-free Locality Sensitive Hashing For Spherical Range Reporting (2016)9.03
• Hybrid LSH: Faster Near Neighbors Reporting In High-dimensional Space (2016)0.00
• Improving Locality Sensitive Hashing By Efficiently Finding Projected Nearest Neighbors (2020)6.77