Formation of similarity-reflecting binary vectors with random binary projections
From MaRDI portal
Recommendations
- Estimation of vectors similarity by their randomized binary projections
- Randomized projective methods for the construction of binary sparse vector representations
- Binary vectors for fast distance and similarity estimation
- Binary random projections with controllable sparsity patterns
- Approximation of projections of random vectors
- Random Projection Trees for Vector Quantization
- Note on large subsets of binary vectors with similar distances
- On stochastic comparison of random vectors
Cites work
- A binding procedure for distributed binary data representations
- A Lyapunov-type Bound in Rd
- A randomized method for solving discrete ill-posed problems
- A refinement of the remainder in the Lyapunov theorem
- An improvement of the Berry-Esseen inequality with applications to Poisson and mixed Poisson random sums
- Conditional central limit theorem
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- scientific article; zbMATH DE number 3128684 (Why is no real title available?)
- scientific article; zbMATH DE number 3043546 (Why is no real title available?)
- On the absolute constants in the Berry-Esseen-type inequalities
- On the bound of proximity of the binomial distribution to the normal one
- Properties of a predicate transformer of the VRS system
- Quality and efficiency of retrieval for Willshaw-like autoassociative networks. I. Correction
- Quality and efficiency of retrieval for Willshaw-like autoassociative networks. II. Recognition
- Randomized projective methods for the construction of binary sparse vector representations
- Representing objects, relations, and sequences
- Similarity estimation techniques from rounding algorithms
- Some approaches to analogical mapping with structure-sensitive distributed representations
- Time of searching for similar binary vectors in associative memory
- Vector data transformation using random binary matrices
Cited in
(15)- Index structures for fast similarity search for real-valued vectors. I
- Fast binary embeddings with Gaussian circulant matrices: improved bounds
- A linear system output transformation for sparse approximation
- 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
- Technology of autonomous take-off and landing for the modern flight and navigation complex of an unmanned aerial vehicle
- Randomized projective methods for the construction of binary sparse vector representations
- On binary embedding using circulant matrices
- Simple classification using binary data
- A theoretical perspective on hyperdimensional computing
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Index structures for fast similarity search for real vectors. II
- Vector data transformation using random binary matrices
- Estimation of vectors similarity by their randomized binary projections
This page was built for publication: Formation of similarity-reflecting binary vectors with random binary projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515348)
