Geometric Semantic Genetic Programming (GSGP) is a recently defined form of Genetic Programming (GP) that has shown promising results on single output Boolean problems when compared with standard tree-based GP. In this paper we compare GSGP with Cartesian GP (CGP) on comprehensive set of Boolean benchmarks, consisting of both single and multiple outputs Boolean problems. The results obtained show that GSGP outperforms also CGP, confirming the efficacy of GSGP in solving Boolean problems.
A comparison between Geometric Semantic GP and Cartesian GP for Boolean functions learning? / Mambrini, Andrea; Manzoni, Luca. - ELETTRONICO. - (2014), pp. 143-144. ( 16th Genetic and Evolutionary Computation Conference, GECCO 2014 Vancouver, BC, can 2014) [10.1145/2598394.2598475].
A comparison between Geometric Semantic GP and Cartesian GP for Boolean functions learning?
Manzoni Luca
2014-01-01
Abstract
Geometric Semantic Genetic Programming (GSGP) is a recently defined form of Genetic Programming (GP) that has shown promising results on single output Boolean problems when compared with standard tree-based GP. In this paper we compare GSGP with Cartesian GP (CGP) on comprehensive set of Boolean benchmarks, consisting of both single and multiple outputs Boolean problems. The results obtained show that GSGP outperforms also CGP, confirming the efficacy of GSGP in solving Boolean problems.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
