Matching Subtrees in Genetic Programming Crossover Operator

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F17%3A00312340" target="_blank" >RIV/68407700:21240/17:00312340 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Matching Subtrees in Genetic Programming Crossover Operator

Popis výsledku v původním jazyce

In this paper we study techniques that should reduce the destructive impact of crossover in genetic programming. The quality of crossover offsprings is often lower than ancestors due to the fact that a small change in individual's genotype tree structure has a great impact to its phenotype. Therefore we propose and test several methods for matching subtrees to find the best possible cutting point for crossover of trees. Our approach utilizes the adaptive probability of operators with the intent to reinforce the well-performing operators. A relation to the semantic genetic programming approach is also investigated. The experimental results show that the average arity based technique performs best from the proposed methods.

Název v anglickém jazyce

Matching Subtrees in Genetic Programming Crossover Operator

Popis výsledku anglicky

In this paper we study techniques that should reduce the destructive impact of crossover in genetic programming. The quality of crossover offsprings is often lower than ancestors due to the fact that a small change in individual's genotype tree structure has a great impact to its phenotype. Therefore we propose and test several methods for matching subtrees to find the best possible cutting point for crossover of trees. Our approach utilizes the adaptive probability of operators with the intent to reinforce the well-performing operators. A relation to the semantic genetic programming approach is also investigated. The experimental results show that the average arity based technique performs best from the proposed methods.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)

ISBN

978-1-5386-2164-6

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

187-192

Název nakladatele

IEEE

Místo vydání

—

Místo konání akce

Guilin

Datum konání akce

29. 7. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—