.png){kind=icon}
Return
Crossover-based tree distance in genetic programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2008.915993.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In evolutionary algorithms, distance metrics between solutions are often useful for many aspects of guiding and understanding the search process. A good distance measure should reflect the capability of the search: if two solutions are found to be close in distance, or similarity, they should also be close in the search algorithm sense, i.e., the variation operator used to traverse the search space should easily transform one of them into the other. This paper explores such a distance for genetic programming syntax trees. Distance measures are discussed, defined and empirically investigated. The value of such measures is then validated in the context of analysis (fitness-distance correlation is analyzed during population evolution) as well as guiding search (results are improved using our measure in a fitness sharing algorithm) and diversity (new insights are obtained as compared with standard measures).
Keywords:
distance measures
diversity
genetic programming (GP)
operators
Journal
IF:
12
Papers:
1.9K
Citations:
2.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
no more
no more