Fast retraining from SDM

DOI10.1007/BF02835851MaRDI QIDQ1570265zbMATH OpenOpenAlexFDO

Authors I. N. Pshonkovskaya, S. V. Zaytseva, V. G. Tul'chinskij

Publication date 9 July 2000

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

Full work available at URL https://doi.org/10.1007/bf02835851

zbMATH Keywords

Kanerva's sparse distributed memory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

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

Cited in

(1)

• Increasing the semantic storage density of sparse distributed memory

This page was built for publication: Fast retraining from SDM

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