Vector data transformation using random binary matrices

DOI10.1007/s10559-014-9687-4zbMath1323.93067OpenAlexW2055037913MaRDI QIDQ891113

N. E. Zubov

Publication date: 16 November 2015

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

Full work available at URL: https://doi.org/10.1007/s10559-014-9687-4

zbMATH Keywords

binary random projectiondimension decreasesimilarity of vectors

Mathematics Subject Classification ID

Linear systems in control theory (93C05) System structure simplification (93B11) Stochastic systems in control theory (general) (93E03)

Related Items (5)

Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection ⋮ Binary random projections with controllable sparsity patterns ⋮ Estimation of vectors similarity by their randomized binary projections ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Formation of similarity-reflecting binary vectors with random binary projections

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Dimension Reduction: A Guided Tour
• 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
• Representing Objects, Relations, and Sequences
• Compressed sensing

This page was built for publication: Vector data transformation using random binary matrices