Evolutionary algorithm based on overlapped gene expression

Authors:
Jing Peng;Chang-jie Tang;Jing Zhang;Chang-an Yuan
Affiliations:
School of computer Science and Engineering, Sichuan University, Chengdu, China;School of computer Science and Engineering, Sichuan University, Chengdu, China;Chengdu Jiuheyuan Industry Company, Chengdu, China;School of computer Science and Engineering, Sichuan University, Chengdu, China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 4
Cited 1

Genetic programming in C++: implementation issues

Advances in genetic programming
A comparative analysis of genetic programming

Advances in genetic programming
Discovery of the Boolean Functions to the Best Density-Classification Rules Using Gene Expression Programming

EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence (Studies in Computational Intelligence)

Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence (Studies in Computational Intelligence)

VCCM mining: mining virtual community core members based on gene expression programming

WISI'06 Proceedings of the 2006 international conference on Intelligence and Security Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by the overlap gene expression in biological study, this paper proposes a novel evolutionary algorithm-EAOGE i.e. Evolutionary Algorithm based on Overlapped Gene Expression. Different from existing works, EAOGE suggests a new expression structure of genes with probabilities of overlapped expression for some segments. The main contributions are: (1) Proposing a novel model and an algorithm of gene expression while borrowing some ideas from artificial immunity algorithm; (2) Analyzing the expressing space and encode characteristic of the new model; (3) The extensive experiments in function finding shows that new model is 2.8~9.7 times faster than usual GEP method, and in higher-degree polynomial function finding, the success rate of EAOGE is over 10 times than usual GEP.