A Controlled Genetic Programming Approach for the Deceptive Domain

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

@Article{korkmaz:cgpa,

• author = "Emin Erkan Korkmaz and Gokturk Ucoluk",
• title = "A Controlled Genetic Programming Approach for the Deceptive Domain",
• journal = "IEEE Transactions on Systems, Man and Cybernetics, Part B",
• volume = "34",
• number = "4",
• month = aug,
• year = "2004",
• pages = "1730--1742",
• ISSN = "1083-4419",
• keywords = "genetic algorithms, genetic programming, decision trees, tree searching, deceptive domain problem, genetic search, global information extraction, recombination process, Crossover, GP, deceptive problems, epistasis",
• URL = "http://cse.yeditepe.edu.tr/~ekorkmaz/publication/IEEE2002.ps",
• DOI = "doi:10.1109/TSMCB.2004.828590",
• language = "en",
• oai = "oai:CiteSeerXPSU:10.1.1.147.2543",
• URL = "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.2543",
• URL = "http://www.ceng.metu.edu.tr/~ucoluk/research/publications/controledGP.pdf",
• abstract = "Traditional genetic programming (GP) randomly combines subtrees by applying crossover. There is a growing interest in methods that can control such recombination operations in order to achieve faster convergence. In this paper, a new approach is presented for guiding the recombination process for genetic programming. The method is based on extracting the global information of the promising solutions that appear during the genetic search. The aim is to use this information to control the crossover operation afterwards. A separate control module is used to process the collected information. This module guides the search process by sending feedback to the genetic engine about the consequences of possible recombination alternatives.",
• notes = "INSPEC Accession Number:8111580 PMID: 15462440",

}

Genetic Programming entries for Erkan Korkmaz Gokturk Ucoluk

Citations