基于节点贡献的遗传规划膨胀控制

Proceedings of the 11th Annual conference on Genetic and evolutionary computation Pub Date : 2009-07-08 DOI:10.1145/1569901.1570221

A. Song, Dunhai Chen, Mengjie Zhang

{"title":"基于节点贡献的遗传规划膨胀控制","authors":"A. Song, Dunhai Chen, Mengjie Zhang","doi":"10.1145/1569901.1570221","DOIUrl":null,"url":null,"abstract":"Unnecessary growth in program size is known as bloat problem in Genetic Programming. There are a large number of studies addressing this problem. In this paper, we propose an effective bloat control mechanism which is based on examining the contribution of each function node in the selected programs. Nodes without contribution will be removed before generating offspring. The results show that the method can significantly reduce program size without compromising fitness. Furthermore it speeds up evolution processes because of the saving in evaluation costs.","PeriodicalId":193093,"journal":{"name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","volume":"129 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Bloat control in genetic programming by evaluating contribution of nodes\",\"authors\":\"A. Song, Dunhai Chen, Mengjie Zhang\",\"doi\":\"10.1145/1569901.1570221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unnecessary growth in program size is known as bloat problem in Genetic Programming. There are a large number of studies addressing this problem. In this paper, we propose an effective bloat control mechanism which is based on examining the contribution of each function node in the selected programs. Nodes without contribution will be removed before generating offspring. The results show that the method can significantly reduce program size without compromising fitness. Furthermore it speeds up evolution processes because of the saving in evaluation costs.\",\"PeriodicalId\":193093,\"journal\":{\"name\":\"Proceedings of the 11th Annual conference on Genetic and evolutionary computation\",\"volume\":\"129 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th Annual conference on Genetic and evolutionary computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1569901.1570221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1569901.1570221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

在遗传规划中，程序大小的不必要增长被称为膨胀问题。有大量的研究针对这个问题。在本文中，我们提出了一种有效的膨胀控制机制，该机制基于检查所选程序中每个功能节点的贡献。没有贡献的节点将在产生后代之前被移除。结果表明，该方法可以在不影响适应度的情况下显著减小程序大小。此外，由于节省了评估成本，它加快了进化过程。

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

查看原文本刊更多论文

Bloat control in genetic programming by evaluating contribution of nodes

Unnecessary growth in program size is known as bloat problem in Genetic Programming. There are a large number of studies addressing this problem. In this paper, we propose an effective bloat control mechanism which is based on examining the contribution of each function node in the selected programs. Nodes without contribution will be removed before generating offspring. The results show that the method can significantly reduce program size without compromising fitness. Furthermore it speeds up evolution processes because of the saving in evaluation costs.

求助全文

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

来源期刊

Proceedings of the 11th Annual conference on Genetic and evolutionary computation

自引率

0.00%

发文量