A Generalized Growing and Pruning RBF (GGAP-RBF) Neural Network for Function Approximation
Top Cited Papers
- 31 January 2005
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 16 (1), 57-67
- https://doi.org/10.1109/tnn.2004.836241
Abstract
This work presents a new sequential learning algorithm for radial basis function (RBF) networks referred to as generalized growing and pruning algorithm for RBF (GGAP-RBF). The paper first introduces the concept of significance for the hidden neurons and then uses it in the learning algorithm to realize parsimonious networks. The growing and pruning strategy of GGAP-RBF is based on linking the required learning accuracy with the significance of the nearest or intentionally added new neuron. Significance of a neuron is a measure of the average information content of that neuron. The GGAP-RBF algorithm can be used for any arbitrary sampling density for training samples and is derived from a rigorous statistical point of view. Simulation results for bench mark problems in the function approximation area show that the GGAP-RBF outperforms several other sequential learning algorithms in terms of learning speed, network size and generalization performance regardless of the sampling density function of the training data.Keywords
This publication has 15 references indexed in Scilit:
- Sequential growing and pruning of radial basis function networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Time series analysis using normalized PG-RBF network with regression weightsNeurocomputing, 2002
- Improved RAN sequential prediction using orthogonal techniquesNeurocomputing, 2001
- Radial Basis Function Neural Networks with Sequential LearningProgress in Neural Processing, 1999
- Performance evaluation of a sequential minimal radial basis function (RBF) neural network learning algorithmIEEE Transactions on Neural Networks, 1998
- Growing radial basis neural networks: merging supervised and unsupervised learning with network growth techniquesIEEE Transactions on Neural Networks, 1997
- Regularized orthogonal least squares algorithm for constructing radial basis function networksInternational Journal of Control, 1996
- Gradient radial basis function networks for nonlinear and nonstationary time series predictionIEEE Transactions on Neural Networks, 1996
- A Gaussian potential function network with hierarchically self-organizing learningNeural Networks, 1991
- Orthogonal least squares learning algorithm for radial basis function networksIEEE Transactions on Neural Networks, 1991