Implementation of Hopfield associative memory with evolutionary algorithm and MC-adaptation rule for pattern storage

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes the strategy for implementation of Hopfield neural network as associative memory with the genetic algorithm and the Monte Carlo-(MC-) adaptation rule for pattern storage. In the Hopfield type neural networks of associative memory, the appropriate arrangement of synaptic weights provides an associative memory feature in the network. The fixed-point stable state of this model represents the appropriate storage of the input patterns. The aim is to obtain the optimal weight matrix for efficient recalling of any prototype input pattern. The performance of the Hopfield neural network, especially the capacity and the quality of the recalling, can be greatly improved by making use of genetic algorithm and MC-adaptation rule. The experiments consider a neural network trained with multiple numbers of patterns using the Hebbian learning rule. In most cases, the recalling of patterns using genetic algorithm with MC-adaptation rule seems to give better results than the conventional hebbian rule, MC-adaptation rule and simple genetic algorithm recalling techniques. © 2012 Springer India Pvt. Ltd.

Cite

CITATION STYLE

APA

Kumar, S., Goel, R., & Singh, M. P. (2012). Implementation of Hopfield associative memory with evolutionary algorithm and MC-adaptation rule for pattern storage. In Advances in Intelligent and Soft Computing (Vol. 131 AISC, pp. 213–227). https://doi.org/10.1007/978-81-322-0491-6_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free