Please use this identifier to cite or link to this item:
|dc.title||A penalty-function approach for pruning feedforward neural networks|
|dc.identifier.citation||Setiono, R. (1997-01-01). A penalty-function approach for pruning feedforward neural networks. Neural Computation 9 (1) : 185-204. ScholarBank@NUS Repository.|
|dc.description.abstract||This article proposes the use of a penalty function for pruning feedforward neural network by weight elimination. The penalty function proposed consists of two terms. The first term is to discourage the use of unnecessary connections, and the second term is to prevent the weights of the connections from taking excessively large values. Simple criteria for eliminating weights from the network are also given. The effectiveness of this penalty function is tested on three well-known problems: the contiguity problem, the parity problems, and the monks problems. The resulting pruned networks obtained for many of these problems have fewer connections than previously reported in the literature.|
|dc.contributor.department||INFORMATION SYSTEMS & COMPUTER SCIENCE|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on May 2, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.