.png){kind=icon}
返回
Regularization approach to inductive genetic programming
.png){kind=icon}
PRE
AI
DOI：10.1109/4235.942530.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an approach to regularization of inductive genetic programming tuned for learning polynomials. The objective is to achieve optimal evolutionary performance when searching high-order multivariate polynomials represented as tree structures. We show how to improve the genetic programming of polynomials by balancing its statistical bias with its variance. Bias reduction is achieved by employing a set of basis polynomials in the tree nodes for better agreement with the examples. Since this often leads to overfitting, such tendencies are counteracted by decreasing the variance through regularization of the fitness function. We demonstrate that this balance facilitates the search as well as enables discovery of parsimonious, accurate, and predictive polynomials. The presented experimental results show that this regularization approach outperforms traditional genetic programming on benchmark data mining and practical time-series prediction tasks.
Keyword:
genetic programming
Kolmogorov-Gabor polynomials
regularization
time series prediction
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
分享收藏Sex-Related Differences in Reproductive Allocation, Growth, Defense and Herbivory in Three Dioecious Neotropical Palms.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容