single-jc.php

JACIII Vol.5 No.4 pp. 229-238
doi: 10.20965/jaciii.2001.p0229
(2001)

Paper:

Evolving Basis Function Networks for System Identification

Yuehui Chen and Shigeyasu Kawaji

Department of System Engineering and Information Science Graduate School of Science and Technology Kumamoto University, 2-39-1 Kurokami, Kumamoto, 860-8555 Japan

Received:
March 26, 2001
Accepted:
June 15, 2001
Published:
July 20, 2001
Keywords:
basis function networks, spare tree, MPIPE, random search algorithm, system identification
Abstract

This paper is concerned with learning and optimization of different basis function networks in the aspect of structure adaptation and parameter tuning. Basis function networks include the Volterra polynomial, Gaussian radial, B-spline, fuzzy, recurrent fuzzy, and local Gaussian basis function networks. Based on creation and evolution of the type constrained sparse tree, a unified framework is constructed, in which structure adaptation and parameter adjustment of different basis function networks are addressed using a hybrid learning algorithm combining a modified probabilistic incremental program evolution (MPIPE) and random search algorithm. Simulation results for the identification of nonlinear systems show the feasibility and effectiveness of the proposed method.

Cite this article as:
Yuehui Chen and Shigeyasu Kawaji, “Evolving Basis Function Networks for System Identification,” J. Adv. Comput. Intell. Intell. Inform., Vol.5, No.4, pp. 229-238, 2001.
Data files:

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

Last updated on Sep. 21, 2021