Formation of similarity-reflecting binary vectors with random binary projections
From MaRDI portal
Publication:2515348
DOI10.1007/s10559-015-9723-zzbMath1317.93233OpenAlexW2060982670MaRDI QIDQ2515348
Publication date: 31 July 2015
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-015-9723-z
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Stochastic systems in control theory (general) (93E03)
Related Items (10)
Binary vectors for fast distance and similarity estimation ⋮ Fast similarity search for graphs by edit distance ⋮ Technology of autonomous take-off and landing for the modern flight and navigation complex of an unmanned aerial vehicle ⋮ Estimation of vectors similarity by their randomized binary projections ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Index structures for fast similarity search for real vectors. II ⋮ Index structures for fast similarity search for symbol strings ⋮ A linear system output transformation for sparse approximation ⋮ A Theoretical Perspective on Hyperdimensional Computing
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized projective methods for the construction of binary sparse vector representations
- On the absolute constants in the Berry-Esseen-type inequalities
- On the bound of proximity of the binomial distribution to the normal one
- Vector data transformation using random binary matrices
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- A randomized method for solving discrete ill-posed problems
- Time of searching for similar binary vectors in associative memory
- Properties of a predicate transformer of the VRS system
- A binding procedure for distributed binary data representations
- An improvement of the Berry–Esseen inequality with applications to Poisson and mixed Poisson random sums
- Similarity estimation techniques from rounding algorithms
- Conditional Central Limit Theorem
- Some approaches to analogical mapping with structure-sensitive distributed representations
- Quality and efficiency of retrieval for Willshaw-like autoassociative networks. I. Correction
- Quality and efficiency of retrieval for Willshaw-like autoassociative networks. II. Recognition
- A Refinement of the Remainder in the Lyapunov Theorem
- Representing Objects, Relations, and Sequences
- A Lyapunov-type Bound in Rd
This page was built for publication: Formation of similarity-reflecting binary vectors with random binary projections
