Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
From MaRDI portal
Publication:3603512
DOI10.1007/978-3-540-73951-7_4zbMATH Open1209.68164OpenAlexW1898304433MaRDI QIDQ3603512FDOQ3603512
Authors: Kengo Terasawa, Yuzuru Tanaka 
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10445/3004
Recommendations
- Hypercube LSH for approximate near neighbors
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Parameter-free locality sensitive hashing for spherical range reporting
- Approximate nearest neighbor search in high dimensions
- scientific article; zbMATH DE number 6783438
- Approximate nearest neighbor search for low-dimensional queries
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- scientific article; zbMATH DE number 1775451
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (10)
- Lattice Sieving via Quantum Random Walks
- Fast cross-polytope locality-sensitive hashing
- Hypercube LSH for approximate near neighbors
- Local Density Estimation in High Dimensions
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
- Index structures for fast similarity search for real-valued vectors. I
- Graph-based time-space trade-offs for approximate near neighbors
- Lattice-based locality sensitive hashing is optimal
- Lower bounds on lattice sieving and information set decoding
- Title not available (Why is that?)
This page was built for publication: Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603512)
