%0 Conference Paper %1 1277313 %A Wyns, Bart %A Boullart, Luc %A De Smedt, Pieter Jan %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 Poster, algorithms, ant, artificial bias, genetic programming: representational robustness %P 1763--1763 %T Limiting code growth to improve robustness in tree-based genetic programming %U http://doi.acm.org/10.1145/1276958.1277313 %V 2 %X In this paper we analyse the composition of the function set of the artificial ant problem to define new training and testing trails similar to the Santa Fe trail. Cross-validation is used in applications where large amounts of data are available. We also use a semantically driven growth limiter to reduce program size and check if growth reduction could lead to increased test performance.

@inproceedings{1277313, abstract = {In this paper we analyse the composition of the function set of the artificial ant problem to define new training and testing trails similar to the Santa Fe trail. Cross-validation is used in applications where large amounts of data are available. We also use a semantically driven growth limiter to reduce program size and check if growth reduction could lead to increased test performance.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {London}, author = {Wyns, Bart and Boullart, Luc and {De Smedt}, Pieter Jan}, biburl = {https://www.bibsonomy.org/bibtex/207bbb3fc7877e412110fcdc2f1596273/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 = {b1d12ebbfc619a662ec592784261709f}, intrahash = {07bbb3fc7877e412110fcdc2f1596273}, isbn13 = {978-1-59593-697-4}, keywords = {Poster, algorithms, ant, artificial bias, genetic programming: representational robustness}, 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 = {1763--1763}, publisher = {ACM Press}, publisher_address = {New York, NY, USA}, timestamp = {2008-06-19T17:54:35.000+0200}, title = {Limiting code growth to improve robustness in tree-based genetic programming}, url = {http://doi.acm.org/10.1145/1276958.1277313}, volume = 2, year = 2007 }