We present a new associative memory model based on the Hamming memory, but where the winner-take-all network part is replaced by a layer of nodes with somewhat complex node functions. This new memory can produce output vectors with individual "don't know" bits. The simulations demonstrate that this
CLAM: A new model of associative memory
✍ Scribed by Antonio B. Bailón; Miguel Delgado; Waldo Fajardo
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 136 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
✦ Synopsis
Ẃe
present a new associative memory model that stores arbitrary bipolar patterns without the problems we can find in other models like BAM or LAM. After identifying those problems we show the new memory topology and we explain its learning and recall stages. Mathematical demonstrations are provided to prove that the new memory model guarantees the perfect retrieval of every stored pattern and also to prove that whatever the input of the memory is, it operates as a nearest neighbor classifier.
📜 SIMILAR VOLUMES
Neural networks have proved to be useful models of associative memories. After a brief review of the standard Hopfield model we discuss how to introduce some realistic features such as categorization of the stored information and asymmetric synapsis.
In this article, we analyze the use of the continuous classifying associative memory (CCLAM) to store linguistic information. Freedom in the choice of the functions that control the operation of the CCLAM equip this memory with the capacity to adapt to different information storage and recovery need