Using Cartesian genetic programming to implement function modelling

This paper presents a new method which uses Cartesian genetic programming (CGP) in order to implement function modelling. Since Julian F. Miller proposed the method of CGP, the research and development of CGP mainly trends in the design of the circuit application in recent years; very few scholars have the related research of function modelling in this field. Therefore, the most important feature in this paper is that we apply CGP which is originally used for circuit design to implement function modelling. By numerical test experiments and comparison, we find that this method of function modelling is novel and has the comparative advantages and it is intelligent (self-adaptive, self-organising, self-learning, self-healing, etc.) while it can greatly increase the system speed.

[1]  Julian Francis Miller,et al.  The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming , 2008, IEEE Transactions on Evolutionary Computation.

[2]  Hitoshi Iba,et al.  Machine Learning Approach to Gate-Level Evolvable Hardware , 1996, ICES.

[3]  Maarten Keijzer,et al.  Improving Symbolic Regression with Interval Arithmetic and Linear Scaling , 2003, EuroGP.

[4]  Julian Francis Miller,et al.  Solving real-valued optimisation problems using cartesian genetic programming , 2007, GECCO '07.

[5]  J. Miller.  An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach , 1999 .

[6]  Julian Francis Miller,et al.  Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems , 2006, GECCO.

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

[8]  A. Topchy,et al.  Faster genetic programming based on local gradient search of numeric leaf values , 2001 .

[9]  Julian Francis Miller,et al.  A multi-chromosome approach to standard and embedded cartesian genetic programming , 2006, GECCO.

[10]  Julian Francis Miller,et al.  Predicting Prime Numbers Using Cartesian Genetic Programming , 2007, EuroGP.

[11]  Julian Francis Miller,et al.  Aspects of Digital Evolution: Geometry and Learning , 1998, ICES.

[12]  Dick den Hertog,et al.  Order of Nonlinearity as a Complexity Measure for Models Generated by Symbolic Regression via Pareto Genetic Programming , 2009, IEEE Transactions on Evolutionary Computation.

[13]  Rafal Salustowicz,et al.  Probabilistic Incremental Program Evolution , 1997, Evolutionary Computation.

[14]  Julian Francis Miller,et al.  Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing , 2009, EuroGP.

[15]  Marco Tomassini,et al.  A phylogenetic, ontogenetic, and epigenetic view of bio-inspired hardware systems , 1997, IEEE Trans. Evol. Comput..

[16]  Astro Teller,et al.  PADO: Learning Tree Structured Algorithms for Orchestration into an Object Recognition System , 1995 .

[17]  Riccardo Poli,et al.  Evolution of Graph-Like Programs with Parallel Distributed Genetic Programming , 1997, ICGA.