Efficient pattern recalling using a non iterative hopfield associative memory

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAdvances in Soft Computing - 10th Mexican International Conference on Artificial Intelligence, MICAI 2011, Proceedings
Pages522-529
Number of pages8
EditionPART 2
DOIs
StatePublished - 2011
Event10th Mexican International Conference on Artificial Intelligence, MICAI 2011 - Puebla, Mexico
Duration: 26 Nov 20114 Dec 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume7095 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th Mexican International Conference on Artificial Intelligence, MICAI 2011
Country/TerritoryMexico
CityPuebla
Period26/11/114/12/11

Keywords

  • Associative memory
  • Hopfield
  • neural networks
  • non iterative

Fingerprint

Dive into the research topics of 'Efficient pattern recalling using a non iterative hopfield associative memory'. Together they form a unique fingerprint.

Cite this