The time complexity analysis of a class of gene expression programming

This paper studies the time complexity of gene expression programming based on maintaining elitist (ME-GEP). Using the theory of Markov chain and the technique of artificial fitness level, the properties of transition matrices of ME-GEP are analyzed. Based on the properties, the upper and lower bounds of the average time complexity of ME-GEP are obtained. Furthermore, the upper bound is estimated, which is determined by the parameters of ME-GEP algorithm. And the theoretical results acquired in this paper are used to analyze ME-GEP for solving function modeling and clustering problem. At last, a set of experiments are performed on these problems to illustrate the effectiveness of theoretical results. The results show that the upper bound of expected first hitting time can be used to direct the algorithm design of ME-GEP.

[1]  Jiang Wu,et al.  Clustering Without Prior Knowledge Based on Gene Expression Programming , 2007, Third International Conference on Natural Computation (ICNC 2007).

[2]  Weimin Xiao,et al.  Evolving accurate and compact classification rules with gene expression programming , 2003, IEEE Trans. Evol. Comput..

[3]  Per Kristian Lehre,et al.  On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms , 2012, IEEE Trans. Evol. Comput..

[4]  Xin Yao,et al.  From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[5]  Frank Neumann,et al.  Rigorous analyses of fitness-proportional selection for optimizing linear functions , 2008, GECCO '08.

[6]  Jia Xiao,et al.  Mining Frequent Function Set Based on Gene Expression Programming , 2005 .

[7]  Yang Yu,et al.  A new approach to estimating the expected first hitting time of evolutionary algorithms , 2006, Artif. Intell..

[8]  Liliana Teodorescu,et al.  High Energy Physics event selection with Gene Expression Programming , 2008, Comput. Phys. Commun..

[9]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[10]  D. Cooke,et al.  Finite Markov Processes and Their Applications , 1981 .

[11]  Lixin Ding,et al.  About the convergence rates of a class of gene expression programming , 2010, Science China Information Sciences.

[12]  Lishan Kang,et al.  A New Algorithm of Automatic Programming: GEGEP , 2006, SEAL.

[13]  Lishan Kang,et al.  On the Convergence Rates of Genetic Algorithms , 1999, Theor. Comput. Sci..

[14]  Cândida Ferreira,et al.  Gene Expression Programming: A New Adaptive Algorithm for Solving Problems , 2001, Complex Syst..

[15]  Marius Iosifescu,et al.  Finite Markov Processes and Their Applications , 1981 .

[16]  H. S. Lopes,et al.  A GENE EXPRESSION PROGRAMMING SYSTEM FOR TIME SERIES MODELING , 2004 .

[17]  Günter Rudolph,et al.  How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time , 1996, Evolutionary Computation.

[18]  Li Chen,et al.  Convergence analysis of gene expression programming based on maintaining elitist , 2009, GEC '09.

[19]  Pietro Simone Oliveto,et al.  Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.

[20]  Tang Chang-jie,et al.  Function Mining Based on Gene Expression Programming ——Convergency Analysis and Remnant-guided Evolution Algorithm , 2004 .

[21]  Peng Jing,et al.  M-GEP:A New Evolution Algorithm Based on Multi-Layer Chromosomes Gene Expression Programming , 2005 .

[22]  Xin Yao,et al.  Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..

[23]  Xin Yao,et al.  Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..

[24]  Jinghu Yu,et al.  Some theoretical results about the computation time of evolutionary algorithms , 2005, GECCO '05.

[25]  Andreas Stafylopatis,et al.  Efficient Evolution of Accurate Classification Rules Using a Combination of Gene Expression Programming and Clonal Selection , 2008, IEEE Transactions on Evolutionary Computation.

[26]  Xin Yao,et al.  A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[27]  Xin Yao,et al.  A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.

[28]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[29]  Ingo Wegener,et al.  On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions , 2005, J. Discrete Algorithms.

[30]  Jianjun Hu,et al.  Convergency of Genetic Regression In Data Mining Based On Gene Expression Programming and Optimized Solution , 2006 .

[31]  L. Teodorescu,et al.  Gene Expression Programming Approach to Event Selection in High Energy Physics , 2006, IEEE Transactions on Nuclear Science.

[32]  Weimin Shi,et al.  Quantitative structure-activity relationships studies of CCR5 inhibitors and toxicity of aromatic compounds using gene expression programming. , 2010, European journal of medicinal chemistry.

[33]  Eörs Szathmáry,et al.  The Major Transitions in Evolution , 1997 .

[34]  Marc Schoenauer,et al.  Rigorous Hitting Times for Binary Mutations , 1999, Evolutionary Computation.