Accessibility navigation


Givens rotation based fast backward elimination algorithm for RBF neural network pruning

Hong, X. and Billings, S.A. (1997) Givens rotation based fast backward elimination algorithm for RBF neural network pruning. IEE Proceedings-Control Theory and Applications, 144 (5). pp. 381-384. ISSN 1350-2379

Full text not archived in this repository.

To link to this article DOI: 10.1049/ip-cta:19971436

Abstract/Summary

A fast backward elimination algorithm is introduced based on a QR decomposition and Givens transformations to prune radial-basis-function networks. Nodes are sequentially removed using an increment of error variance criterion. The procedure is terminated by using a prediction risk criterion so as to obtain a model structure with good generalisation properties. The algorithm can be used to postprocess radial basis centres selected using a k-means routine and, in this mode, it provides a hybrid supervised centre selection approach.

Item Type:Article
Refereed:Yes
Divisions:Faculty of Science > School of Systems Engineering
ID Code:18513
Publisher:IET

Centaur Editors: Update this record

Page navigation