树相邻语法引导遗传规划中基于语义的交叉

The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI:10.1109/RIVF.2013.6719883

D. N. Phong, Nguyen Quang Uy, N. X. Hoai, N. Thuy

{"title":"树相邻语法引导遗传规划中基于语义的交叉","authors":"D. N. Phong, Nguyen Quang Uy, N. X. Hoai, N. Thuy","doi":"10.1109/RIVF.2013.6719883","DOIUrl":null,"url":null,"abstract":"In this paper we propose an approach to implementing new semantic based crossover operators in Tree-Adjoining Grammar Guided Genetic Programming (TAG3P). The design of the new crossover operators is based on the non-fixed arity (also called feasibility) property of TAG-based representation in TAG3P. The new operators are then tested on a family of benchmark symbolic regression problems and compared with standard Genetic programming (GP), GP with Semantic Similarity based Crossover (SSC), and TAG3P. The results show that TAG3P with the new operators significantly outperforms GP, GP with SSC, and TAG3P.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Semantic based crossovers in Tree-Adjoining Grammar Guided Genetic Programming\",\"authors\":\"D. N. Phong, Nguyen Quang Uy, N. X. Hoai, N. Thuy\",\"doi\":\"10.1109/RIVF.2013.6719883\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose an approach to implementing new semantic based crossover operators in Tree-Adjoining Grammar Guided Genetic Programming (TAG3P). The design of the new crossover operators is based on the non-fixed arity (also called feasibility) property of TAG-based representation in TAG3P. The new operators are then tested on a family of benchmark symbolic regression problems and compared with standard Genetic programming (GP), GP with Semantic Similarity based Crossover (SSC), and TAG3P. The results show that TAG3P with the new operators significantly outperforms GP, GP with SSC, and TAG3P.\",\"PeriodicalId\":121216,\"journal\":{\"name\":\"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2013.6719883\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2013.6719883","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种在树相邻语法引导遗传规划(TAG3P)中实现新的基于语义的交叉算子的方法。新的交叉算子的设计是基于TAG3P中基于tag的表示的不固定性(也称为可行性)的特性。然后在一系列基准符号回归问题上对新算子进行了测试，并与标准遗传规划(GP)、基于语义相似度的交叉(SSC) GP和TAG3P进行了比较。结果表明，使用新运营商的TAG3P显著优于GP、GP与SSC和TAG3P。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Semantic based crossovers in Tree-Adjoining Grammar Guided Genetic Programming

In this paper we propose an approach to implementing new semantic based crossover operators in Tree-Adjoining Grammar Guided Genetic Programming (TAG3P). The design of the new crossover operators is based on the non-fixed arity (also called feasibility) property of TAG-based representation in TAG3P. The new operators are then tested on a family of benchmark symbolic regression problems and compared with standard Genetic programming (GP), GP with Semantic Similarity based Crossover (SSC), and TAG3P. The results show that TAG3P with the new operators significantly outperforms GP, GP with SSC, and TAG3P.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)

自引率

0.00%

发文量