Design of Hopfield content-addressable memories

The Hamming-stability perceptron learning rule (PHSL) is proposed for the Hopfield content-addressable memories based on three well recognized criteria, which amount to widely expanding the basin of attraction around each desired attractor. Extensive experiments convincingly show that the PHSL does take good care of three optimal criteria. >

[1]  M. Naraghi-Pour,et al.  Neural network design using linear programming and relaxation , 1990, IEEE International Symposium on Circuits and Systems.

[2]  M H. Hassoun,et al.  New Recording Algorithm For Hopfield Model Associative Memories , 1988, Photonics West - Lasers and Applications in Science and Engineering.

[3]  A. A. Mullin,et al.  Principles of neurodynamics , 1962 .

[4]  Santosh S. Venkatesh,et al.  The capacity of the Hopfield associative memory , 1987, IEEE Trans. Inf. Theory.

[5]  Jehoshua Bruck,et al.  On the number of spurious memories in the Hopfield model , 1990, IEEE Trans. Inf. Theory.

[6]  Demetri Psaltis,et al.  Linear and logarithmic capacities in associative neural networks , 1989, IEEE Trans. Inf. Theory.

[7]  Amir Dembo,et al.  On the capacity of associative memories with linear threshold functions , 1989, IEEE Trans. Inf. Theory.

[8]  A.N. Michel,et al.  Associative memories via artificial neural networks , 1990, IEEE Control Systems Magazine.

[9]  Robert Fischl,et al.  Design of the fully connected binary neural network via linear programming , 1990, IEEE International Symposium on Circuits and Systems.

[10]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.