Abstract
The Differential Evolution (DE) algorithm is a floating-point encoded Evolutionary Algorithm for global optimization. It has been demonstrated to be an efficient, effective, and robust optimization method especially for problems containing continuous variables. The paper concerns applying a DE-based method to perform function approximation using Gaussian Radial Basis Function (RBF) networks with variable widths. This method selects centres and decides weights of the networks heuristically, then uses the Differential Evolution algorithm for local and global tuning iteratively to find the widths of RBFs. The method is demonstrated by training networks that approximate a set of functions. The Mean Square Error from the desired outputs to the actual network outputs is applied as the objective function to be minimized. A comparison of the net performances with other approaches reported in the literature has been performed. The proposed approach effectively overcomes the problem of how many radial basis functions to use. The obtained initial results suggest that the Differential Evolution based method is an efficient approach in approximating functions with growing radial basis function networks and the resulting network generally improves the approximation results reported for continuous mappings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexandridis, A., Sarimveis, H., Bafas, G.: A new algorithm for online structure and parameter adaptation of RBF networks. Neural Networks 16, 1003–1017 (2003)
Billings, S.A., Zheng, G.L.: Radial basis function networks configuration using genetic algorithms. Neural Networks 8(6), 877–890 (1995)
Broomhead, D.S., Lowe, D.: Multivariable functional interpolation and adaptive networks. Complex Systems 2, 321–355 (1988)
Esposito, A., Marinaro, M., Oricchio, D., Scarpetta, S.: Approximation of continuous and discontinuous mappings by a growing neural RBF-based algorithm. Neural Networks 13, 651–665 (2000)
Lampinen, J., Zelinka, I.: On stagnation of the differential evolution algorithm. In: Proc. 6th Int’l. Conf. on Soft Computing (MENDEL 2000), Brno, Czech Republic, June 7-9, pp. 76–83 (2000)
Leonardis, A., Bischof, H.: An efficient MDL-based construction of RBF networks. Neural Networks 11, 963–973 (1998)
Musavi, M.T., Ahmed, W., Chan, K.H., Faris, K.B., Hummels, D.M.: On the training of radial basis function classifiers. Neural Networks 5, 595–603 (1992)
Park, J., Sandberg, J.W.: Universal approximation using radial-basis-function networks. Neural Computation 3, 246–257 (1991)
Plagianakos, V.P., Vrahatis, M.N.: Neural network training with constrained integer weights. In: Proc. 1999 Congress on Evolutionary Computation, Washington, DC USA, 6-9 July 1999, vol. 3, pp. 2007–2013 (1999)
Poggio, T., Girosi, F.: Networks for approximation and learning. Proc. IEEE 78(9), 1481–1497 (1990)
Schmitz, G.P.J., Aldrich, C.: Combinatorial evolution of regression nodes in feedforward neural networks. Neural Networks 12, 175–189 (1999)
Storn, R., Price, K.: Differential Evolution a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11(4), 341–359 (1997)
Storn, R., Price, K.: On the usage of Differential Evolution for function optimization. In: 1996 Biennial Conference of the North American Fuzzy Information Processing Society (NAFIPS), Berkeley, CA, USA, June 19-22, pp. 519–523 (1996)
Vinod, V., Ghose, S.: Growing nonuniform feedforward networks for continuous mapping. Neural computing 10, 55–69 (1996)
Wang, Z., Zhu, T.: An efficient learning algorithm for improving generalization performance of radial basis function neural networks. Neural Networks 13, 545–553 (2000)
Zhu, Q., Cai, Y., Liu, L.: A global learning algorithm for a RBF network. Neural Networks 12, 527–540 (1999)
Yong, F., Chow, T.: Neural network adaptive wavelets for function approximation. Intern. report. Department of Electrical Engineering, City University of Hong Kong (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Kukkonen, S., Lampinen, J. (2004). Growing RBF Networks for Function Approximation by a DE-Based Method. In: Zhang, J., He, JH., Fu, Y. (eds) Computational and Information Science. CIS 2004. Lecture Notes in Computer Science, vol 3314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30497-5_62
Download citation
DOI: https://doi.org/10.1007/978-3-540-30497-5_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24127-0
Online ISBN: 978-3-540-30497-5
eBook Packages: Computer ScienceComputer Science (R0)