Neural Computation, Vol 9, 461-478, Copyright © 1997 by The MIT Press

LETTERS

A Sequential Learning Scheme for Function Approximation Using Minimal Radial Basis Function Neural Networks

Lu Yingwei, N. Sundararajan and P. Saratchandran

This article presents a sequential learning algorithm for function approximation and time-series prediction using a minimal radial basis function neural network (RBFNN). The algorithm combines the growth criterion of the resource-allocating network (RAN) of Platt (1991) with a pruning strategy based on the relative contribution of each hidden unit to the overall network output. The resulting network leads toward a minimal topology for the RBFNN. The performance of the algorithm is compared with RAN and the enhanced RAN algorithm of Kadirkamanathan and Niranjan (1993) for the following benchmark problems: (1) hearta from the benchmark problems database PROBEN1, (2) Hermite polynomial, and (3) Mackey-Glass chaotic time series. For these problems, the proposed algorithm is shown to realize RBFNNs with far fewer hidden neurons with better or same accuracy.

This article has been cited by other articles:

				K. YAMAUCHI and J. HAYAMI Incremental Leaning and Model Selection for Radial Basis Function Network through Sleep IEICE Trans D: Information, March 1, 2007; E90-D(4): 722 - 735. [Abstract] [PDF]

				C. Andrieu, N. de Freitas, and A. Doucet Robust Full Bayesian Learning for Radial Basis Networks Neural Comput., October 1, 2001; 13(10): 2359 - 2407. [Abstract] [Full Text] [PDF]