Randomized projective methods for the construction of binary sparse vector representations

DOI10.1007/S10559-012-9384-0MaRDI QIDQ380676zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Vector data transformation using random binary matrices
• Estimation of vectors similarity by their randomized binary projections
• Binary random projections with controllable sparsity patterns
• Formation of similarity-reflecting binary vectors with random binary projections
• Binary vectors for fast distance and similarity estimation

Cites work

• scientific article; zbMATH DE number 2109363 (Why is no real title available?)
• A binding procedure for distributed binary data representations
• Binding and normalization of binary sparse distributed representations by context-dependent thinning
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Extensions of Lipschitz mappings into a Hilbert space
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Resolution of binary coding of real-valued vectors by hyperrectangular receiptive fields
• 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

Cited in

(12)

• Index structures for fast similarity search for real vectors. II
• Binary vectors for fast distance and similarity estimation
• Formation of similarity-reflecting binary vectors with random binary projections
• Index structures for fast similarity search for real-valued vectors. I
• Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection
• A randomized method for solving discrete ill-posed problems
• Estimation of vectors similarity by their randomized binary projections
• Vector data transformation using random binary matrices
• Binary random projections with controllable sparsity patterns
• Bioinspired Random Projections for Robust, Sparse Classification
• Real-valued embeddings and sketches for fast distance and similarity estimation
• Increasing the accuracy of solving discrete ill-posed problems by the random projection method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q380676)