Index structures for fast similarity search for real vectors. II
From MaRDI portal
Publication:722065
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.
Cites work
- scientific article; zbMATH DE number 437552 (Why is no real title available?)
- scientific article; zbMATH DE number 3653523 (Why is no real title available?)
- scientific article; zbMATH DE number 1445324 (Why is no real title available?)
- scientific article; zbMATH DE number 5485566 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- A neural algorithm for a fundamental computing problem
- A randomized approximate nearest neighbors algorithm
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Approximate nearest neighbor: towards removing the curse of dimensionality
- Approximate similarity search: a multi-faceted problem
- Binary vectors for fast distance and similarity estimation
- Distance-based index structures for fast similarity search
- Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
- Formation of similarity-reflecting binary vectors with random binary projections
- Foundations of multidimensional and metric data structures.
- Index structures for fast similarity search for binary vectors
- Index structures for fast similarity search for real-valued vectors. I
- Learning multi-modal similarity
- Quantization
- Randomized partition trees for nearest neighbor search
- Randomized projective methods for the construction of binary sparse vector representations
- Randomly-oriented \(k\)-\(d\) trees adapt to intrinsic dimension
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Refinements to nearest-neighbor searching in k-dimensional trees
- The priority R-tree: a practically efficient and worst-case optimal R-tree
- Time of searching for similar binary vectors in associative memory
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
Cited in
(15)- Distance-based index structures for fast similarity search
- Index structures for fast similarity search for symbol strings
- Investigation of accelerated search for close text sequences with the help of vector representations
- Using non-zero dimensions for the cosine and Tanimoto similarity search among real valued vectors
- scientific article; zbMATH DE number 2017856 (Why is no real title available?)
- A new efficient indexing algorithm for one-dimensional real scaled patterns
- Index Vector Elimination – Making Index Vectors Affordable
- Index structures for fast similarity search for binary vectors
- scientific article; zbMATH DE number 2113980 (Why is no real title available?)
- Fast similarity search for graphs by edit distance
- Indexing schemes for similarity search: an illustrated paradigm
- scientific article; zbMATH DE number 2066190 (Why is no real title available?)
- Approximate similarity search: a multi-faceted problem
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Similarity search. The metric space approach.
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)
