Does it Matter Where you Start? A Comparison of Two
Initialisation Strategies for Grammar Guided Genetic
Programming
H. Hao, N. Hoai, and R. McKay. Proceedings of The Second Asian-Pacific Workshop on
Genetic Programming, Cairns, Australia, (6-7 December 2004)
Abstract
we experimentally show that the initialisation process
is very important for Grammar Guided Genetic
Programming (GGGP). In particular, using different
initialization strategies (algorithms) can lead to very
different overall results with GGGP. This is in strong
contrast with results previously reported for standard
Genetic Programming 9. We also show that on the
problems tried, the initialisation algorithm from Tree
Adjoining Grammar Guided Genetic Programming (TAG3P)
helps GGGP improve its performance compared with the
use of the standard initialisation algorithm proposed
in 10, 11
%0 Conference Paper
%1 Hao:2004:aspgp
%A Hao, Hoang Tuan
%A Hoai, Nguyen Xuan
%A McKay, Robert I
%B Proceedings of The Second Asian-Pacific Workshop on
Genetic Programming
%C Cairns, Australia
%D 2004
%E Mckay, R I
%E Cho, Sung-Bae
%K GGGP, TAG, TAG3P algorithms, genetic programming,
%T Does it Matter Where you Start? A Comparison of Two
Initialisation Strategies for Grammar Guided Genetic
Programming
%X we experimentally show that the initialisation process
is very important for Grammar Guided Genetic
Programming (GGGP). In particular, using different
initialization strategies (algorithms) can lead to very
different overall results with GGGP. This is in strong
contrast with results previously reported for standard
Genetic Programming 9. We also show that on the
problems tried, the initialisation algorithm from Tree
Adjoining Grammar Guided Genetic Programming (TAG3P)
helps GGGP improve its performance compared with the
use of the standard initialisation algorithm proposed
in 10, 11
@inproceedings{Hao:2004:aspgp,
abstract = {we experimentally show that the initialisation process
is very important for Grammar Guided Genetic
Programming (GGGP). In particular, using different
initialization strategies (algorithms) can lead to very
different overall results with GGGP. This is in strong
contrast with results previously reported for standard
Genetic Programming [9]. We also show that on the
problems tried, the initialisation algorithm from Tree
Adjoining Grammar Guided Genetic Programming (TAG3P)
helps GGGP improve its performance compared with the
use of the standard initialisation algorithm proposed
in [10, 11]},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Cairns, Australia},
author = {Hao, Hoang Tuan and Hoai, Nguyen Xuan and McKay, Robert I},
biburl = {https://www.bibsonomy.org/bibtex/251d1de8d839f9ca44787d0a5bde2f156/brazovayeye},
booktitle = {Proceedings of The Second Asian-Pacific Workshop on
Genetic Programming},
broken = {http://seal.tst.adfa.edu.au/~z3106820/publications/t.hao-initialpop.pdf},
editor = {Mckay, R I and Cho, Sung-Bae},
interhash = {cce3f67494cca16d70cf6d8a22fda569},
intrahash = {51d1de8d839f9ca44787d0a5bde2f156},
keywords = {GGGP, TAG, TAG3P algorithms, genetic programming,},
month = {6-7 December},
notes = {http://www.itee.adfa.edu.au/~rim/ASPGP/programme.html},
timestamp = {2008-06-19T17:41:36.000+0200},
title = {Does it Matter Where you Start? {A} Comparison of Two
Initialisation Strategies for Grammar Guided Genetic
Programming},
year = 2004
}