• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

代码增长和简约压力对遗传编程中种群的影响。

Effects of code growth and parsimony pressure on populations in genetic programming.

作者信息

Soule T, Foster J A

机构信息

Computer Science Dept., St. Cloud State University, Engineering and Computing Center, MN 56301-4498, USA.

出版信息

Evol Comput. 1998 Winter;6(4):293-309.

PMID:10030466
Abstract

Parsimony pressure, the explicit penalization of larger programs, has been increasingly used as a means of controlling code growth in genetic programming. However, in many cases parsimony pressure degrades the performance of the genetic program. In this paper we show that poor average results with parsimony pressure are a result of "failed" populations that overshadow the results of populations that incorporate parsimony pressure successfully. Additionally, we show that the effect of parsimony pressure can be measured by calculating the relationship between program size and performance within the population. This measure can be used as a partial indicator of success or failure for individual populations.

摘要

简约压力,即对更大程序的明确惩罚,已越来越多地被用作控制遗传编程中代码增长的一种手段。然而,在许多情况下,简约压力会降低遗传程序的性能。在本文中,我们表明,使用简约压力时平均结果不佳是由于“失败”的种群掩盖了成功纳入简约压力的种群的结果。此外,我们表明,可以通过计算种群内程序大小与性能之间的关系来衡量简约压力的效果。这种度量可以用作单个种群成功或失败的部分指标。

相似文献

1
Effects of code growth and parsimony pressure on populations in genetic programming.代码增长和简约压力对遗传编程中种群的影响。
Evol Comput. 1998 Winter;6(4):293-309.
2
Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming.代码增长和简约压力对遗传编程中种群的影响。
Evol Comput. 1999 Feb 3;6(4):293-309.
3
Code growth, explicitly defined introns, and alternative selection schemes.编码增长、明确界定的内含子和替代选择方案。
Evol Comput. 1998 Winter;6(4):339-60.
4
Modification point depth and genome growth in genetic programming.遗传编程中的修改点深度与基因组增长
Evol Comput. 2003 Spring;11(1):67-106. doi: 10.1162/106365603321829014.
5
Code Growth, Explicitly Defined Introns, and Alternative Selection Schemes.编码增长、明确定义的内含子及替代选择方案。
Evol Comput. 1999 Feb 3;6(4):339-360.
6
A study of fitness distance correlation as a difficulty measure in genetic programming.一项关于适应度距离相关性作为遗传编程中难度度量的研究。
Evol Comput. 2005 Summer;13(2):213-39. doi: 10.1162/1063656054088549.
7
The standard genetic code enhances adaptive evolution of proteins.标准遗传密码增强了蛋白质的适应性进化。
J Theor Biol. 2006 Mar 7;239(1):63-70. doi: 10.1016/j.jtbi.2005.07.012. Epub 2005 Dec 1.
8
Designing a neural network for the constraint optimization of the fitness functions devised based on the load minimization of the genetic code.基于遗传密码的负载最小化设计用于适应度函数约束优化的神经网络。
Biosystems. 2005 Aug;81(2):91-100. doi: 10.1016/j.biosystems.2005.02.002.
9
A comparison of bloat control methods for genetic programming.遗传编程中膨胀控制方法的比较。
Evol Comput. 2006 Fall;14(3):309-44. doi: 10.1162/evco.2006.14.3.309.
10
The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms.用于可持续进化算法的分层公平竞争(HFC)框架。
Evol Comput. 2005 Summer;13(2):241-77. doi: 10.1162/1063656054088530.

引用本文的文献

1
How evolution learns to generalise: Using the principles of learning theory to understand the evolution of developmental organisation.进化如何学会泛化:运用学习理论原理理解发育组织的进化。
PLoS Comput Biol. 2017 Apr 6;13(4):e1005358. doi: 10.1371/journal.pcbi.1005358. eCollection 2017 Apr.