| 基于K-表达式长度的改进GEP算法研究 |
| |
| 引用本文： | 涂燕琼. 基于K-表达式长度的改进GEP算法研究[J]. 南方冶金学院学报, 2011, 0(3) |
| |
| 作者姓名： | 涂燕琼 |
| |
| 作者单位： | 江西理工大学信息工程学院; |
| |
| 摘 要： | 在基因表达式编程中,个体适应值的计算是频繁发生的操作,要动态生成和遍历大量的树,成为影响GEP算法效率的瓶颈.为此,提出了基于K-表达式长度快速求适应值的KLCF算法,实验表明KLCF算法简单有效且大大缩短演化时间;同时也提出了改进的基因表达式算法KL-GEP,实验表明,KL-GEP与GP和GEP相比,具有更高的拟合和预测精度、更快的收敛速度.
|
| 关 键 词： | 基因表达式编程 GEP K-表达式 表达式树 适应值 |
Improved GEP Algorithm Based on the Length of K-expression |
| |
| TU Yan-qiong. Improved GEP Algorithm Based on the Length of K-expression[J]. Journal of Southern Institute of Metallurgy, 2011, 0(3) |
| |
| Authors: | TU Yan-qiong |
| |
| Affiliation: | TU Yan-qiong(Faculty of Information Engineering,Jiangxi University of Science and Technology,Ganzhou 341000,China) |
| |
| Abstract: | Calculating individual fitness is a frequent operation in Gene Expression Programming(GEP).Generating dynamically and traversing a lot of trees have been the bottleneck of improving GEP algorithm efficiency,A KLCF algorithm based on the length of K-expression to calculate the fitness value quickly is proposed.The experiments show that the KLCF algorithm is simple and effective,which can greatly shorten the evolution time.Meanwhile an improved GEP algorithm,KL-GEP is presented.Experiments show that with bett... |
| |
| Keywords: | gene expression programming GEP K-expression expression tree fitness |
| 本文献已被 CNKI 等数据库收录！ |
|
