Increasing the semantic storage density of sparse distributed memory

DOI10.1007/S10559-022-00465-YOpenAlexW4294307921MaRDI QIDQ2103732FDOQ2103732

Authors: R. Vdovychenko, V. G. Tul'chinskij 

Publication date: 9 December 2022

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

Full work available at URL: https://doi.org/10.1007/s10559-022-00465-y

Recommendations

• Integer sparse distributed memory: analysis and results
• Sparse distributed memory using \(N\)-of-\(M\) codes
• KANERVA’S SPARSE DISTRIBUTED MEMORY: AN ASSOCIATIVE MEMORY ALGORITHM WELL-SUITED TO THE CONNECTION MACHINE
• scientific article; zbMATH DE number 42973
• Fast retraining from SDM

zbMATH Keywords

neural networksGPUassociative memorycompressive sensing (CS)binary sparse distributed representationssparse distributed memory (SDM)

Mathematics Subject Classification ID

Theory of data (68Pxx) Artificial intelligence (68Txx) Mathematical biology in general (92Bxx)

Cites Work

• Title not available (Why is that?)
• Matching pursuits with time-frequency dictionaries
• Stable signal recovery from incomplete and inaccurate measurements
• A simple proof of the restricted isometry property for random matrices
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Neural networks and physical systems with emergent collective computational abilities
• Title not available (Why is that?)
• Binding and normalization of binary sparse distributed representations by context-dependent thinning
• Tensor product variable binding and the representation of symbolic structures in connectionist systems
• Title not available (Why is that?)

Uses Software

• SciPy
• CoSaMP
• Python
• GitHub

This page was built for publication: Increasing the semantic storage density of sparse distributed memory

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