A Theoretical Investigation into the Performance of the Hopfield Model

IEEE Transactions on Neural Networks

Volumn 1, Issue 2, 1990, Pages 204-215

  Aiyer, Sreeram V B ^a   Niranjan, Mahesan ^a   Fallside, Frank ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE, DIGITAL--ASSOCIATIVE; MATHEMATICAL PROGRAMMING, LINEAR; MATHEMATICAL TECHNIQUES--EIGENVALUES AND EIGENFUNCTIONS;

CONTENT ADDRESSABLE MEMORIES; HOPFIELD MODEL; TRAVELING SALESMAN PROBLEM;

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0025445490     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.80232     Document Type: Article

References (17)

1. J. J. Hopfield, “Unlearning has a stabilizing effect in collective memories,” Nature, vol. 304, p. 158, 1983.
2. J. J. Hopfield, “Neurons with graded response have collective computational properties like those of two-state neurons,” Proc. Nat. Acad. Sci. U.S., vol. 81, pp. 3088-3092, 1984.
3. J. J. Hopfield and D. W. Tank, “Neural computation of decisions in optimization problems,” Biolog. Cybern., vol. 52, pp. 1-25, 1985.
4. R. J. McEliece, C. E. Posner, R. R. Rodemich and S. S. Venkatesh, “The capacity of the Hopfield associative memory,” IEEE Trans. Inform. Theory, vol. IT-33, vol. 4, pp. 461-482, 1987.
5. S. S. Venkatesh and D. Psaltis, “Linear and logarithmic capacities in associative neural networks,” IEEE Trans. Inform. Theory, vol. IT-35, no. 3, pp. 558-568, 1989.
6. A. Dembo, “On the capacity of associative memories with linear threshold functions,” IEEE Trans. Inform. Theory, vol. IT-35, no. 4, pp. 709-720, 1989.
7. J. D. Keeler, “Comparison between sparsely distributed memory and Hopfield-type neural network models,” Phys. Dep. and Institute for Nonlinear Sci., Univ. of California, San Diego, CA, B-019, 1986.
8. T. Kohonen, Self-Organization and Associative Memory ‘Springer Series on Information Sciences’. Springer-Verlag, 1989.
9. S. Abe, “Theories on the Hopfield neural networks,” in Proc. IJCNN 89, vol. I, 1989, pp. 557-564.
10. A. Lapedes and R. Farber, “Programming a massively parallel, computation universal system: static behavior,” Amer. Inst. Phys., 1986.
11. Y. S. Abu-Mustafa and J. St. Jacques, “Information capacity of the Hopfield model,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 461-464, 1985.
12. V. Wilson and G. S. Pawley, “On the stability of the TSP problem algorithm of Hopfield and Tank,” Biolog. Cybern., vol. 58, pp. 63-70, 1988.
13. A. Kahng, “Traveling salesman heuristics and embedding dimension in the Hopfield model,” in Proc. IJCNN 89, vol. I, 1989, pp. 513-520.
14. G. A. Tagliarini and E. W. Page, “Solving constraint satisfaction problems with neural networks,” in Proc. ICNN 87, vol. III, 1987, pp. 741-747.
15. D. E. Van den Bout and T. K. Miller, “A traveling salesman objective function that works,” in Proc. ICNN 88, vol. II, 1988, pp. 299-303.
16. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory Languages and Computation. Reading, MA: Addison-Wesley, 1979.
17. E. L. Lawler, J. K. Lenstra, Kan Rinnooy, and P. B. Shmoys, The Traveling Salesman Problem. New York: Wiley, 1985.