Thresholded Learning Matrix for Efficient Pattern Recalling

  • Authors:
  • Mario Aldape-Pérez;Israel Román-Godínez;Oscar Camacho-Nieto

  • Affiliations:
  • Center for Computing Research, CIC, National Polytechnic Institute,IPN, Mexico City, Mexico;Center for Computing Research, CIC, National Polytechnic Institute,IPN, Mexico City, Mexico;Center for Computing Research, CIC, National Polytechnic Institute,IPN, Mexico City, Mexico

  • Venue:
  • CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Lernmatrix, which is the first known model of associative memory, is a heteroassociative memory that can easily work as a binary pattern classifier if output patterns are appropriately chosen. However, this mathematical model undergoes fundamental patterns misclassification whenever crossbars saturation occurs. In this paper, a novel algorithm that overcomes Lernmatrixweaknesses is proposed. The crossbars saturation occurrence is solved by means of a dynamic threshold value which is computed for each recalled pattern. The algorithm applies the dynamic threshold value over the ambiguously recalled class vector in order to obtain a sentinel vector which is used for uncertainty elimination purposes. The efficiency and effectiveness of our approach is demonstrated through comparisons with other methods using real-world data.