César Luis Alonso

Learn More
We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on Empirical Risk Minimization (ERM) and model selection based on Structural Risk Minimization (SRM). For this purpose we have identified the main components which determine the capacity of(More)
Very often symbolic regression, as addressed in Genetic Programming (GP), is equivalent to approximate interpolation. This means that, in general, GP algorithms try to fit the sample as better as possible but no notion of generalization error is considered. As a consequence , overfitting, code-bloat and noisy data are problems which are not satisfactorily(More)
Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure , named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are(More)
In this paper we discuss the problem of model selection in Genetic Programming. We present empirical comparisons between classical statistical methods (AIC, BIC) adapted to Genetic Programming and the Structural Risk Minimization method (SRM) based on Vapnik-Chervonenkis theory (VC), for symbolic regression problems with added noise. We also introduce a new(More)