Specific modification of a GPA-ES evolutionary system suitable for deterministic chaos regression

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@Article{Brandejsky:2013:CMA,

• author = "Tomas Brandejsky",
• title = "Specific modification of a GPA-ES evolutionary system suitable for deterministic chaos regression",
• journal = "Computer \& Mathematics with Applications",
• year = "2013",
• volume = "66",
• number = "2",
• pages = "106--112",
• note = "Nostradamus 2012",
• ISSN = "0898-1221",
• DOI = "doi:10.1016/j.camwa.2013.01.011",
• URL = "http://www.sciencedirect.com/science/article/pii/S089812211300028X",
• keywords = "genetic algorithms, genetic programming, Evolutionary strategy, Optimisation, Symbolic regression, Deterministic chaos",
• abstract = "The paper deals with symbolic regression of deterministic chaos systems using a GPA-ES system. A Lorenz attractor, Roessler attractor, Rabinovich-Fabrikant equations and a van der Pol oscillator are used as examples of deterministic chaos systems to demonstrate significant differences in the efficiency of the symbolic regression of systems described by equations of similar complexity. Within the paper, the source of this behaviour is identified in presence of structures which are hard to be discovered during the evolutionary process due to the low probability of their occurrence in the initial population and by the low chance to produce them by standard evolutionary operators given by small probability to form them in a single step and low fitness function magnitudes of inter-steps when GPA tries to form them in more steps. This low magnitude of fitness function for particular solutions tends to eliminate them, thus increasing the number of needed evolutionary steps. As the solution of identified problems, modification of terminals and related crossover and mutation operators are suggested.",

}

Genetic Programming entries for Tomas Brandejsky

Citations