Estimation of vectors similarity by their randomized binary projections
From MaRDI portal
Publication:904438
DOI10.1007/s10559-015-9774-1zbMath1347.68291OpenAlexW2265170987MaRDI QIDQ904438
Publication date: 13 January 2016
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-015-9774-1
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (1)
Cites Work
- Randomized projective methods for the construction of binary sparse vector representations
- On the absolute constants in the Berry-Esseen-type inequalities
- Vector data transformation using random binary matrices
- Generating symbolic traces in the insertion modeling system
- A randomized method for solving discrete ill-posed problems
- Time of searching for similar binary vectors in associative memory
- Vector representations for efficient comparison and search for similar strings
- Formation of similarity-reflecting binary vectors with random binary projections
- An improvement of the Berry–Esseen inequality with applications to Poisson and mixed Poisson random sums
- Dimension Reduction: A Guided Tour
- Some approaches to analogical mapping with structure-sensitive distributed representations
- Memory Capacities for Synaptic and Structural Plasticity
- Representing Objects, Relations, and Sequences
- Unnamed Item
- Unnamed Item
This page was built for publication: Estimation of vectors similarity by their randomized binary projections