Index structures for fast similarity search for binary vectors
From MaRDI portal
Recommendations
- Index structures for fast similarity search for real vectors. II
- Index structures for fast similarity search for real-valued vectors. I
- Distance-based index structures for fast similarity search
- Index structures for fast similarity search for symbol strings
- Binary vectors for fast distance and similarity estimation
Cites work
- A comparative study of sparse associative memories
- A linear size index for approximate pattern matching
- Approximate nearest neighbor: towards removing the curse of dimensionality
- Binary vectors for fast distance and similarity estimation
- Compressed indexes for approximate string matching
- Dictionary Look-Up with One Error
- Dictionary matching and indexing with errors and don't cares
- Distance-based index structures for fast similarity search
- Foundations of multidimensional and metric data structures.
- Frequent-itemset mining using locality-sensitive hashing
- scientific article; zbMATH DE number 5763313 (Why is no real title available?)
- scientific article; zbMATH DE number 1181907 (Why is no real title available?)
- scientific article; zbMATH DE number 1775418 (Why is no real title available?)
- Improved bounds for dictionary look-up with one error
- Introduction to Information Retrieval
- Linear Quadratic Regulation and Stabilization of Discrete-Time Systems With Delay and Multiplicative Noise
- Locality-sensitive hashing without false negatives
- Long term memory storage capacity of multiconnected neural networks
- LSH Forest: Practical Algorithms Made Theoretical
- Neural networks and physical systems with emergent collective computational abilities
- New directions in nearest neighbor searching with applications to lattice sieving
- On a model of associative memory with huge storage capacity
- On associative memory
- On the capacity of an associative memory model based on neural cliques
- Optimal data-dependent hashing for approximate near neighbors
- Optimal hashing-based time-space trade-offs for approximate near neighbors
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
- Parameter-free locality sensitive hashing for spherical range reporting
- Proximity in the age of distraction: robust approximate nearest neighbor search
- Quality and efficiency of retrieval for Willshaw-like autoassociative networks. I. Correction
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Set similarity search beyond MinHash
- Similarity estimation techniques from rounding algorithms
- Simple, compact and robust approximate string dictionary
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- The capacity of \(q\)-state Potts neural networks with parallel retrieval dynamics
- Time of searching for similar binary vectors in associative memory
- Universal classes of hash functions
Cited in
(15)- Distance-based index structures for fast similarity search
- Index structures for fast similarity search for real-valued vectors. I
- Practical space-efficient index for structural pattern matching
- Fast similarity search for graphs by edit distance
- Index structures for fast similarity search for symbol strings
- Binary vectors for fast distance and similarity estimation
- Time of searching for similar binary vectors in associative memory
- scientific article; zbMATH DE number 1700018 (Why is no real title available?)
- On finding the closest bitwise matches in a fixed set
- scientific article; zbMATH DE number 1163861 (Why is no real title available?)
- Optimal indexes for sparse bit vectors
- Set similarity search beyond MinHash
- Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
- Selecting Sketches for Similarity Search
- Index structures for fast similarity search for real vectors. II
This page was built for publication: Index structures for fast similarity search for binary vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681740)
