Index structures for fast similarity search for binary vectors
From MaRDI portal
Publication:681740
DOI10.1007/s10559-017-9983-xzbMath1392.68174OpenAlexW2757454057MaRDI QIDQ681740
Publication date: 13 February 2018
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-017-9983-x
Hamming distanceneighborhood graphnearest neighborsimilarity searchindex structurelocality-sensitive hashingmulti-index hashingnear neighborneural autoassociative memorytree structure
Related Items (4)
Fast similarity search for graphs by edit distance ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Index structures for fast similarity search for real vectors. II ⋮ Index structures for fast similarity search for symbol strings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for dictionary look-up with one error
- A comparative study of sparse associative memories
- Simple, compact and robust approximate string dictionary
- Real-valued embeddings and sketches for fast distance and similarity estimation
- A linear size index for approximate pattern matching
- On the capacity of an associative memory model based on neural cliques
- Long term memory storage capacity of multiconnected neural networks
- On associative memory
- Universal classes of hash functions
- Distance-based index structures for fast similarity search
- Binary vectors for fast distance and similarity estimation
- Time of searching for similar binary vectors in associative memory
- On a model of associative memory with huge storage capacity
- The capacity of \(q\)-state Potts neural networks with parallel retrieval dynamics
- Foundations of multidimensional and metric data structures.
- Frequent-Itemset Mining Using Locality-Sensitive Hashing
- Optimal Data-Dependent Hashing for Approximate Near Neighbors
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
- Linear Quadratic Regulation and Stabilization of Discrete-Time Systems With Delay and Multiplicative Noise
- Introduction to Information Retrieval
- Similarity estimation techniques from rounding algorithms
- Dictionary matching and indexing with errors and don't cares
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Dictionary Look-Up with One Error
- Locality-sensitive Hashing without False Negatives
- New directions in nearest neighbor searching with applications to lattice sieving
- Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search
- 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
- Quality and efficiency of retrieval for Willshaw-like autoassociative networks. I. Correction
- Set similarity search beyond MinHash
- Neural networks and physical systems with emergent collective computational abilities.
- Compressed indexes for approximate string matching
This page was built for publication: Index structures for fast similarity search for binary vectors
