返回
Polygene-based evolutionary algorithms with frequent pattern mining
DOI:10.1007/s11704-016-6104-3.png)
摘要
En 中文
In this paper, we introduce polygene-based evolution, a novel framework for evolutionary algorithms (EAs) that features distinctive operations in the evolutionary process. In traditional EAs, the primitive evolution unit is a gene, wherein genes are independent components during evolution. In polygene-based evolutionary algorithms (PGEAs), the evolution unit is a polygene, i.e., a set of co-regulated genes. Discovering and maintaining quality polygenes can play an effective role in evolving quality individuals. Polygenes generalize genes, and PGEAs generalize EAs. Implementing the PGEA framework involves three phases: (I) polygene discovery, (II) polygene planting, and (III) polygene-compatible evolution. For Phase I, we adopt an associative classification-based approach to discover quality polygenes. For Phase II, we perform probabilistic planting to maintain the diversity of individuals. For Phase III, we incorporate polygene-compatible crossover and mutation in producing the next generation of individuals. Extensive experiments on function optimization benchmarks in comparison with the conventional and state-of-the-art EAs demonstrate the potential of the approach in terms of accuracy and efficiency improvement.
Keyword:
polygenes
evolutionary algorithms
function optimization
associative classification
data mining
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
引用论文
Parallel clustering of high dimensional data by integrating multi-objective genetic algorithm with divide and conquer
APPLIED INTELLIGENCE
IF3.5
Three new fuzzy neural networks learning algorithms based on clustering, training error and genetic algorithm基于聚类、训练误差和遗传算法的三种新型模糊神经网络学习算法
APPLIED INTELLIGENCE
IF3.5
A grid-based genetic algorithm combined with an adaptive simulated annealing for protein structure prediction
SOFT COMPUTING
IF2.5

