@inbook{fd0561c43ff245d3a8b4d6ff9711fcfa,

title = "How far is it from here to there? A distance that is coherent with GP operators",

abstract = "The distance between pairs of individuals is a useful concept in the study of evolutionary algorithms. It is particularly useful to define a distance which is coherent with, i.e. related to, the action of a particular operator. We present the first formal, general definition of this operator-distance coherence. We also propose a new distance function, based on the multi-step transition probability (MSTP), that is coherent with any GP operator for which the one-step transition probability (1STP) between individuals can be defined. We give an algorithm for 1STP in the case of subtree mutation. Because MSTP is useful in GP investigations, but impractical to compute, we evaluate a variety of means to approximate it. We show that some syntactic distance measures give good approximations, and attempt to combine them to improve the approximation using a GP symbolic regression method. We conclude that 1STP itself is a sufficient indicator of MSTP for subtree mutation.",

keywords = "CROSSOVER",

author = "Leonardo Vanneschi",

note = "ISI Document Delivery No.: BZK01 Times Cited: 0 Cited Reference Count: 19 McDermott, James O'Reilly, Una-May Vanneschi, Leonardo Veeramachaneni, Kalyan Proceedings Paper 14th European Conference on Genetic Programming Apr 27-29, 2011 Torino, ITALY Human Genet Fdn Torino, Univ Torino, Sch Biotechnol, Univ Torino, Mol Biotechnol Ctr, Univ Torino, Museum Human Anat Luigi Rolando, Univ Torino, Museum Criminal Anthropol Cesare Lombroso Heidelberger platz 3, d-14197 berlin, germany",

year = "2011",

month = jan,

day = "1",

doi = "10.1007/978-3-642-20407-4_17",

language = "Unknown",

isbn = "978-3-642-20406-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag",

pages = "190--202",

booktitle = "Genetic Programming",

}