Dummy Stored Memory Algorithm for Hopfield Model

알고리즘 수정에 의한 홉필드 모델의 성능 개선

  • O, Sang-Hoon (Pusan National University Dept. of Electronics Eng.) ;
  • Yoon, Tae-Hoon (Pusan National University Dept. of Electronics Eng.) ;
  • Kim, Jae-Chang (Pusan National University Dept. of Electronics Eng.)
  • 오상훈 (부산 대학교 전자공학과) ;
  • 윤태훈 (부산 대학교 전자공학과) ;
  • 김재창 (부산 대학교 전자공학과)
  • Published : 1987.07.03

Abstract

Recently Hopfield proposed a model for content-addressable memory, which has been shown to be capable of storing information in a distributed fashion and determining the nearest-neighbor. Its application is, however, inherently limited to the case that the number of l's in each stored vector is nearly the same as the number of O's in that vector. If not the case, the model has high probability of failure in finding the nearest-neighbor. In this work, a modification of the Hopfield's model, which works well irrespective of the number of l's (or O's) in each stored vector, is suggested.

Keywords