Randomized projective methods for the construction of binary sparse vector representations

DOI10.1007/s10559-012-9384-0zbMath1276.68144OpenAlexW2059454430MaRDI QIDQ380676

S. V. Slipchenko, I. S. Misuno, D. A. Rachkovskij

Publication date: 14 November 2013

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-012-9384-0

zbMATH Keywords

random projectionvector representationdistributed representationefficient similarity estimationsparse binary representation

Mathematics Subject Classification ID

Knowledge representation (68T30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (9)

Binary vectors for fast distance and similarity estimation ⋮ Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection ⋮ Estimation of vectors similarity by their randomized binary projections ⋮ Increasing the accuracy of solving discrete ill-posed problems by the random projection method ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ A randomized method for solving discrete ill-posed problems ⋮ Index structures for fast similarity search for real vectors. II ⋮ Formation of similarity-reflecting binary vectors with random binary projections

Cites Work

• Unnamed Item
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Time of searching for similar binary vectors in associative memory
• A binding procedure for distributed binary data representations
• Resolution of binary coding of real-valued vectors by hyperrectangular receiptive fields
• Binding and Normalization of Binary Sparse Distributed Representations by Context-Dependent Thinning
• Extensions of Lipschitz mappings into a Hilbert space
• Similarity estimation techniques from rounding algorithms
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Some approaches to analogical mapping with structure-sensitive distributed representations

This page was built for publication: Randomized projective methods for the construction of binary sparse vector representations