Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
The evolution of evolvability in genetic programming
Advances in genetic programming
Advances in genetic programming
System Identification using Structured Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Accurate Replication in Genetic Programming
Proceedings of the 6th International Conference on Genetic Algorithms
Complexity Compression and Evolution
Proceedings of the 6th International Conference on Genetic Algorithms
Genetic Programming Prediction of Stock Prices
Computational Economics
Accelerated Genetic Programming of Polynomials
Genetic Programming and Evolvable Machines
Genetic Programming for Financial Time Series Prediction
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Exhaustive search for perfect predictors in complex binary data
NOLASC'05 Proceedings of the 4th WSEAS International Conference on Non-linear Analysis, Non-linear Systems and Chaos
Expert Systems with Applications: An International Journal
Long memory time series forecasting by using genetic programming
Genetic Programming and Evolvable Machines
Modelling rainfall-runoff using genetic programming
Mathematical and Computer Modelling: An International Journal
Symbolic regression of multiple-time-scale dynamical systems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Inference of hidden variables in systems of differential equations with genetic programming
Genetic Programming and Evolvable Machines
Hi-index | 0.00 |
An investigation into the dynamics of Genetic Programming applied to chaotic time series prediction is reported. An interesting characteristic of adaptive search techniques is their ability to perform well in many problem domains while failing in others. Because of Genetic Programming's flexible tree structure, any particular problem can be represented in myriad forms. These representations have variegated effects on search performance. Therefore, an aspect of fundamental engineering significance is to find a representation which, when acted upon by Genetic Programming operators, optimizes search performance. We discover, in the case of chaotic time series prediction, that the representation commonly used in this domain does not yield optimal solutions. Instead, we find that the population converges onto one "accurately replicating" tree before other trees can be explored. To correct for this premature convergence we make a simple modification to the crossover operator. In this paper we review previous work with GP time series prediction, pointing out an anomalous result related to overlearning, and report the improvement effected by our modified crossover operator.