Noise Performance of Linear Associative Memories

Authors:
K. J. Raghunath;V. Cherkassky
Affiliations:
-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1994

Citing 7
Cited 0

A Quantitative Comparison of the Performance of Three Discrete Distributed Associative Memory Models

IEEE Transactions on Computers
Distributed and Fault-Tolerant Computation for Retrieval Tasks Using Distributed Associative Memories

IEEE Transactions on Computers - Fault-Tolerant Computing
Adaptive pattern recognition and neural networks

Adaptive pattern recognition and neural networks
Self-organization and associative memory: 3rd edition

Self-organization and associative memory: 3rd edition
Linear Algebra Approach to Neural Associative Memories and Noise performance of Neural Classifiers

IEEE Transactions on Computers - Special issue on artificial neural networks
Original Contribution: Further noise rejection in linear associative memories

Neural Networks
Perceptrons: An Introduction to Computational Geometry

Perceptrons: An Introduction to Computational Geometry

Quantified Score

Hi-index	0.14

Visualization

Abstract

The performance of two commonly used linear models of associative memories, generalized inverse (GI) and correlation matrix memory (CMM) is studied analytically in the presence of a new type of noise (training noise due to noisy training patterns). Theoretical expressions are determined for the S/N ratio gain of the GI and CMM memories in the auto-associative and hetero-associative modes of operation. It is found that the GI method performance degrades significantly in the presence of training noise while the CMM method is relatively unaffected by it. The theoretical expressions are plotted and compared with the results obtained from Monte Carlo simulations and the two are found to be in excellent agreement.