Sparse distributed memory using N-of-M codes

DOI10.1016/J.NEUNET.2004.07.003zbMATH Open1090.68085OpenAlexW1988238855WikidataQ51984322 ScholiaQ51984322MaRDI QIDQ705592FDOQ705592

Authors: Steve B. Furber, W. John Bainbridge, J. Mike Cumpstey, Steve Temple 

Publication date: 31 January 2005

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2004.07.003

Recommendations

• Integer sparse distributed memory: analysis and results
• KANERVA’S SPARSE DISTRIBUTED MEMORY: AN ASSOCIATIVE MEMORY ALGORITHM WELL-SUITED TO THE CONNECTION MACHINE
• scientific article; zbMATH DE number 42973
• Sparse associative memory
• Notions of associative memory and sparse coding

zbMATH Keywords

Neural networks\(N\)-of-\(M\) codesAssociative memoryCorrelation matrix memorySparse distributed memorySpiking neuronsUnipolar weights

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states
• Correlation Matrix Memories
• Information storage in sparsely coded memory nets
• Delay-insensitive codes - an overview

Cited In (6)

• Increasing the semantic storage density of sparse distributed memory
• Binding and normalization of binary sparse distributed representations by context-dependent thinning
• Machine Learning: ECML 2004
• Integer sparse distributed memory: analysis and results
• Title not available (Why is that?)
• Fast retraining from SDM

This page was built for publication: Sparse distributed memory using \(N\)-of-\(M\) codes

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