.png){kind=icon}
返回
Representation and structural difficulty in genetic programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2006.871252.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Standard tree-based genetic programming suffers from a structural difficulty problem in that it is unable to search effectively for solutions requiring very full or very narrow trees. This deficiency has been variously explained as a consequence of restrictions imposed by the tree structure or as a result of the numerical distribution of tree shapes. We show that by using a different tree-based representation and local (insertion and deletion) structural modification operators, that this problem can be almost eliminated even with trivial (stochastic hill-climbing) search methods, thus eliminating the above explanations. We argue, instead, that structural difficulty is a consequence of the large step size of the operators in standard genetic programming, which is itself a consequence of the fixed-arity property embodied in its representation.
Keyword:
deletion
genetic programming (GP)
insertion
operator
representation
structural difficulty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
暂无机构信息
引用论文
Comparison of the efficiency of some of the most usual DNA extraction methods for woody plants in different tissues of <em>Vitis vinifera</em> L..png)
OENO One
OAAI
OENO OneIF0
OAAI分享收藏Inheritance patterns of anthocyanins in berry skin and flesh of the interspecific population derived from teinturier grapeEuphytica
EuphyticaIF0
PREAI
分享收藏
查看更多内容