6533b7d4fe1ef96bd1263090
RESEARCH PRODUCT
On the Parameterization of Cartesian Genetic Programming
Roman KalkreuthPaul Kaufmannsubject
Genetic programming0102 computer and information sciences02 engineering and technologyFunction (mathematics)01 natural sciencesAlgebra010201 computation theory & mathematicsMutation (genetic algorithm)Convergence (routing)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingNode (circuits)sense organsSymbolic regressionParametrizationSelection (genetic algorithm)Mathematicsdescription
In this work, we present a detailed analysis of Cartesian Genetic Programming (CGP) parametrization of the selection scheme ($\mu+\lambda$), and the levels back parameter l. We also investigate CGP’s mutation operator by decomposing it into a self-recombination, node function mutation, and inactive gene randomization operators. We perform experiments in the Boolean and symbolic regression domains with which we contribute to the knowledge about efficient parametrization of two essential parameters of CGP and the mutation operator.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2020-07-01 | 2020 IEEE Congress on Evolutionary Computation (CEC) |