%0 Book Section %1 hoang:2005:GPTP %A Hoang, Tuan Hao %A Hoai, Nguyen Xuan %A McKay, R. I. (Bob) %A Essam, Daryl %B Genetic Programming Theory and Practice III %C Ann Arbor %D 2005 %E Yu, Tina %E Riolo, Rick L. %E Worzel, Bill %I Springer %K adjoining algorithms, deletion, ecological genetic grammar grammar, guided, insertion, local modelling, programming, search, series time tree %P 159--175 %T The Importance pf Local Search: A Grammar Based Approach to Environmental Time Series Modelling %V 9 %X Standard Genetic Programming operators are highly disruptive, with the concomitant risk that it may be difficult to converge to an optimal structure. The Tree Adjoining Grammar (TAG) formalism provides a more flexible Genetic Programming tree representation which supports a wide range of operators while retaining the advantages of tree-based representation. In particular, minimal-change point insertion and deletion operators may be defined. Previous work has shown that point insertion and deletion, used as local search operators, can dramatically reduce search effort in a range of standard problems. Here, we evaluate the effect of local search with these operators on a real-World ecological time series modelling problem. For the same search effort, TAG-based GP with the local search operators generates solutions with significantly lower training set error. The results are equivocal on test set error, local search generating larger individuals which generalise only a little better than the less accurate solutions given by the original algorithm. %& 11 %@ 0-387-28110-X

@incollection{hoang:2005:GPTP, abstract = {Standard Genetic Programming operators are highly disruptive, with the concomitant risk that it may be difficult to converge to an optimal structure. The Tree Adjoining Grammar (TAG) formalism provides a more flexible Genetic Programming tree representation which supports a wide range of operators while retaining the advantages of tree-based representation. In particular, minimal-change point insertion and deletion operators may be defined. Previous work has shown that point insertion and deletion, used as local search operators, can dramatically reduce search effort in a range of standard problems. Here, we evaluate the effect of local search with these operators on a real-World ecological time series modelling problem. For the same search effort, TAG-based GP with the local search operators generates solutions with significantly lower training set error. The results are equivocal on test set error, local search generating larger individuals which generalise only a little better than the less accurate solutions given by the original algorithm.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Ann Arbor}, author = {Hoang, Tuan Hao and Hoai, Nguyen Xuan and McKay, R. I. (Bob) and Essam, Daryl}, biburl = {https://www.bibsonomy.org/bibtex/2e6cc7558c4ffae6881f7d7187a542fa7/brazovayeye}, booktitle = {Genetic Programming Theory and Practice {III}}, chapter = 11, editor = {Yu, Tina and Riolo, Rick L. and Worzel, Bill}, interhash = {543292944f2392caeb0f78b8a0a04630}, intrahash = {e6cc7558c4ffae6881f7d7187a542fa7}, isbn = {0-387-28110-X}, keywords = {adjoining algorithms, deletion, ecological genetic grammar grammar, guided, insertion, local modelling, programming, search, series time tree}, month = {12-14 May}, notes = {part of \cite{yu:2005:GPTP} Published Jan 2006 after the workshop}, pages = {159--175}, publisher = {Springer}, series = {Genetic Programming}, size = {17 pages}, timestamp = {2008-06-19T17:41:36.000+0200}, title = {The Importance pf Local Search: {A} Grammar Based Approach to Environmental Time Series Modelling}, volume = 9, year = 2005 }