进化连接子基因表达编程:符号回归的新技术

J. Mwaura, E. Keedwell, A. Engelbrecht
{"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":null,"pages":null},"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\":null,\"pages\":null},\"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}
引用次数: 2

摘要

本文利用基因表达编程(GEP)的一种新变体——进化链接子基因表达编程(EL-GEP)来解决符号回归和序列诱导问题。这项新技术最初是在2010年提出的,旨在发展机器人行为的模块化。该技术通过加入一个新的字母集(连接集)来扩展GEP算法,从中选择基因组连接功能。此外,EL-GEP算法允许遗传算子在进化过程中修改连接功能,从而在运行过程中改变染色体的长度。在目前的工作中,EL-GEP已被用于解决符号回归和序列归纳问题。所得结果与GEP计算结果进行了比较。结果表明,EL-GEP是求解优化问题的一种合适的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Computer Simulations of Small Societies Under Social Transfer Systems Modeling of Reasoning in Intelligent Systems by Means of Integration of Methods Based on Case-Based Reasoning and Inductive Notions Formation Bi-dimensional Neural Equalizer Applied to Optical Receiver A New Algorithm Based on Differential Evolution for Combinatorial Optimization A Cooperative Parallel Particle Swarm Optimization for High-Dimension Problems on GPUs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1