Using subtree crossover distance to investigate genetic programming dynamics

被引:0
|
作者
Vanneschi, Leonardo [1 ]
Gustafson, Steven
Mauri, Giancarlo
机构
[1] Univ Milan, DISCo, I-20126 Milan, Italy
[2] Univ Nottingham, Sch Comp Sci & IT, Nottingham NG8 1BB, England
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To analyse various properties of the search process of genetic programming it is useful to quantify the distance between two individuals. Using operator-based distance measures can make this analysis more accurate and reliable than using distance measures which have no relationship with the genetic operators. This paper extends a recent definition of a distance measure based on subtree crossover for genetic programming. Empirical studies are presented that show the suitability of this measure to dynamically calculate the fitness distance correlation coefficient during the evolution, to construct a fitness sharing system for genetic programming and to measure genotypic diversity in the population. These experiments confirm the accuracy of the new measure and its consistency with the subtree crossover genetic operator.
引用
收藏
页码:238 / 249
页数:12
相关论文
共 50 条
  • [1] Operator-based distance for genetic programming: Subtree crossover distance
    Gustafson, S
    Vanneschi, L
    [J]. GENETIC PROGRAMMING, PROCEEDINGS, 2005, 3447 : 178 - 189
  • [2] Subtree semantic geometric crossover for genetic programming
    Quang Uy Nguyen
    Tuan Anh Pham
    Xuan Hoai Nguyen
    McDermott, James
    [J]. GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 2016, 17 (01) : 25 - 53
  • [3] Subtree semantic geometric crossover for genetic programming
    Quang Uy Nguyen
    Tuan Anh Pham
    Xuan Hoai Nguyen
    James McDermott
    [J]. Genetic Programming and Evolvable Machines, 2016, 17 : 25 - 53
  • [4] General schema theory for genetic programming with subtree-swapping crossover
    Poli, R
    [J]. GENETIC PROGRAMMING, PROCEEDINGS, 2001, 2038 : 143 - 159
  • [5] Best SubTree Genetic Programming
    Muntean, Oana
    Diosan, Laura
    Oltean, Mihai
    [J]. GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 1667 - 1673
  • [6] General schema theory for genetic programming with subtree-swapping crossover: Part II
    Poli, R
    McPhee, NF
    [J]. EVOLUTIONARY COMPUTATION, 2003, 11 (02) : 169 - 206
  • [7] General schema theory for genetic programming with subtree-swapping crossover: Part I
    Poli, R
    McPhee, NF
    [J]. EVOLUTIONARY COMPUTATION, 2003, 11 (01) : 53 - 66
  • [8] Crossover-based tree distance in genetic programming
    Gustafson, Steven
    Vanneschi, Leonardo
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (04) : 506 - 524
  • [9] Alternatives in subtree caching for genetic programming
    Keijzer, M
    [J]. GENETIC PROGRAMMING, PROCEEDINGS, 2004, 3003 : 328 - 337
  • [10] Solving the even parity problems using best SubTree genetic programming
    Muntean, Oana
    Diosan, Laura
    Oltean, Mihai
    [J]. NASA/ESA CONFERENCE ON ADAPTIVE HARDWARE AND SYSTEMS, PROCEEDINGS, 2007, : 511 - +