By Topic

Optimum learning for bidirectional associative memory in the sense of capacity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chi Sing Leung ; Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Shatin

Borrowing the idea of the perceptron, bidirectional learning (BL) is proposed to enhance the recall performance of bidirectional associative memory (BAM). By modifying the proof of convergence of the perceptron, the author has proved that BL yields one of the solution connection matrices within a finite number of iterations (if the solutions exist). According to the above convergence of BL, the capacity of BAM with BL is larger than or equal to that with any other learning rule. Hence, BL can be considered as an optimum learning rule for BAM in the sense of capacity. Simulations show that BL greatly improves the capacity and the error correction capability of BAM

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:24 ,  Issue: 5 )