Using backpropagation algorithm (BP) to train neural networks is a widely adopted practice in both theory and practical applications. But its distributed weight representation, that is the weight matrix of final network after training by using BP are usually not sparsified, and prohibits its use in the rule discovery of inherent functional relations between the input and output data, so in this aspect some kinds of structure optimization are needed to improve its poor performance. In this paper with this in mind a new method to prune neural networks is proposed based on some statistical quantities of neural networks. Comparing with the other known pruning methods such as structural learning with forgetting (SLF) and RPROP algorithm, the proposed method can attain comparable or even better results over these methods without evident increase of the computational load. Detailed simulations using the Iris data sets exhibit our above assertion.
|Published - 2000 1月 1
|International Joint Conference on Neural Networks (IJCNN'2000) - Como, Italy
継続期間: 2000 7月 24 → 2000 7月 27
|International Joint Conference on Neural Networks (IJCNN'2000)
|00/7/24 → 00/7/27
ASJC Scopus subject areas