Cooperative Updating in The Hopfield Model  

Oleh:

Kobayashi, M. ; Munehisa, T. ; Yamazaki, H.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 12 no. 5 (2001), page 1243-1251.
Topik: metode hopfield; cooperative; hopfield model

Ketersediaan

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

Lihat Detail Induk

Isi artikel

We propose a new method for updating units in the Hopfield model. With this method two or more units change at the same time, so as to become the lowest energy state among all possible states. Since this updating algorithm is based on the detailed balance equation, convergence to the Boltzmann distribution is guaranteed. If our algorithm is applied to finding the minimum energy in constraint satisfaction and combinatorial optimization problems, then there is a faster convergence than those with the usual algorithm in the neural network. This is shown by experiments with the travelling salesman problem, the four - color problem, the N - queen problem, and the graph bi - partitioning problem. In constraint satisfaction problems, for which earlier neural networks are effective in some cases, our updating scheme works fine. Even though we still encounter the problem of ending up in local minima, our updating scheme has a great advantage compared with the usual updating scheme used in combinatorial optimization problems. Also, we discuss parallel computing using our updating algorithm.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali