About the convergence rates of a class of gene expression programming

Created by W.Langdon from gp-bibliography.bib Revision:1.4216

  title =        "About the convergence rates of a class of gene
                 expression programming",
  author =       "Xin Du and Lixin Ding",
  journal =      "SCIENCE CHINA Information Sciences",
  year =         "2010",
  volume =       "53",
  number =       "4",
  pages =        "715--728",
  month =        apr,
  keywords =     "genetic algorithms, genetic programming, gene
                 expression programming, ME-GEP, convergence rates,
                 Markov chain, revised spectral radius",
  DOI =          "doi:10.1007/s11432-010-0041-9",
  size =         "14 pages",
  abstract =     "This paper studies the convergence rates of gene
                 expression programming based on maintaining elitist
                 (ME-GEP) by means of Markov chain and spectrum
                 analysis. We obtain the following results: (1) MEGEP
                 algorithm converges to the global optimum in
                 probability. (2) The convergence rates of ME-GEP
                 algorithm depend on the revised spectral radius of
                 transition matrix of Markov chain corresponding to the
                 algorithm. (3) The upper bounds of revised spectral
                 radius are estimated, which are determined by the
                 parameters of MEGEP algorithm. (4) As an application of
                 the theoretical results acquired in the paper, the
                 convergence rates of ME-GEP for the polynomial function
                 modelling problem are also analysed, which verifies the
                 relations between the convergence rates and the
                 algorithm parameters.",
  bibdate =      "2011-06-08",
  bibsource =    "DBLP,

Genetic Programming entries for Xin Du Lixin Ding