Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Schema theory for genetic programming with one-point crossover and point mutation
Evolutionary Computation
Semantic Aware Crossover for Genetic Programming: The Case for Real-Valued Function Regression
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Approximating geometric crossover in semantic space
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Semantic building blocks in genetic programming
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Medial crossovers for genetic programming
EuroGP'12 Proceedings of the 15th European conference on Genetic Programming
Locally geometric semantic crossover
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
We investigate the properties of locally geometric semantic crossover (LGX), a genetic programming search operator that is approximately semantically geometric on the level of homologous code fragments. For a pair of corresponding loci in the parents, LGX finds a semantically intermediate procedure from a library prepared prior to evolutionary run, and creates an offspring by using such procedure as replacement code. LGX proves superior when compared to standard subtree crossover and other control methods in terms of search convergence, test-set performance, and time required to find a high-quality solution. This paper focuses in particular the impact of homology and program semantic on LGX performance.