Improving search performance of linear genetic programming based image recognition program synthesis by redundancy-removed recombination

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

@InProceedings{Watchareeruetai:2008:ieeeSMCIA,
  author =       "Ukrit Watchareeruetai and Yoshinori Takeuchi and 
                 Tetsuya Matsumoto and Hiroaki Kudo and Noboru Ohnishi",
  title =        "Improving search performance of linear genetic
                 programming based image recognition program synthesis
                 by redundancy-removed recombination",
  booktitle =    "IEEE Conference on Soft Computing in Industrial
                 Applications, 2008. SMCia '08",
  year =         "2008",
  pages =        "393--398",
  address =      "Muroran, Japan",
  month =        "25-27 " # jun,
  keywords =     "genetic algorithms, genetic programming, image
                 recognition, linear programming, search problems
                 evolutionary search, image recognition program
                 synthesis, linear genetic programming, nonredundant
                 offspring, redundancy-removed recombination",
  DOI =          "doi:10.1109/SMCIA.2008.5045996",
  abstract =     "This paper propose a new recombination method, named
                 redundancy-removed recombination, for linear genetic
                 programming based image recognition program synthesis.
                 The redundancy-removed recombination produces an
                 offspring (by conventional crossover or mutation), and
                 then adopts a canonical transformation to convert the
                 offspring into its canonical form, in which it can be
                 verified whether it has been evolved before
                 (redundant). If the offspring is redundant, it is
                 prohibited and recombination is repeated until
                 non-redundant offspring, which has never be born in the
                 evolutionary search, is produced. Experimental results
                 show that the use of the redundancy-removed
                 recombination improved the performance of evolutionary
                 search; it converged to the global optimum faster than
                 the use of conventional recombinations. Also we found
                 that the redundancy-removed recombination can construct
                 longer programs and concentrate on those areas, whereas
                 the conventional ones cannot.",
  notes =        "Also known as \cite{5045996}",
}

Genetic Programming entries for Ukrit WatchAreeruetai Yoshinori Takeuchi Tetsuya Matsumoto Hiroaki Kudo Noboru Ohnishi

Citations