Growing RBF networks for function approximation by a DE-Based method

Authors:
Junhong Liu;Saku Kukkonen;Jouni Lampinen
Affiliations:
Department of Information Technology, Lappeenranta University of Technology, Lappeenranta, Finland;Department of Information Technology, Lappeenranta University of Technology, Lappeenranta, Finland;Department of Information Technology, Lappeenranta University of Technology, Lappeenranta, Finland
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 10
Cited 1

Universal approximation using radial-basis-function networks

Neural Computation
Original Contribution: On the training of radial basis function classifiers

Neural Networks
Radial basis function network configuration using genetic algorithms

Neural Networks
An efficient MDL-based construction of RBF networks

Neural Networks
Combinatorial evolution of regression nodes in feedforward neural networks

Neural Networks
A global learing algorithm for a RBF network

Neural Networks
An efficient learning algorithm for improving generalization performance of radial basis function neural networks

Neural Networks
Approximation of continuous and discontinuous mappings by a growing neural RBF-based algorithm

Neural Networks
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
A new algorithm for online structure and parameter adaptation of RBF networks

Neural Networks

A differential evolution based incremental training method for RBF networks

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

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.