Operator-Based distance for genetic programming: subtree crossover distance

  • Authors:
  • Steven Gustafson;Leonardo Vanneschi

  • Affiliations:
  • School of Computer Science & IT, University of Nottingham, Nottingham, United Kingdom;Dipartimento di Informatica, Sistemistica e Comunicazione (DISCo), University of Milano-Bicocca, Milano, Italy

  • Venue:
  • EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance measures is a crucial point for analytical measures of problem difficulty, such as fitness distance correlation, and for measures of population diversity, such as entropy or variance. The contribution of this paper is the exploration of possible definitions and approximations of operator-based edit distance measures. In particular, we focus on the subtree crossover operator. An empirical study is presented to illustrate the features of an operator-based distance. This paper makes progress toward improved algorithmic analysis by using appropriate measures of distance and similarity.