JACIII Vol.9 No.5 pp. 540-548
doi: 10.20965/jaciii.2005.p0540


Approximation by Growing Radial Basis Function Networks Using the Differential-Evolution-Based Algorithm

Junhong Liu, and Jouni Lampinen

Department of Information Technology, Lappeenranta University of Technology, P.O. Box 20, FIN--53851 Lappeenranta, Finland

December 2, 2004
May 26, 2005
September 20, 2005
radial basis function, differential evolution, neural network, evolutionary algorithm, approximation
The differential evolution (DE) algorithm is a floating-point-encoded evolutionary algorithm for global optimization. We applied a DE-based method to training radial basis function (RBF) networks with variables including centers, weights, and widths. This algorithm consists of three steps – initial tuning focusing on finding the center of a one-node RBF network, local tuning, and global tuning both using cycling schemes to find RBF network parameters. The mean square error from desired output to actual network output is applied as the objective function to be minimized. Network training is shown by approximating a set of functions and reconstructing the spectra of oil samples and classification. Net performance is compared to approaches reported in the literature, and the resulting network generally performs better based on the tests performed. Results show that DE-based Gaussian RBF growth method improves approximation results reported.
Cite this article as:
J. Liu and J. Lampinen, “Approximation by Growing Radial Basis Function Networks Using the Differential-Evolution-Based Algorithm,” J. Adv. Comput. Intell. Intell. Inform., Vol.9 No.5, pp. 540-548, 2005.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Jul. 12, 2024