Storing object-dependent sparse codes in a Willshaw associative network
From MaRDI portal
Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Recommendations
- scientific article; zbMATH DE number 1181907
- Storage capacities of sparse associative memories
- Neural associative memory for brain modeling and information retrieval
- Quality and efficiency of retrieval for Willshaw-like autoassociative networks. II. Recognition
- Neural Associative Memory and the Willshaw–Palm Probability Distribution
Cites work
- A logical calculus of the ideas immanent in nervous activity
- Die Lernmatrix
- Efficient Associative Computation with Discrete Synapses
- scientific article; zbMATH DE number 2033162 (Why is no real title available?)
- Information storage in sparsely coded memory nets
- Least squares quantization in PCM
- Memory Capacities for Synaptic and Structural Plasticity
- Neural Associative Memory and the Willshaw–Palm Probability Distribution
- Neural associative memory with optimal Bayesian learning
- On associative memory
- On the storage capacity of an associative memory with randomly distributed storage elements
- The space of interactions in neural network models
Cited in
(4)- Neural Associative Memory and the Willshaw–Palm Probability Distribution
- scientific article; zbMATH DE number 1181907 (Why is no real title available?)
- Iterative retrieval and block coding in autoassociative and heteroassociative memory
- Self-organizing maps on ``what-where codes towards fully unsupervised classification
This page was built for publication: Storing object-dependent sparse codes in a Willshaw associative network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131165)
