Optimal learning rules for familiarity detection
From MaRDI portal
Publication:2376399
DOI10.1007/s00422-008-0275-4zbMath1266.92025WikidataQ51863419 ScholiaQ51863419MaRDI QIDQ2376399
David C. Sterratt, David I. Donaldson, Andrea Greve, D. J. Willshaw, Mark C. W. Van Rossum
Publication date: 21 June 2013
Published in: Biological Cybernetics (Search for Journal in Brave)
Full work available at URL: http://dspace.stir.ac.uk/bitstream/1893/1411/1/Donaldson1.pdf
92C20: Neural biology
91E40: Memory and learning in psychology
92-08: Computational methods for problems pertaining to biology
92C42: Systems biology, networks
Related Items
Dynamics and Robustness of Familiarity Memory, Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory
Cites Work
- Optimising synaptic learning rules in linear associative memories
- Modeling Brain Function
- Information storage in sparsely coded memory nets
- Storage capacity of neural networks: effect of the fluctuations of the number of active neurons per memory
- Neural networks and physical systems with emergent collective computational abilities.