%0 Conference Paper %1 1068311 %A Luo, Xiao %A Heywood, Malcolm I. %A Zincir-Heywood, A. Nur %B GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation %C Washington DC, USA %D 2005 %E Beyer, Hans-Georg %E O'Reilly, Una-May %E Arnold, Dirk V. %E Banzhaf, Wolfgang %E Blum, Christian %E Bonabeau, Eric W. %E Cantu-Paz, Erick %E Dasgupta, Dipankar %E Deb, Kalyanmoy %E Foster, James A. %E de Jong, Edwin D. %E Lipson, Hod %E Llora, Xavier %E Mancoridis, Spiros %E Pelikan, Martin %E Raidl, Guenther R. %E Soule, Terence %E Tyrrell, Andy M. %E Watson, Jean-Paul %E Zitzler, Eckart %I ACM Press %K Poster, algorithms, architectures, experimentation, genetic languages, linear programming programming, recurrent %P 1787--1788 %T Evolving recurrent models using linear GP %U http://doi.acm.org/10.1145/1068009.1068311 %V 2 %X Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisingly, there is little evidence of the application of such models to problems for prediction. An empirical evaluation is made of a simple recurrent linear GP model over standard prediction problems. %@ 1-59593-010-8

@inproceedings{1068311, abstract = {Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisingly, there is little evidence of the application of such models to problems for prediction. An empirical evaluation is made of a simple recurrent linear GP model over standard prediction problems.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Washington DC, USA}, author = {Luo, Xiao and Heywood, Malcolm I. and Zincir-Heywood, A. Nur}, biburl = {https://www.bibsonomy.org/bibtex/2592d934bdceddd890fddedacd7b2a70f/brazovayeye}, booktitle = {{GECCO 2005}: Proceedings of the 2005 conference on Genetic and evolutionary computation}, editor = {Beyer, Hans-Georg and O'Reilly, Una-May and Arnold, Dirk V. and Banzhaf, Wolfgang and Blum, Christian and Bonabeau, Eric W. and Cantu-Paz, Erick and Dasgupta, Dipankar and Deb, Kalyanmoy and Foster, James A. and {de Jong}, Edwin D. and Lipson, Hod and Llora, Xavier and Mancoridis, Spiros and Pelikan, Martin and Raidl, Guenther R. and Soule, Terence and Tyrrell, Andy M. and Watson, Jean-Paul and Zitzler, Eckart}, interhash = {5db9d8836684e448a3c2aae903839589}, intrahash = {592d934bdceddd890fddedacd7b2a70f}, isbn = {1-59593-010-8}, keywords = {Poster, algorithms, architectures, experimentation, genetic languages, linear programming programming, recurrent}, month = {25-29 June}, notes = {GECCO-2005 A joint meeting of the fourteenth international conference on genetic algorithms (ICGA-2005) and the tenth annual genetic programming conference (GP-2005). ACM Order Number 910052 Even Parity problem, sun spot}, organisation = {ACM SIGEVO (formerly ISGEC)}, pages = {1787--1788}, publisher = {ACM Press}, publisher_address = {New York, NY, 10286-1405, USA}, size = {2 pages}, timestamp = {2008-06-19T17:46:04.000+0200}, title = {Evolving recurrent models using linear {GP}}, url = {http://doi.acm.org/10.1145/1068009.1068311}, volume = 2, year = 2005 }