Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
A compiling genetic programming system that directly manipulates the machine code
Advances in genetic programming
The evolution of size and shape
Advances in genetic programming
Foundations of genetic programming
Foundations of genetic programming
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Genetic Programming and Evolvable Machines
Genetic Programming and Evolvable Machines
Accurate Replication in Genetic Programming
Proceedings of the 6th International Conference on Genetic Algorithms
Complexity Compression and Evolution
Proceedings of the 6th International Conference on Genetic Algorithms
Using Schema Theory To Explore Interactions Of Multiple Operators
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Proceedings of the European Conference on Genetic Programming
Seeding Genetic Programming Populations
Proceedings of the European Conference on Genetic Programming
A Schema Theory Analysis of the Evolution of Size in Genetic Programming with Linear Representations
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
The Schema Theorem and the Misallocation of Trials in the Presence of Stochastic Effects
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
General schema theory for genetic programming with subtree-swapping crossover: part I
Evolutionary Computation
Code growth in genetic programming
Code growth in genetic programming
Balancing accuracy and parsimony in genetic programming
Evolutionary Computation
Strongly typed genetic programming
Evolutionary Computation
Schema theory for genetic programming with one-point crossover and point mutation
Evolutionary Computation
Schemata evolution and building blocks
Evolutionary Computation
Scaling of program fitness spaces
Evolutionary Computation
Search bias, language bias and genetic programming
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
A simple but theoretically-motivated method to control bloat in genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Schema processing under proportional selection in the presence ofrandom effects
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Genetic Programming and Evolvable Machines
A theoretical analysis of the HIFF problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Backward-chaining evolutionary algorithms
Artificial Intelligence
Understanding the biases of generalised recombination: part I
Evolutionary Computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
The impact of population size on code growth in GP: analysis and empirical validation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
On Crossover Success Rate in Genetic Programming with Offspring Selection
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Semantic analysis of program initialisation in genetic programming
Genetic Programming and Evolvable Machines
Backward-chaining evolutionary algorithms
Artificial Intelligence
Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset
Computers and Operations Research
On the limiting distribution of program sizes in tree-based genetic programming
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Bloat control operators and diversity in genetic programming: A comparative study
Evolutionary Computation
Characterizing fault tolerance in genetic programming
Future Generation Computer Systems
Practical model of genetic programming's performance on rational symbolic regression problems
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Semantic building blocks in genetic programming
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Implicitly controlling bloat in genetic programming
IEEE Transactions on Evolutionary Computation
Theoretical results in genetic programming: the next ten years?
Genetic Programming and Evolvable Machines
Open issues in genetic programming
Genetic Programming and Evolvable Machines
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
Regressor survival rate estimation for enhanced crossover configuration
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Predicting problem difficulty for genetic programming applied to data classification
Proceedings of the 13th annual conference on Genetic and evolutionary computation
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Hi-index | 0.00 |
This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other recent GP schema theory results, the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system, introduced in Part I, and on the notion of a variable-arity hyperschema, introduced here, which generalises previous definitions of a schema. The theory indudes two main theorems describing the propagation of GP schemata: a microscopic and a macroscopic schema theorem. The microscopic version is applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. Therefore, this theorem is applicable to Koza's GP crossover with and without uniform selection of the crossover points, as well as one-point crossover, size-fair crossover, strongly-typed GP crossover, context-preserving crossover and many others. The macroscopic version is applicable to crossover operators in which the probability of selecting any two crossover points in the parents depends only on the parents' size and shape. In the paper we provide examples, we show how the theory can be specialised to specific crossover operators and we illustrate how it can be used to derive other general results. These include an exact definition of effective fitness and a size-evolution equation for GP with subtree-swapping crossover.