Evolving Features in Neural Networks for System Identification

Yung-Keun Kwon and Byung-Ro Moon

Abstract. Given N data pairs {X_i, y_i}, i=1,2,...,N, where each X_i is an n-dimensional vector of independent variables and y_i is a dependent variable, the function approximation problem (FAP) is finding a function that best explains the N pairs of X_i and y_i. From the universal approximation theorem and inherent approximation capabilities proved by various researches, artificial neural networks (ANNs) are considered as powerful function approximators. There are two main issues on the feedforward neural networks’ performance. One is to determine its structure. The other issue is to specify the weights of a network that minimizes its error. Genetic algorithm (GA) is a global search technique and is useful for complex optimization problems. So, it has been considered to have potential to reinforce the performance of neural networks. Many researchers tried to optimize the weights of networks using genetic algorithms alone or combined with the backpropagation algorithm. Others also tried to find a good topology that is even more difficult and called a “black art.”

LNCS 3103, p. 404 f.

Full article in PDF

lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2004