GSGP
A C++ framework for geometric semantic genetic programming. Geometric semantic operators are new and promising genetic operators for genetic programming. They have the property of inducing a unimodal error surface for any supervised learning problem, i.e., any problem consisting in finding the match between a set of input data and known target values (like regression and classification). Thanks to an efficient implementation of these operators, it was possible to apply them to a set of real-life problems, obtaining very encouraging results. We have now made this implementation publicly available as open source software, and here we describe how to use it. We also reveal details of the implementation and perform an investigation of its efficiency in terms of running time and memory occupation, both theoretically and experimentally. The source code and documentation are available for download at http://gsgp.sourceforge.net
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
Sorted by year (- Hajek, Petr; Henriques, Roberto; Castelli, Mauro; Vanneschi, Leonardo: Forecasting performance of regional innovation systems using semantic-based genetic programming with local search optimizer (2019)
- Goribar, Carlos; Maldonado, Yazmin; Trujillo, Leonardo: Automatic random tree generator on FPGA (2017)
- Graff, Mario; Tellez, Eric S.; Escalante, Hugo Jair; Miranda-Jiménez, Sabino: Semantic genetic programming for sentiment analysis (2017)
- Vanneschi, Leonardo: An introduction to geometric semantic genetic programming (2017)
- Castelli, Mauro; Fumagalli, Alessio: An evolutionary system for exploitation of fractured geothermal reservoirs (2016)