Publications


MixItUp Demo - Toggle Filtering AND Logic



A Probabilistic Functional Crossover Operator for Genetic Programming

Proceedings of the 12th annual conference on Genetic and evolutionary computation, , 925-932, 2010


Status: Published

Citations:

Cite: [bibtex]


My Image

Abstract: The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combination of these sub-solutions into larger solutions. This latter property is particularly challenging when recombination is performed on genomes encoded as trees, as crossover events tend to greatly alter the original genomes and therefore greatly reduce the chance of the crossover event being beneficial. A number of crossover operators designed for tree-based genetic encodings have been proposed, but most consider crossing genetic components based on their structural similarity. In this work we introduce a tree-based crossover operator that probabilistically crosses branches based on the behavioral similarity between the branches. It is shown that this method outperforms genetic programming without crossover, random crossover, and a deterministic form of the crossover operator in the symbolic regression domain.


**May not be in order

[edit database entry]
Stacks Image 525289
(null)

  • Stacks Image 525371
    (null)
  • Stacks Image 525379
    (null)
  • Stacks Image 525375
    (null)


Stacks Image 525306
(null)

  • Stacks Image 525319
    (null)
  • Stacks Image 525314
    (null)
  • Stacks Image 525310
    (null)


Stacks Image 525327
(null)

  • Stacks Image 525331
    (null)
  • Stacks Image 525335
    (null)
  • Stacks Image 525339
    (null)


Stacks Image 525346
(null)

  • Stacks Image 525350
    (null)
  • Stacks Image 525354
    (null)
  • Stacks Image 525358
    (null)


Stacks Image 525386
(null)

  • Stacks Image 525390
    (null)
  • Stacks Image 525394
    (null)
  • Stacks Image 525398
    (null)