Visualizing the loss of diversity in genetic programming

被引：17

作者：

Daida, JM ^{[1
]}

Ward, DJ ^{[1
]}

Hilss, AM ^{[1
]}

Long, SL ^{[1
]}

Hodges, MR ^{[1
]}

Kriesel, JT ^{[1
]}

机构：

[1] Ctr Study Complex Syst, Ann Arbor, MI 48109 USA

来源：

CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2004年

关键词：

D O I：

10.1109/CEC.2004.1331037

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper introduces visualization techniques that allow for a multivariate approach in understanding the dynamics that underlie genetic programming (GP). Emphasis is given toward understanding the relationship between problem difficulty and the loss of diversity. The visualizations raise questions about diversity and problem solving efficacy, as well as the role of the initial population in determining solution outcomes.

引用

页码：1225 / 1232

页数：8

共 22 条

[1]

BICKLE T, 1995, ICGA95 P, P9

[2] What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming [J].

Jason M. Daida ;

Robert R. Bertram ;

Stephen A. Stanhope ;

Jonathan C. Khoo ;

Shahbaz A. Chaudhary ;

Omer A. Chaudhri ;

John A. II Polito .

Genetic Programming and Evolvable Machines, 2001, 2 (2) :165-191

[3]

Daida JM, 2003, LECT NOTES COMPUT SC, V2724, P1652

[4]

Daida JM, 2003, LECT NOTES COMPUT SC, V2724, P1639

[5]

DAIDA JM, 1999, ADV GENETIC PROGRAMM, V3, P217

[6]

Fogel D. B., 1998, EVOLUTIONARY COMPUTA, P641

[7] HANDICAPPED INDIVIDUALS IN EVOLUTIONARY PROCESSES [J].

GALAR, R .

BIOLOGICAL CYBERNETICS, 1985, 53 (01) :1-9

[8]

Holland JH, 1992, ADAPTATION NATURAL A, DOI DOI 10.7551/MITPRESS/1090.001.0001

[9]

Kendall G., 2002, P 4 ANN C GEN EV COM, P716

[10]

KIM JJ, 1999, CEC 99, V1, P252

← 1 2 3 →