Tree chromosome structure in a genetic algorithm to identify functions

There are two main points in this paper. First, the tree structure was mounted on the chromosome structure of a simple GA. Next, this method succeeded in identifying functions. The target functions for identification were composed of algebraic functions, primary transcendental functions, time series functions, and user-defined one-variable functions. The experimental results indicate that identification of expanded functions succeeded at high speed. However, functions were not identified in factorized form. A second solution method is proposed and experimental results described. © 2000 Scripta Technica, Syst Comp Jpn, 31(10): 32–40, 2000

[1]  Hitoshi Iba,et al.  System identification approach to genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[2]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Herbert A. Simon,et al.  Scientific discovery: compulalional explorations of the creative process , 1987 .