By Topic

Gene expression programming based on symbiotic evolutionary algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Siqing Xue ; School of Computer Science, China University of Geosciences, 430074 Wuhan, China ; Jie Wu

Gene expression programming (GEP) is a recently developed evolutionary computation method for model learning and data mining. Sometimes it is not easy when use GEP to solve too complex problem, and in the term of evolvability and learning capability, GEP is far from perfect. So enhancing the algorithm is necessary. Based on symbiotic algorithm, clonal selection algorithm and estimation of distribution algorithm (EDA), this paper proposes a new approach called symbiotic gene expression programming (SGEP). In this approach, the evolutionary process is split into two steps: symbiotic evolution and EDA evolution and the population is composed of three sub population: the set of symbionts and the set of assembly and the set of individuals. In symbiotic evolution, the immune clonal strategy is introduced, hoping to further improve the search efficiency of the algorithm. EDA evolution is an appropriate tool for building schemata in such algorithm. The experimental results on predicting the amount of gas emitted from coal face show that SGEP outperforms the standard GEP.

Published in:

Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), 2011 2nd International Conference on

Date of Conference:

8-10 Aug. 2011