DocumentCode
282553
Title
Model of auto associative memory that stores and retrieves data regardless of their orthogonality, randomness or size
Author
Bairaktaris, Dimitrios
Author_Institution
Comput. Sci., St. Andrews Univ., UK
Volume
i
fYear
1990
fDate
2-5 Jan 1990
Firstpage
142
Abstract
The use of autoassociative memory to store nonorthogonal nonrandom data is discussed. The basic model of autoassociative memory examined is the Hopfield network. Hopfield networks are content-addressable memories processing all the emergent properties. A description of associative memory and a proof that it can also be used as a content-addressable memory, without any further computation than standard, are given. The results of simulations demonstrate an improved behavior when associative memory is used as content-addressable memory instead of Hopfield networks. The final model, a combination of Hopfield networks and associative memory, is discussed in detail, and a model of shared content-addressable memory (SCAM) based on this model is discussed. The problem of storing the same pattern twice and at the same time is addressed, and a solution is proposed to the problem of associating two patterns of activity in an autoassociative memory
Keywords
content-addressable storage; neural nets; Hopfield network; associative memory; auto associative memory; content-addressable memories; data retrieval; data storage; nonorthogonal nonrandom data; orthogonality; randomness; shared content-addressable memory; size; Associative memory; Computational modeling; Computer networks; Computer simulation; Information retrieval; Network topology; Neural networks; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on
Conference_Location
Kailua-Kona, HI
Type
conf
DOI
10.1109/HICSS.1990.205110
Filename
205110
Link To Document