Local Density Estimation in High Dimensions
From MaRDI portal
Recommendations
- A locality-sensitive hash for real vectors
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Parameter-free locality sensitive hashing for spherical range reporting
- Why locality sensitive hashing works: a practical perspective
- Binary vectors for fast distance and similarity estimation
Cites work
- A unified approach to approximate proximity searching
- Entropy based nearest neighbor search in high dimensions
- scientific article; zbMATH DE number 5506204 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Locality-sensitive hashing scheme based on p-stable distributions
- Optimal data-dependent hashing for approximate near neighbors
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
- Parameter-free locality sensitive hashing for spherical range reporting
- Similarity estimation techniques from rounding algorithms
- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
This page was built for publication: Local Density Estimation in High Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870349)