{"title":"进化连接子基因表达编程:符号回归的新技术","authors":"J. Mwaura, E. Keedwell, A. Engelbrecht","doi":"10.1109/BRICS-CCI-CBIC.2013.22","DOIUrl":null,"url":null,"abstract":"This paper utilises Evolved Linker Gene Expression Programming (EL-GEP), a new variant of Gene Expression Programming (GEP), to solve symbolic regression and sequence induction problems. The new technique was first proposed in [6] to evolve modularity in robotic behaviours. The technique extends the GEP algorithm by incorporating a new alphabetic set (linking set) from which genome linking functions are selected. Further, the EL-GEP algorithm allows the genetic operators to modify the linking functions during the evolution process, thus changing the length of the chromosome during a run. In the current work, EL-GEP has been utilised to solve both symbolic regression and sequence induction problems. The achieved results are compared with those derived from GEP. The results show that EL-GEP is a suitable method for solving optimisation problems.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"190 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Evolved Linker Gene Expression Programming: A New Technique for Symbolic Regression\",\"authors\":\"J. Mwaura, E. Keedwell, A. Engelbrecht\",\"doi\":\"10.1109/BRICS-CCI-CBIC.2013.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper utilises Evolved Linker Gene Expression Programming (EL-GEP), a new variant of Gene Expression Programming (GEP), to solve symbolic regression and sequence induction problems. The new technique was first proposed in [6] to evolve modularity in robotic behaviours. The technique extends the GEP algorithm by incorporating a new alphabetic set (linking set) from which genome linking functions are selected. Further, the EL-GEP algorithm allows the genetic operators to modify the linking functions during the evolution process, thus changing the length of the chromosome during a run. In the current work, EL-GEP has been utilised to solve both symbolic regression and sequence induction problems. The achieved results are compared with those derived from GEP. The results show that EL-GEP is a suitable method for solving optimisation problems.\",\"PeriodicalId\":306195,\"journal\":{\"name\":\"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence\",\"volume\":\"190 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evolved Linker Gene Expression Programming: A New Technique for Symbolic Regression
This paper utilises Evolved Linker Gene Expression Programming (EL-GEP), a new variant of Gene Expression Programming (GEP), to solve symbolic regression and sequence induction problems. The new technique was first proposed in [6] to evolve modularity in robotic behaviours. The technique extends the GEP algorithm by incorporating a new alphabetic set (linking set) from which genome linking functions are selected. Further, the EL-GEP algorithm allows the genetic operators to modify the linking functions during the evolution process, thus changing the length of the chromosome during a run. In the current work, EL-GEP has been utilised to solve both symbolic regression and sequence induction problems. The achieved results are compared with those derived from GEP. The results show that EL-GEP is a suitable method for solving optimisation problems.