Abstract. In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer the root and that as evolution proceeds neutral mutations of nodes near the root are progressively less likely. Studies of crossover in tree based GP have shown that when smaller and/or deeper branches are selected for crossover the resulting change in fitness is smaller and the probability of fitness neutral crossover is larger [3,1,4,2]. In this paper we continue this research for mutations by studying the relationship between the depth of single node mutations and the probability of fitness neutral mutations. Our GP is steady-state, population size 100, ...
The thesis is about linear genetic programming (LGP), a machine learning approach that evolves compu...
Size fair and homologous crossover genetic operators for tree based genetic programming are describe...
This paper discusses the possibility of managing search direction in genetic algorithm crossover and...
Proceeding of: 12th European Conference, EuroGP 2009, Tübingen, Germany, April 15-17In Genetic Progr...
Using multiobjective genetic programming with a complexity objective to overcome tree bloat is usual...
This paper presents a large and systematic body of data on the relative effectiveness of mutation, c...
This article studies the sub-tree operators: mutation and crossover, within the context of Genetic ...
This paper discusses and compares five major tree-generation algorithms for genetic programming, and...
Size fair crossover genetic operator for tree based genetic programming is described and tested. It ...
It has been shown that evolutionary computation methods are influenced not only by the fitness funct...
Abstract. A series of simple biases to the selection of crossover points in tree-structured genetic ...
We provide strong theoretical and experimental evidence that standard sub-tree crossover with unifor...
We provide strong theoretical and experimental evidence that standard sub-tree crossover with unifor...
Size fair and homologous crossover genetic operators for tree based genetic programming are describe...
The file attached to this record is the author's final peer reviewed version. The Publisher's final ...
The thesis is about linear genetic programming (LGP), a machine learning approach that evolves compu...
Size fair and homologous crossover genetic operators for tree based genetic programming are describe...
This paper discusses the possibility of managing search direction in genetic algorithm crossover and...
Proceeding of: 12th European Conference, EuroGP 2009, Tübingen, Germany, April 15-17In Genetic Progr...
Using multiobjective genetic programming with a complexity objective to overcome tree bloat is usual...
This paper presents a large and systematic body of data on the relative effectiveness of mutation, c...
This article studies the sub-tree operators: mutation and crossover, within the context of Genetic ...
This paper discusses and compares five major tree-generation algorithms for genetic programming, and...
Size fair crossover genetic operator for tree based genetic programming is described and tested. It ...
It has been shown that evolutionary computation methods are influenced not only by the fitness funct...
Abstract. A series of simple biases to the selection of crossover points in tree-structured genetic ...
We provide strong theoretical and experimental evidence that standard sub-tree crossover with unifor...
We provide strong theoretical and experimental evidence that standard sub-tree crossover with unifor...
Size fair and homologous crossover genetic operators for tree based genetic programming are describe...
The file attached to this record is the author's final peer reviewed version. The Publisher's final ...
The thesis is about linear genetic programming (LGP), a machine learning approach that evolves compu...
Size fair and homologous crossover genetic operators for tree based genetic programming are describe...
This paper discusses the possibility of managing search direction in genetic algorithm crossover and...