Improving Leung's Bidirectional Learning Rule for Associative Memories  

Oleh:

Lenze, B.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 12 no. 5 (2001), page 1222-1226.
Topik: LEARNING; leung's bidirectional; learning rule; associative memories

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.5 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Leung (1994) introduced a perceptron - like learning rule to enhance the recall performance of bidirectional associative memories (BAMs). He proved that his so -called bidirectional learning scheme always yields a solution within a finite number of learning iterations in case that a solution exists. Unfortunately, in the setting of Leung a solution only exists in case that the training set is strongly linear separable by hyperplanes through the origin. We extend Leung's approach by considering conditionally strong linear separable sets allowing separating hyperplanes not containing the origin. Moreover, we deal with BAM s, which are generalized by defining so - called dilation and translation parameters enlarging their capacity, while leaving their complexity almost unaffected. The whole approach leads to a generalized bidirectional learning rule which generates BAMs with dilation and translation that perform perfectly on the training set in a case that the latter satisfies the conditionally strong linear separability assumption. Therefore, in the sense of Leung, we conclude with an optimal learning strategy which contains Leung's initial idea as a special case.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali