Efficient pattern recalling using a non iterative hopfield associative memory

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

Abstract

Actually associative memories have demonstrated to be useful in pattern processing field. Hopfield model is an autoassociative memory that has problems in the recalling phase; one of them is the time of convergence or non convergence in certain cases with patterns bad recovered. In this paper, a new algorithm for the Hopfield associative memory eliminates iteration processes reducing time computing and uncertainty on pattern recalling. This algorithm is implemented using a corrective vector which is computed using the Hopfield memory. The corrective vector adjusts misclassifications in output recalled patterns. Results show a good performance of the proposed algorithm, providing an alternative tool for the pattern recognition field. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Carbajal Hernández, J. J., & Sánchez Fernández, L. P. (2011). Efficient pattern recalling using a non iterative hopfield associative memory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7095 LNAI, pp. 522–529). https://doi.org/10.1007/978-3-642-25330-0_46

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