An Efficient Learning Algorithm for Associative Memories  

Oleh:

Batalama, S. N. ; Wu, Yingquan

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 11 no. 5 (2000), page 1058-1066.
Topik: ALGORITHM; learning algorithm; associative memories

Ketersediaan

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

Lihat Detail Induk

Isi artikel

Associative memories (AMs) can be implemented using networks with or without feedback. We utilize a two - layer feedforward neural network and propose a learning algorithm that efficiently implements the association rule of a bipolar AM. The hidden layer of the network employs p neurons where p is the number of prototype patterns. In the first layer, the input pattern activates at most one hidden layer neuron or “winner”. In the second layer, the “winner” associates the input pattern to the corresponding prototype pattern. The underlying association principle is minimum Hamming distance and the proposed scheme can be viewed also as an approximately minimum Hamming distance decoder. Theoretical analysis supported by simulations indicates that, in comparison with other suboptimum minimum Hamming distance association schemes, the proposed structure exhibits the following favorable characteristics : 1) it operates in one - shot which implies no convergence - time requirements ; 2) it does not require any feedback ; and 3) our case studies show that it exhibits superior performance to the popular linear system in a saturated mode. The network also exhibits 4) exponential capacity and 5) easy performance assessment (no asymptotic analysis is necessary). Finally, since it does not require any hidden layer interconnections or tree - search operations, it exhibits low structural as well as operational complexity.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali