A New K-Groups Neural Network  

Oleh:

Yen, Jui-Cheng

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 13 no. 5 (2002), page 1187-1192.
Topik: NEURAL NETWORKS; new k- goups; neural network

Ketersediaan

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

Lihat Detail Induk

Isi artikel

A novel neural - network model called GROUPSTRON is proposed to identify the k groups' elements from a data set. Based on both the divide - and - conquer principle and the coarse - and - fine competition, GROUPSTRON divides the identification process into k rounds and then sequentially identifies each group's elements from the data set. All the elements in the first group are larger than those in the second group and this relationship holds for the successive groups. The proof that GROUPSTRON converges to the correct state in every situation is also given. Moreover, the convergence rates of GROUPSTRON for three special data distributions are deduced. Finally, simulation results are given to demonstrate the effectiveness and design philosophy of GROUPSTRON.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali