Abstract
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.
Original language | English |
---|---|
Title of host publication | GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 751-758 |
Number of pages | 8 |
ISBN (Print) | 9781450311779 |
DOIs | |
Publication status | Published - 2012 |
Externally published | Yes |
Event | The Genetic and Evolutionary Computation Conference 2012 - Philadelphia, United States of America Duration: 7 Jul 2012 → 11 Jul 2012 Conference number: 14th https://dl.acm.org/doi/proceedings/10.1145/2330784 (Proceedings) |
Conference
Conference | The Genetic and Evolutionary Computation Conference 2012 |
---|---|
Abbreviated title | GECCO 2012 |
Country/Territory | United States of America |
City | Philadelphia |
Period | 7/07/12 → 11/07/12 |
Internet address |
|
Keywords
- cartesian genetic programming
- classifiers