Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming using a minimum description length principle
Advances in genetic programming
The evolution of size and shape
Advances in genetic programming
Rooted-tree schemata in genetic programming
Advances in genetic programming
Foundations of genetic programming
Foundations of genetic programming
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Genetic Programming and Evolvable Machines
Genetic Programming and Evolvable Machines
Some Considerations on the Reason for Bloat
Genetic Programming and Evolvable Machines
Accurate Replication in Genetic Programming
Proceedings of the 6th International Conference on Genetic Algorithms
Temporal Data Processing Using Genetic Programming
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
Size Control Via Size Fair Genetic Operators In The PushGP Genetic Programming System
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
General schema theory for genetic programming with subtree-swapping crossover: Part II
Evolutionary Computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Balancing accuracy and parsimony in genetic programming
Evolutionary Computation
Effects of code growth and parsimony pressure on populations in genetic programming
Evolutionary Computation
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Generality versus size in 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
On the limiting distribution of program sizes in tree-based genetic programming
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
A Field Guide to Genetic Programming
A Field Guide to Genetic Programming
Two fast tree-creation algorithms for genetic programming
IEEE Transactions on Evolutionary Computation
Bloat control operators and diversity in genetic programming: A comparative study
Evolutionary Computation
Abstract functions and lifetime learning in genetic programming for symbolic regression
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Coevolutionary multi-population genetic programming for data classification
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Theoretical results in genetic programming: the next ten years?
Genetic Programming and Evolvable Machines
Sequential metamodelling with genetic programming and particle swarms
Winter Simulation Conference
Variance based selection to improve test set performance in genetic programming
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Predicting problem difficulty for genetic programming applied to data classification
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Comparison of experimental designs for simulation-based symbolic regression of manufacturing systems
Computers and Industrial Engineering
Operator equalisation for bloat free genetic programming and a survey of bloat control methods
Genetic Programming and Evolvable Machines
Computational complexity analysis of multi-objective genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolution equation for genetic programming developed in [26] and rewrite it in a form that shows its direct relationship to Price's theorem. We then use this new formulation to derive theoretical results that show how to practically and optimally set the parsimony coefficient dynamically during a run so as to achieve complete control over the growth of the programs in a population. Experimental results confirm the effectiveness of the method, as we are able to tightly control the average program size under a variety of conditions. These include such unusual cases as dynamically varying target sizes such that the mean program size is allowed to grow during some phases of a run, while being forced to shrink in others.