Name
Abstract | ||
|---|---|---|
While tree-based Genetic Programming is often used with crossover, Cartesian Genetic Programming is mostly used only with mutation as genetic operator. In this paper, a new crossover technique is introduced which recombines subgraphs of two selected graphs. Experiments on symbolic regression, boolean functions and image operator design problems indicate that the use of the subgraph crossover improves the search performance of Cartesian Genetic Programming. A preliminary comparison to a former proposed crossover technique indicates that the subgraph crossover performs better on our tested problems. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-55696-3_19 | GENETIC PROGRAMMING, EUROGP 2017 |
Keywords | Field | DocType |
Cartesian Genetic Programming, Crossover, Recombination | Boolean function,Genetic operator,Computer science,Induced subgraph isomorphism problem,Genetic programming,Theoretical computer science,Artificial intelligence,Operator (computer programming),Symbolic regression,Subgraph isomorphism problem,Crossover,Algorithm,Machine learning | Conference |
Volume | ISSN | Citations |
10196 | 0302-9743 | 3 |
PageRank | References | Authors |
0.44 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Kalkreuth | 1 | 3 | 0.78 |
| Günter Rudolph | 2 | 219 | 48.59 |
| Andre Droschinsky | 3 | 9 | 2.68 |