Index structures for fast similarity search for real-valued vectors. I

DOI10.1007/s10559-018-0016-1zbMath1390.68249OpenAlexW2789656094MaRDI QIDQ1745711

Xianqiang Yang

Publication date: 18 April 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0016-1

zbMATH Keywords

nearest neighborsimilarity searchindex structurelocality-sensitive hashingnear neighborlocality-sensitive filtering

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data structures (68P05)

Related Items (3)

Fast similarity search for graphs by edit distance ⋮ Index structures for fast similarity search for real vectors. II ⋮ Index structures for fast similarity search for symbol strings

Uses Software

• HyperLogLog
• FLANN
• Voronoi
• FALCONN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized projective methods for the construction of binary sparse vector representations
• Real-valued embeddings and sketches for fast distance and similarity estimation
• Index structures for fast similarity search for binary vectors
• Point location in arrangements of hyperplanes
• Investigation of accelerated search for close text sequences with the help of vector representations
• Distance-based index structures for fast similarity search
• Binary vectors for fast distance and similarity estimation
• Formation of similarity-reflecting binary vectors with random binary projections
• Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem
• Locality-Sensitive Hashing Without False Negatives for $$l_p$$
• Sketching and Embedding are Equivalent for Norms
• Optimal Data-Dependent Hashing for Approximate Near Neighbors
• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
• Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• LSH-Preserving Functions and Their Applications
• Introduction to Information Retrieval
• Similarity estimation techniques from rounding algorithms
• Entropy based nearest neighbor search in high dimensions
• Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
• New directions in nearest neighbor searching with applications to lattice sieving
• A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
• Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors
• LSH Forest: Practical Algorithms Made Theoretical
• Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
• The Distortion of Locality Sensitive Hashing
• A Refined Analysis of LSH for Well-dispersed Data Points
• Beyond Locality-Sensitive Hashing

This page was built for publication: Index structures for fast similarity search for real-valued vectors. I