Fast parallel algorithms for the unit cost editing distance between trees
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Effects of locality in individual and population evolution
Advances in genetic programming
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
The royal tree problem, a benchmark for single and multiple population genetic programming
Advances in genetic programming
Foundations of genetic programming
Foundations of genetic programming
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Fitness Distance Correlation and Ridge Functions
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Fitness Distance Correlation And Problem Difficulty For Genetic Programming
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Metric for Genetic Programs and Fitness Sharing
Proceedings of the European Conference on Genetic Programming
Proceedings of the European Conference on Genetic Programming
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Redundant representations in evolutionary computation
Evolutionary Computation
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Evolutionary Computation
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
Neutrality: a necessity for self-adaptation
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Sustaining diversity using behavioral information distance
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Limitations of the fitness-proportional negative slope coefficient as a difficulty measure
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
An Empirical Investigation of How Degree Neutrality Affects GP Search
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Towards Understanding the Effects of Locality in GP
MICAI '09 Proceedings of the 2009 Eighth Mexican International Conference on Artificial Intelligence
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Fitness distance correlation in structural mutation genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
A comprehensive view of fitness landscapes with neutrality and fitness clouds
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
The effects of constant neutrality on performance and problem hardness in GP
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
A Field Guide to Genetic Programming
A Field Guide to Genetic Programming
Towards an understanding of locality in genetic programming
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Linear Genetic Programming
Some steps towards understanding how neutrality affects evolutionary search
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
On the locality of grammatical evolution
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
A comparison of predictive measures of problem difficulty inevolutionary algorithms
IEEE Transactions on Evolutionary Computation
Crossover-Based Tree Distance in Genetic Programming
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Information Theory
An ecological approach to measuring locality in linear genotype to phenotype maps
EuroGP'12 Proceedings of the 15th European conference on Genetic Programming
On the roles of semantic locality of crossover in genetic programming
Information Sciences: an International Journal
Searching for novel clustering programs
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Recent advances in problem understanding: changes in the landscape a year on
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A methodology for user directed search in evolutionary design
Genetic Programming and Evolvable Machines
Graph grammars for evolutionary 3D design
Genetic Programming and Evolvable Machines
Hi-index | 0.00 |
A mapping is local if it preserves neighbourhood. In Evolutionary Computation, locality is generally described as the property that neighbouring genotypes correspond to neighbouring phenotypes. A representation has high locality if most genotypic neighbours are mapped to phenotypic neighbours. Locality is seen as a key element in performing effective evolutionary search. It is believed that a representation that has high locality will perform better in evolutionary search and the contrary is true for a representation that has low locality. When locality was introduced, it was the genotype-phenotype mapping in bitstring-based Genetic Algorithms which was of interest; more recently, it has also been used to study the same mapping in Grammatical Evolution. To our knowledge, there are few explicit studies of locality in Genetic Programming (GP). The goal of this paper is to shed some light on locality in GP and use it as an indicator of problem difficulty. Strictly speaking, in GP the genotype and the phenotype are not distinct. We attempt to extend the standard quantitative definition of genotype-phenotype locality to the genotype-fitness mapping by considering three possible definitions. We consider the effects of these definitions in both continuous- and discrete-valued fitness functions. We compare three different GP representations (two of them induced by using different function sets and the other using a slightly different GP encoding) and six different mutation operators. Results indicate that one definition of locality is better in predicting performance.