%0 Conference Paper %1 eurogp07:shin %A Shin, Jungseok %A Kang, Moonyoung %A McKay, Bob %A Nguyen, Xuan %A Hoang, Tuan-Hao %A Mori, Naoki %A Essam, Daryl %B Proceedings of the 10th European Conference on Genetic Programming %C Valencia, Spain %D 2007 %E Ebner, Marc %E O'Neill, Michael %E Ekárt, Anikó %E Vanneschi, Leonardo %E Esparcia-Alcázar, Anna Isabel %I Springer %K algorithms, genetic programming %P 251--260 %R doi:10.1007/978-3-540-71605-1_23 %T Analysing the Regularity of Genomes using Compression and Expression Simplification %V 4445 %X We propose expression simplification and tree compression as aids in understanding the evolution of regular structure in Genetic Programming individuals. We apply the analysis to two previously-published algorithms, which aimed to promote regular and repeated structure. One relies on subtree duplication operators, the other uses repeated evaluation during a developmental process. Both successfully generated solutions to difficult problems, their success being ascribed to promotion of regular structure. Our analysis modifies this ascription: the evolution of regular structure is more complex than anticipated, and the success of the techniques may have arisen from a combination of promotion of regularity, and other, so far unidentified, effects. %@ 3-540-71602-5

@inproceedings{eurogp07:shin, abstract = {We propose expression simplification and tree compression as aids in understanding the evolution of regular structure in Genetic Programming individuals. We apply the analysis to two previously-published algorithms, which aimed to promote regular and repeated structure. One relies on subtree duplication operators, the other uses repeated evaluation during a developmental process. Both successfully generated solutions to difficult problems, their success being ascribed to promotion of regular structure. Our analysis modifies this ascription: the evolution of regular structure is more complex than anticipated, and the success of the techniques may have arisen from a combination of promotion of regularity, and other, so far unidentified, effects.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {Valencia, Spain}, author = {Shin, Jungseok and Kang, Moonyoung and McKay, Bob and Nguyen, Xuan and Hoang, Tuan-Hao and Mori, Naoki and Essam, Daryl}, biburl = {https://www.bibsonomy.org/bibtex/25620c1766ce3a4442081b8ac11ebfc64/brazovayeye}, booktitle = {Proceedings of the 10th European Conference on Genetic Programming}, doi = {doi:10.1007/978-3-540-71605-1_23}, editor = {Ebner, Marc and O'Neill, Michael and Ek\'art, Anik\'o and Vanneschi, Leonardo and Esparcia-Alc\'azar, Anna Isabel}, interhash = {ce9bbf18ce090033ef4813bfd3c7c0f1}, intrahash = {5620c1766ce3a4442081b8ac11ebfc64}, isbn = {3-540-71602-5}, isbn13 = {978-3-540-71602-0}, keywords = {algorithms, genetic programming}, month = {11 - 13 April}, notes = {Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007}, pages = {251--260}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2008-06-19T17:51:38.000+0200}, title = {Analysing the Regularity of Genomes using Compression and Expression Simplification}, volume = 4445, year = 2007 }