Spartan simplicity: A pruning algorithm for neural nets
| dc.contributor.author | Jearanaitanakij, Kietikul | |
| dc.contributor.author | Pinngern, Ouen | |
| dc.date.accessioned | 2026-08-06T09:56:47Z | |
| dc.date.available | 2026-08-06T09:56:47Z | |
| dc.date.issued | 2008-08-01 | |
| dc.description.abstract | Having more hidden units than necessary can produce a neural network that has a poor generalization. This paper proposes a new algorithm for pruning unnecessary hidden units away from the single-hidden layer feedforward neural networks, resulting in a Spartan network. Our approach is simple and easy to implement, yet produces a very good result. The idea is to train the network until it begins to lose its generalization. Then the algorithm measures the sensitivity and automatically prunes away the most irrelevant unit. We define this sensitivity as the absolute difference between the desirable output and the output of the pruned network. Unlike other pruning methods, our algorithm is distinct in calculating the sensitivity from the validation set, instead of the training set, without increasing the asymptotic time complexity of the back-propagation algorithm. In addition, for a classification problem, we raise a point that the sensitivities of some well-known pruning algorithms may still underestimate the irrelevance of hidden unit even though the validation set is used in measuring the sensitivity. We resolve this problem by considering the number of misclassified patterns as the main concern. The Spartan simplicity algorithm is applied to three artificial and seven standard benchmarks. In most problems, the algorithm can produce a compact-sized network with high generalization ability in comparison with other pruning algorithms. © 2008 World Scientific Publishing Company. | |
| dc.identifier.citation | Journal of Circuits Systems and Computers, 17(4), 569-596, 2008 | |
| dc.identifier.doi | 10.1142/S0218126608004514 | |
| dc.identifier.issn | 02181266 | |
| dc.identifier.other | 2-s2.0-59049084295 | |
| dc.identifier.uri | https://dspace.kmitl.ac.th/handle/123456789/2053 | |
| dc.source | Journal of Circuits Systems and Computers | |
| dc.subject | Artificial neural network | |
| dc.subject | Classification | |
| dc.subject | Generalization | |
| dc.subject | Hidden unit | |
| dc.subject | Pruning | |
| dc.title | Spartan simplicity: A pruning algorithm for neural nets | |
| dc.type | Article |