Mt-cgp: Mixed type cartesian genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary …, 2012•dl.acm.org
The majority of genetic programming implementations build expressions that only use a
single data type. This is in contrast to human engineered programs that typically make use of
multiple data types, as this provides the ability to express solutions in a more natural fashion.
In this paper, we present a version of Cartesian Genetic Programming that handles multiple
data types. We demonstrate that this allows evolution to quickly find competitive, compact,
and human readable solutions on multiple classification tasks.
single data type. This is in contrast to human engineered programs that typically make use of
multiple data types, as this provides the ability to express solutions in a more natural fashion.
In this paper, we present a version of Cartesian Genetic Programming that handles multiple
data types. We demonstrate that this allows evolution to quickly find competitive, compact,
and human readable solutions on multiple classification tasks.
The majority of genetic programming implementations build expressions that only use a single data type. This is in contrast to human engineered programs that typically make use of multiple data types, as this provides the ability to express solutions in a more natural fashion. In this paper, we present a version of Cartesian Genetic Programming that handles multiple data types. We demonstrate that this allows evolution to quickly find competitive, compact, and human readable solutions on multiple classification tasks.