O. Muntean, L. Diosan, and M. Oltean. GECCO '07: Proceedings of the 9th annual conference on
Genetic and evolutionary computation, 2, page 1667--1673. London, ACM Press, (7-11 July 2007)
Abstract
The result of the program encoded into a Genetic
Programming (GP) tree is usually returned by the root
of that tree. However, this is not a general strategy.
In this paper we present and investigate a new variant
where the best subtree is chosen to provide the
solution of the problem. The other nodes (not belonging
to the best subtree) are deleted. This will reduce the
size of the chromosome in those cases where its best
subtree is different from the entire tree. We have
tested this strategy on a wide range of regression and
classification problems. Numerical experiments have
shown that the proposed approach can improve both the
search speed and the quality of results.
GECCO '07: Proceedings of the 9th annual conference on
Genetic and evolutionary computation
year
2007
month
7-11 July
pages
1667--1673
publisher
ACM Press
volume
2
organisation
ACM SIGEVO (formerly ISGEC)
publisher_address
New York, NY, USA
isbn13
978-1-59593-697-4
notes
GECCO-2007 A joint meeting of the sixteenth
international conference on genetic algorithms
(ICGA-2007) and the twelfth annual genetic programming
conference (GP-2007).
ACM Order Number 910071
%0 Conference Paper
%1 1277287
%A Muntean, Oana
%A Diosan, Laura
%A Oltean, Mihai
%B GECCO '07: Proceedings of the 9th annual conference on
Genetic and evolutionary computation
%C London
%D 2007
%E Thierens, Dirk
%E Beyer, Hans-Georg
%E Bongard, Josh
%E Branke, Jurgen
%E Clark, John Andrew
%E Cliff, Dave
%E Congdon, Clare Bates
%E Deb, Kalyanmoy
%E Doerr, Benjamin
%E Kovacs, Tim
%E Kumar, Sanjeev
%E Miller, Julian F.
%E Moore, Jason
%E Neumann, Frank
%E Pelikan, Martin
%E Poli, Riccardo
%E Sastry, Kumara
%E Stanley, Kenneth Owen
%E Stutzle, Thomas
%E Watson, Richard A
%E Wegener, Ingo
%I ACM Press
%K algorithms, genetic programming, regression, subtree
%P 1667--1673
%T Best SubTree genetic programming
%U http://doi.acm.org/10.1145/1276958.1277287
%V 2
%X The result of the program encoded into a Genetic
Programming (GP) tree is usually returned by the root
of that tree. However, this is not a general strategy.
In this paper we present and investigate a new variant
where the best subtree is chosen to provide the
solution of the problem. The other nodes (not belonging
to the best subtree) are deleted. This will reduce the
size of the chromosome in those cases where its best
subtree is different from the entire tree. We have
tested this strategy on a wide range of regression and
classification problems. Numerical experiments have
shown that the proposed approach can improve both the
search speed and the quality of results.
@inproceedings{1277287,
abstract = {The result of the program encoded into a Genetic
Programming (GP) tree is usually returned by the root
of that tree. However, this is not a general strategy.
In this paper we present and investigate a new variant
where the best subtree is chosen to provide the
solution of the problem. The other nodes (not belonging
to the best subtree) are deleted. This will reduce the
size of the chromosome in those cases where its best
subtree is different from the entire tree. We have
tested this strategy on a wide range of regression and
classification problems. Numerical experiments have
shown that the proposed approach can improve both the
search speed and the quality of results.},
added-at = {2008-06-19T17:46:40.000+0200},
address = {London},
author = {Muntean, Oana and Diosan, Laura and Oltean, Mihai},
biburl = {https://www.bibsonomy.org/bibtex/2655107bcc39ab13047dad809d3274e45/brazovayeye},
booktitle = {GECCO '07: Proceedings of the 9th annual conference on
Genetic and evolutionary computation},
editor = {Thierens, Dirk and Beyer, Hans-Georg and Bongard, Josh and Branke, Jurgen and Clark, John Andrew and Cliff, Dave and Congdon, Clare Bates and Deb, Kalyanmoy and Doerr, Benjamin and Kovacs, Tim and Kumar, Sanjeev and Miller, Julian F. and Moore, Jason and Neumann, Frank and Pelikan, Martin and Poli, Riccardo and Sastry, Kumara and Stanley, Kenneth Owen and Stutzle, Thomas and Watson, Richard A and Wegener, Ingo},
interhash = {83916fbd45267b4a85c17f70a86468c7},
intrahash = {655107bcc39ab13047dad809d3274e45},
isbn13 = {978-1-59593-697-4},
keywords = {algorithms, genetic programming, regression, subtree},
month = {7-11 July},
notes = {GECCO-2007 A joint meeting of the sixteenth
international conference on genetic algorithms
(ICGA-2007) and the twelfth annual genetic programming
conference (GP-2007).
ACM Order Number 910071},
organisation = {ACM SIGEVO (formerly ISGEC)},
pages = {1667--1673},
publisher = {ACM Press},
publisher_address = {New York, NY, USA},
timestamp = {2008-06-19T17:47:48.000+0200},
title = {Best SubTree genetic programming},
url = {http://doi.acm.org/10.1145/1276958.1277287},
volume = 2,
year = 2007
}