A New Method for Simplifying Algebraic Expressions in Genetic Programming Called Equivalent Decision Simplification

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

@InProceedings{Mori:2009:dcaibscaal,
  title =        "A New Method for Simplifying Algebraic Expressions in
                 Genetic Programming Called Equivalent Decision
                 Simplification",
  author =       "Naoki Mori and Bob McKay and Nguyen Xuan Hoai and 
                 Daryl Essam and Saori Takeuchi",
  booktitle =    "Distributed Computing, Artificial Intelligence,
                 Bioinformatics, Soft Computing, and Ambient Assisted
                 Living",
  year =         "2009",
  editor =       "Sigeru Omatu and Miguel P. Rocha and Jose Bravo and 
                 Florentino Fernandez and Emilio Corchado and 
                 Andres Bustillo and Juan M. Corchado",
  volume =       "5518",
  series =       "Lecture Notes in Computer Science",
  pages =        "171--178",
  address =      "Salamanca, Spain",
  month =        jun # " 10-12,",
  publisher =    "Springer",
  note =         "10th International Work-Conference on Artificial
                 Neural Networks, IWANN 2009 Workshops",
  keywords =     "genetic algorithms, genetic programming",
  isbn13 =       "978-3-642-02480-1",
  DOI =          "doi:10.1007/978-3-642-02481-8_24",
  abstract =     "Symbolic Regression is one of the most important
                 applications of Genetic Programming, but these
                 applications suffer from one of the key issues in
                 Genetic Programming, namely bloat - the uncontrolled
                 growth of ineffective code segments, which do not
                 contribute to the value of the function evolved, but
                 complicate the evolutionary proces, and at minimum
                 greatly increase the cost of evaluation. For a variety
                 of reasons, reliable techniques to remove bloat are
                 highly desirable - to simplify the solutions generated
                 at the end of runs, so that there is some chance of
                 understanding them, to permit systematic study of the
                 evolution of the effective core of the genotype, or
                 even to perform simplification of expressions during
                 the course of a run. This paper introduces an
                 alternative approach, Equivalent Decision
                 Simplification, in which subtrees are evaluated over
                 the set of regression points; if the subtrees evaluate
                 to the same values as known simple subtrees, they are
                 replaced. The effectiveness of the proposed method is
                 confirmed by computer simulation taking simple Symbolic
                 Regression problems as examples.",
  notes =        "see also \cite{journals/jaciii/MoriMHET09} (23) Osaka
                 Prefecture University, Osaka, Japan (24) Structural
                 Complexity Laboratory, Seoul National University,
                 Seoul, Korea (25) School of Information Technology and
                 Elec. Eng., University of New South Wales ADFA,
                 Canberra, Australia (26) Mitsubishi Electric
                 Corporation, Tokyo, Japan",
}

Genetic Programming entries for Naoki Mori R I (Bob) McKay Nguyen Xuan Hoai Daryl Essam Saori Takeuchi

Citations