Efficient retrieval from sparse associative memory

DOI10.1016/0004-3702(94)90032-9MaRDI QIDQ1327170zbMATH OpenOpenAlexFDO

Authors Ronald L. Greene

Publication date 15 June 1994

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(94)90032-9

zbMATH Keywords

best-match retrieval of dataconnectionist-hashed associative memory

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• KANERVA’S SPARSE DISTRIBUTED MEMORY: AN ASSOCIATIVE MEMORY ALGORITHM WELL-SUITED TO THE CONNECTION MACHINE
• Storage capacities of sparse associative memories
• Corrective memory by a symmetric sparsely encoded network
• Robust dictionary lookup using associative networks
• Internal representations for associative memory

Cites work

• Content-addressable memories. 2nd ed
• scientific article; zbMATH DE number 4078838 (Why is no real title available?)
• scientific article; zbMATH DE number 42973 (Why is no real title available?)
• Neural networks and physical systems with emergent collective computational abilities

Cited in

(8)

• Effective use of memory in iterative deepening search
• Fast retraining from SDM
• A comparison of a novel neural spell checker and standard spell checking algorithms
• Associative isolation: Unifying associative and list memory
• Concordances in long character chains
• Robust dictionary lookup using associative networks
• Approximate spreading activation for efficient knowledge retrieval from large datasets
• Fast Access to Concepts in Concept Lattices via Bidirectional Associative Memories

This page was built for publication: Efficient retrieval from sparse associative memory

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