Index structures for fast similarity search for real vectors. II

DOI10.1007/S10559-018-0034-ZzbMATH Open1392.68176OpenAlexW2796158081MaRDI QIDQ722065FDOQ722065

Authors: 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

Recommendations

• Index structures for fast similarity search for real-valued vectors. I
• Index structures for fast similarity search for binary vectors
• Distance-based index structures for fast similarity search
• Index structures for fast similarity search for symbol strings
• Similarity search. The metric space approach.

zbMATH Keywords

clusteringnearest neighborsimilarity searchbranch and bound methodproximity graphindex structurelocality-sensitive hashingnear neighbortree and forest

Mathematics Subject Classification ID

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

Cites Work

• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Title not available (Why is that?)
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Approximate similarity search: a multi-faceted problem
• Title not available (Why is that?)
• Foundations of multidimensional and metric data structures.
• Quantization
• Title not available (Why is that?)
• Approximate nearest neighbor: towards removing the curse of dimensionality
• Randomized projective methods for the construction of binary sparse vector representations
• Time of searching for similar binary vectors in associative memory
• A randomized approximate nearest neighbors algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Index structures for fast similarity search for binary vectors
• Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
• Refinements to nearest-neighbor searching in k-dimensional trees
• Binary vectors for fast distance and similarity estimation
• Formation of similarity-reflecting binary vectors with random binary projections
• Real-valued embeddings and sketches for fast distance and similarity estimation
• The priority R-tree
• 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
• Randomized partition trees for nearest neighbor search
• Randomly-oriented k-d Trees Adapt to Intrinsic Dimension
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• A neural algorithm for a fundamental computing problem
• Title not available (Why is that?)

Cited In (11)

• A new efficient indexing algorithm for one-dimensional real scaled patterns
• Approximate similarity search: a multi-faceted problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Investigation of accelerated search for close text sequences with the help of vector representations
• Indexing schemes for similarity search: an illustrated paradigm
• Index structures for fast similarity search for symbol strings
• Fast similarity search for graphs by edit distance
• Similarity search. The metric space approach.
• Index Vector Elimination – Making Index Vectors Affordable

Uses Software

• FLANN
• largeVis
• Voronoi
• LargeVis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722065)