Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database. / Niehaus, Jens; Igel, Christian; Banzhaf, Wolfgang.

I: Evolutionary Computation, Bind 15, Nr. 2, 2007, s. 199-221.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Niehaus, J, Igel, C & Banzhaf, W 2007, 'Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database', Evolutionary Computation, bind 15, nr. 2, s. 199-221. https://doi.org/10.1162/evco.2007.15.2.199

APA

Niehaus, J., Igel, C., & Banzhaf, W. (2007). Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database. Evolutionary Computation, 15(2), 199-221. https://doi.org/10.1162/evco.2007.15.2.199

Vancouver

Niehaus J, Igel C, Banzhaf W. Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database. Evolutionary Computation. 2007;15(2):199-221. https://doi.org/10.1162/evco.2007.15.2.199

Author

Niehaus, Jens ; Igel, Christian ; Banzhaf, Wolfgang. / Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database. I: Evolutionary Computation. 2007 ; Bind 15, Nr. 2. s. 199-221.

Bibtex

@article{0301f63bcccf476d955ba542ae47231f,
title = "Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database",
abstract = "In this paper we describe the genetic programming system GGP operating on graphs and introduce the notion of graph isomorphisms to explain how they influence the dynamics of GP. It is shown empirically how fitness databases can improve the performance of GP and how mapping graphs to a canonical form can increase these improvements by saving considerable evaluation time.",
author = "Jens Niehaus and Christian Igel and Wolfgang Banzhaf",
year = "2007",
doi = "10.1162/evco.2007.15.2.199",
language = "English",
volume = "15",
pages = "199--221",
journal = "Evolutionary Computation",
issn = "1063-6560",
publisher = "M I T Press",
number = "2",

}

RIS

TY - JOUR

T1 - Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database

AU - Niehaus, Jens

AU - Igel, Christian

AU - Banzhaf, Wolfgang

PY - 2007

Y1 - 2007

N2 - In this paper we describe the genetic programming system GGP operating on graphs and introduce the notion of graph isomorphisms to explain how they influence the dynamics of GP. It is shown empirically how fitness databases can improve the performance of GP and how mapping graphs to a canonical form can increase these improvements by saving considerable evaluation time.

AB - In this paper we describe the genetic programming system GGP operating on graphs and introduce the notion of graph isomorphisms to explain how they influence the dynamics of GP. It is shown empirically how fitness databases can improve the performance of GP and how mapping graphs to a canonical form can increase these improvements by saving considerable evaluation time.

U2 - 10.1162/evco.2007.15.2.199

DO - 10.1162/evco.2007.15.2.199

M3 - Journal article

C2 - 17535139

VL - 15

SP - 199

EP - 221

JO - Evolutionary Computation

JF - Evolutionary Computation

SN - 1063-6560

IS - 2

ER -

ID: 32645869