A Givens Rotation Based Fast Backward Elimination Algorithm for RBF Neural Network Pruning
Hong, X. and Billings, S.A.
(1996)
A Givens Rotation Based Fast Backward Elimination Algorithm for RBF Neural Network Pruning.
Research Report.
ACSE Research Report 643
.
Department of Automatic Control and Systems Engineering
Abstract
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 a k means routine and in this mode provides a hybrid supervised centre selection approach.
Metadata
Authors/Creators:
Hong, X.
Billings, S.A.
Copyright, Publisher and Additional Information:
The Department of Automatic Control and Systems Engineering research reports offer a forum for the research output of the academic staff and research students of the Department at the University of Sheffield. Papers are reviewed for quality and presentation by a departmental editor. However, the contents and opinions expressed remain the responsibility of the authors. Some papers in the series may have been subsequently published elsewhere and you are advised to cite the later published version in these instances.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)