Alignment-based genetic programming for real life applications

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)
76 Downloads (Pure)

Abstract

A recent discovery has attracted the attention of many researchers in the field of genetic programming: given individuals with particular characteristics of alignment in the error space, called optimally aligned, it is possible to reconstruct a globally optimal solution. Furthermore, recent preliminary experiments have shown that an indirect search consisting of looking for optimally aligned individuals can have benefits in terms of generalization ability compared to a direct search for optimal solutions. For this reason, defining genetic programming systems that look for optimally aligned individuals is becoming an ambitious and important objective. Nevertheless, the systems that have been introduced so far present important limitations that make them unusable in practice, particularly for complex real-life applications. In this paper, we overcome those limitations, and we present the first usable alignment-based genetic programming system, called nested alignment genetic programming (NAGP). The presented experimental results show that NAGP is able to outperform two of the most recognized state-of-the-art genetic programming systems on four complex real-life applications. The predictive models generated by NAGP are not only more effective than the ones produced by the other studied methods but also significantly smaller and thus more manageable and interpretable.

Original languageEnglish
Pages (from-to)840-851
Number of pages12
JournalSwarm and Evolutionary Computation
Volume44
Issue numberFebruary
Early online date29 Sept 2018
DOIs
Publication statusPublished - Feb 2019

Keywords

  • Alignment
  • Error space
  • Genetic programming
  • Geometric semantic operators
  • Real-life applications

Fingerprint

Dive into the research topics of 'Alignment-based genetic programming for real life applications'. Together they form a unique fingerprint.

Cite this