A weighted voting model of associative memory.
This paper presents an analysis of a random access memory (RAM)-based associative memory which uses a weighted voting scheme for information retrieval. This weighted voting memory can operate in heteroassociative or autoassociative mode, can store both real-valued and binary-valued patterns and, unlike memory models, is equipped with a rejection mechanism. A theoretical analysis of the performance of the weighted voting memory is given for the case of binary and random memory sets. Performance measures are derived as a function of the model parameters: pattern size, window size, and number of patterns in the memory set. It is shown that the weighted voting model has large capacity and error correction. The results show that the weighted voting model can successfully achieve high-detection and -identification rates and, simultaneously, low-false-acceptance rates.
Mu
Xiaoyan
X
Department of Electrical and Computer Engineering, Rose-Hulman Institute of Technology, Terre Haute, IN 47803, USA. mu@Rose-Hulman.edu
Watta
Paul
P
Hassoun
Mohamad H
MH
D000465:Algorithms; D001185:Artificial Intelligence; D032701:Biomimetics / Q000379:methods*; D003198:Computer Simulation; D003661:Decision Support Techniques; D016247:Information Storage and Retrieval / Q000379:methods*; D008568:Memory; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000379:methods