An Iterative Pruning Algorithm for Feedforward Neural Networks  

Oleh:

Pelillo, M. ; Fanelli, A. M. ; Castellano, G.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 8 no. 3 (1997), page 519-531.
Topik: ALGORITHM; iterative; pruning algorithm; neural networks

Ketersediaan

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

Lihat Detail Induk

Isi artikel

The problem of determining the proper size of an artificial neural network is recognized to be crucial, especially for its practical implications in such important issues as learning and generalization. One popular approach for tackling this problem is commonly known as pruning and it consists of training a larger than necessary network and then removing unnecessary weights / nodes. In this paper, a new pruning method is developed, based on the idea of iteratively eliminating units and adjusting the remaining weights in such a way that the network performance does not worsen over the entire training set. The pruning problem is formulated in terms of solving a system of linear equations, and a very efficient conjugate gradient algorithm is used for solving it, in the least - squares sense. The algorithm also provides a simple criterion for choosing the units to be removed, which has proved to work well in practice. The results obtained over various test problems demonstrate the effectiveness of the proposed approach.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali