A Neural-Network Learning Theory and A Polynomial Time RBF Algorithm  

Oleh:

Roy, A. ; Govil, S. ; Miranda, R.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 8 no. 6 (1997), page 1301-1313.
Topik: ALGORITHM; neural - network; learning; polynomial time; RBF algorithm

Ketersediaan

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

Lihat Detail Induk

Isi artikel

This paper presents a new learning theory (a set of principles for brain - like learning) and a corresponding algorithm for the neural - network field. The learning theory defines computational characteristics that are much more brain -like than that of classical connectionist learning. Robust and reliable learning algorithms would result if these learning principles are followed rigorously when developing neural-network algorithms. This paper also presents a new algorithm for generating radial basis function (RBF) nets for function approximation. The design of the algorithm is based on the proposed set of learning principles. The net generated by this algorithm is not a typical RBF net, but a combination of “truncated” RBF and other types of hidden units. The algorithm uses random clustering and linear programming (LP) to design and train this “mixed” RBF net. Polynomial time complexity of the algorithm is proven and computational results are provided for the well known Mackey - Glass chaotic time series problem, the logistic map prediction problem, various neuro - control problems, and several time series forecasting problems. The algorithm can also be implemented as an online adaptive algorithm.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali