DocumentCode
1438468
Title
Guaranteed recall of all training pairs for exponential bidirectional associative memory
Author
Eom, Tae-Dok ; Oh, Sang-Keon ; Lee, Ju-Jang
Author_Institution
Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea
Volume
37
Issue
3
fYear
2001
fDate
2/1/2001 12:00:00 AM
Firstpage
153
Lastpage
154
Abstract
Several methods of guaranteeing the recall of all training pairs for exponential bidirectional associative memory are presented. If the minimum Hamming distance between patterns is known, the radix can be determined to provide a certain basin of attraction. Otherwise the statistical minimum distance can be applied. A weight learning algorithm based on a pseudo-relaxation algorithm is also developed to make all training pairs recallable with a small radix
Keywords
analogue storage; content-addressable storage; learning (artificial intelligence); basin of attraction; exponential bidirectional associative memory; guaranteed recall; minimum Hamming distance; patterns; pseudo-relaxation algorithm; statistical minimum distance; training pairs; weight learning algorithm;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:20010115
Filename
902782
Link To Document