A fast identification algorithm for box-cox transformation based radial basis function neural network

Authors:
Xia Hong
Affiliations:
Dept. of Cybern., Reading Univ., UK
Venue:
IEEE Transactions on Neural Networks
Year:
2006

Citing 0
Cited 4

A growing and pruning method for radial basis function networks

IEEE Transactions on Neural Networks
Granular neural networks and their development through context-based clustering and adjustable dimensionality of receptive fields

IEEE Transactions on Neural Networks
Application of RBF neural network and nonlinear particle filter in the synthetic ammonia decarbornization

ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part I
A clustering algorithm for radial basis function neural network initialization

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this letter, a Box-Cox transformation-based radial basis function (RBF) neural network is introduced using the RBF neural network to represent the transformed system output. Initially a fixed and moderate sized RBF model base is derived based on a rank revealing orthogonal matrix triangularization (QR decomposition). Then a new fast identification algorithm is introduced using Gauss-Newton algorithm to derive the required Box-Cox transformation, based on a maximum likelihood estimator. The main contribution of this letter is to explore the special structure of the proposed RBF neural network for computational efficiency by utilizing the inverse of matrix block decomposition lemma. Finally, the Box-Cox transformation-based RBF neural network, with good generalization and sparsity, is identified based on the derived optimal Box-Cox transformation and a D-optimality-based orthogonal forward regression algorithm. The proposed algorithm and its efficacy are demonstrated with an illustrative example in comparison with support vector machine regression.