.png){kind=icon}
返回
Tikhonov Regularization as a Complexity Measure in Multiobjective Genetic Programming
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2014.2306994.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose the use of Tikhonov regularization in conjunction with node count as a general complexity measure in multiobjective genetic programming. We demonstrate that employing this general complexity yields mean squared test error measures over a range of regression problems, which are typically superior to those from conventional node count (but never statistically worse). We also analyze the reason that our new method outperforms the conventional complexity measure and conclude that it forms a decision mechanism that balances both syntactic and semantic information.
Keyword:
Complexity measure
genetic programming
Pareto dominance
Tikhonov regularization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
分享收藏Hyperbaric Oxygen Treatment: Effects on Mitochondrial Function and Oxidative Stress高压氧治疗对线粒体功能和氧化应激的影响.png)
Biomolecules
OAAI
BiomoleculesIF0
OAAI分享收藏分享收藏
查看更多内容