• Corpus ID: 51977876

An Efficient Genetic Programming System with Geometric Semantic Operators and its Application to Human Oral Bioavailability Prediction

  title={An Efficient Genetic Programming System with Geometric Semantic Operators and its Application to Human Oral Bioavailability Prediction},
  author={Mauro Castelli and Luca Manzoni and Leonardo Vanneschi},
Very recently new genetic operators, called geometric semantic operators, have been defined for genetic programming. Contrarily to standard genetic operators, which are uniquely based on the syntax of the individuals, these new operators are based on their semantics, meaning with it the set of input-output pairs on training data. Furthermore, these operators present the interesting property of inducing a unimodal fitness landscape for every problem that consists in finding a match between given… 

Figures and Tables from this paper

Competent Geometric Semantic Genetic Programming for Symbolic Regression and Boolean Function Synthesis

A suite of competent operators that combine effectiveness with geometry for population initialization, mate selection, mutation, and crossover are proposed, concluding that the competent operators are superior on a wide range of performance indicators, including best-of-run fitness, test-set fitness, and program size.

Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions

This work presents a runtime analysis of GSGP with various types of mutations on the class of all Boolean functions, and opens the way to analyse theoretically in a easy manner the optimisation time of GS GP in a general setting.

Runtime analysis of mutation-based geometric semantic genetic programming for basis functions regression

This work presents a runtime analysis of mutation-based GSGP on the class of all regression problems with generic basis functions (encompassing e.g., polynomial regression and trigonometric regression).

Theory-laden design of mutation-based Geometric Semantic Genetic Programming for learning classification trees

This work design and analyse a mutation-based GSGP for the class of all classification tree learning problems, which is a classic GP application domain.

How noisy data affects geometric semantic genetic programming

GSGP is more robust to noise than GP in the presence of up to 10% of noise, and presents no statistical difference for values higher than that in the test bed, according to the results of a deep analysis.

Strategies for reducing the size of the search space in semantic genetic programming

Ao tentar resolver problemas de otimizacao, algoritmos de programacao genetica aplicam operacoes bio-inspiradas (mutacao e cruzamento, por exemplo) de forma a explorar o espaco de possiveis solucoes

Theory and practice for efficient genetic programming

This thesis shows how distributing individuals into separate communicating subpopulations naturally counteracts premature convergence and bloat, allowing genetic programming to find solutions of better quality, more quickly.

Geometric Semantic Genetic Programming

This work introduces a novel form of GP --- Geometric Semantic GP (GSGP) --- that searches directly the space of the underlying semantics of the programs, and allows for principled formal design of semantic search operators for different classes of problems.

Semantically-based crossover in genetic programming: application to real-valued symbolic regression

This analysis leads to a conclusion that SSC is more constructive and has higher locality than SAC, NSM and SC; it believes these are the main reasons for the improved performance of SSC.

Genetic programming for computational pharmacokinetics in drug discovery and development

The role of genetic programming in predictive pharmacokinetics is discussed, considering the estimation of adsorption, distribution, metabolism, excretion and toxicity processes that a drug undergoes into the patient’s organism.


This paper proposes two new methods for implementing the mutation operator in Genetic Programming called Semantic Aware Mutation (SAM) and Semantic Similarity based M utation (SSM), and shows that SSM helps to significantly enhance Genetic Pro gramming performance on the problems tried.

Semantic Aware Crossover for Genetic Programming: The Case for Real-Valued Function Regression

The results show that on the family of test problems examined, the (approximate) semantic aware crossover operators can provide performance advantages over the standard subtree crossover adopted in Genetic Programming.

A Field Guide to Genetic Programming

A unique overview of this exciting technique is written by three of the most active scientists in GP, which starts from an ooze of random computer programs, and progressively refines them through processes of mutation and sexual recombination until high-fitness solutions emerge.

Medial Crossovers for Genetic Programming

A class of crossover operators for genetic programming that aim at making offspring programs semantically intermediate with respect to parent programs by modifying short fragments of code by defining two measures of semantic ‘mediality', which are employed to design two crossover operators.

Approximating geometric crossover in semantic space

A crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space is proposed and an extensive computational experiment concerning logical function synthesis and symbolic regression is described.

Semantic analysis of program initialisation in genetic programming

This paper creates four different algorithms, in addition to using the traditional ramped half and half technique, applied to seven genetic programming problems, to show that varying the choice and design of program initialisation can dramatically influence the performance of genetic programming.