Index structures for fast similarity search for real vectors. II

DOI10.1007/s10559-018-0034-zzbMath1392.68176OpenAlexW2796158081MaRDI QIDQ722065

D. Kharzeev

Publication date: 20 July 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-018-0034-z

zbMATH Keywords

clusteringbranch and bound methodnearest neighborsimilarity searchproximity graphindex structurelocality-sensitive hashingnear neighbortree and forest

Mathematics Subject Classification ID

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

Related Items (2)

Fast similarity search for graphs by edit distance ⋮ Index structures for fast similarity search for symbol strings

Uses Software

• FLANN
• largeVis
• Voronoi
• LargeVis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Refinements to nearest-neighbor searching in k-dimensional trees
• Approximate similarity search: a multi-faceted problem
• Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
• Distance-based index structures for fast similarity search
• Index structures for fast similarity search for real-valued vectors. I
• A randomized approximate nearest neighbors algorithm
• Randomized partition trees for nearest neighbor search
• Binary vectors for fast distance and similarity estimation
• Time of searching for similar binary vectors in associative memory
• Foundations of multidimensional and metric data structures.
• Formation of similarity-reflecting binary vectors with random binary projections
• Randomly-oriented k-d Trees Adapt to Intrinsic Dimension
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• A neural algorithm for a fundamental computing problem
• Quantization
• The priority R-tree

This page was built for publication: Index structures for fast similarity search for real vectors. II