Solving Symbolic Regression Problems using Incremental
Evaluation in Genetic Programming
T. Hoang, D. Essam, R. McKay, and X. Nguyen. Proceedings of the 2006 IEEE Congress on Evolutionary
Computation, page 7487--7494. Vancouver, IEEE Press, (6-21 July 2006)
Abstract
we show some experimental results using Incremental
Evaluation with Tree Adjoining Grammar Guided Genetic
Programming (DEVTAG) on two symbolic regression
problems, a benchmark polynomial fitting problem in
genetic programming, and a Fourier series problem
(saw-tooth problem). In our pilot study, we compare
results with standard Genetic Programming (GP) and the
original Tree Adjoining Grammar Guided Genetic
Programming (TAG3P). Our results on the two problems
are good, outperforming both standard GP and the
original TAG3P.
%0 Conference Paper
%1 Hoang:2006:CEC
%A Hoang, Tuan-Hao
%A Essam, Daryl
%A McKay, R. I. (Bob)
%A Nguyen, Xuan Hoai
%B Proceedings of the 2006 IEEE Congress on Evolutionary
Computation
%C Vancouver
%D 2006
%I IEEE Press
%K algorithms, genetic programming
%P 7487--7494
%T Solving Symbolic Regression Problems using Incremental
Evaluation in Genetic Programming
%U http://seal.tst.adfa.edu.au/~z3106820/publications/cec2006.devtag.pdf
%X we show some experimental results using Incremental
Evaluation with Tree Adjoining Grammar Guided Genetic
Programming (DEVTAG) on two symbolic regression
problems, a benchmark polynomial fitting problem in
genetic programming, and a Fourier series problem
(saw-tooth problem). In our pilot study, we compare
results with standard Genetic Programming (GP) and the
original Tree Adjoining Grammar Guided Genetic
Programming (TAG3P). Our results on the two problems
are good, outperforming both standard GP and the
original TAG3P.
%@ 0-7803-9487-9
@inproceedings{Hoang:2006:CEC,
abstract = {we show some experimental results using Incremental
Evaluation with Tree Adjoining Grammar Guided Genetic
Programming (DEVTAG) on two symbolic regression
problems, a benchmark polynomial fitting problem in
genetic programming, and a Fourier series problem
(saw-tooth problem). In our pilot study, we compare
results with standard Genetic Programming (GP) and the
original Tree Adjoining Grammar Guided Genetic
Programming (TAG3P). Our results on the two problems
are good, outperforming both standard GP and the
original TAG3P.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Vancouver},
author = {Hoang, Tuan-Hao and Essam, Daryl and McKay, R. I. (Bob) and Nguyen, Xuan Hoai},
biburl = {https://www.bibsonomy.org/bibtex/2ac5df48b65b90cc0e9cf6a8e439929de/brazovayeye},
booktitle = {Proceedings of the 2006 IEEE Congress on Evolutionary
Computation},
interhash = {b91813042ec8e74ffec35826b81d876b},
intrahash = {ac5df48b65b90cc0e9cf6a8e439929de},
isbn = {0-7803-9487-9},
keywords = {algorithms, genetic programming},
month = {6-21 July},
notes = {WCCI 2006 - A joint meeting of the IEEE, the EPS, and
the IEE.},
pages = {7487--7494},
publisher = {IEEE Press},
size = {8 pages},
timestamp = {2008-06-19T17:41:36.000+0200},
title = {Solving Symbolic Regression Problems using Incremental
Evaluation in Genetic Programming},
url = {http://seal.tst.adfa.edu.au/~z3106820/publications/cec2006.devtag.pdf},
year = 2006
}