Model Complexity Control in Straight Line Program Genetic Programming

César L. Alonso, José Luis Montaña, Cruz Enrique Borges

2013

Abstract

In this paper we propose a tool for controlling the complexity of Genetic Programming models. The tool is supported by the theory of Vapnik-Chervonekis dimension (VCD) and is combined with a novel representation of models named straight line program. Experimental results, implemented on conventional algebraic structures (such as polynomials) and real problems, show that the empirical risk, penalized by suitable upper bounds for the Vapnik-Chervonenkis dimension, gives a generalization error smaller than the use of statistical conventional techniques such as Bayesian or Akaike information criteria.

Paper Citation

in Harvard Style

L. Alonso C., Luis Montaña J. and Enrique Borges C. (2013). Model Complexity Control in Straight Line Program Genetic Programming . In Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013) ISBN 978-989-8565-77-8, pages 25-36. DOI: 10.5220/0004554100250036

in Bibtex Style

@conference{ecta13,
author={César L. Alonso and José Luis Montaña and Cruz Enrique Borges},
title={Model Complexity Control in Straight Line Program Genetic Programming},
booktitle={Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)},
year={2013},
pages={25-36},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004554100250036},
isbn={978-989-8565-77-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)
TI - Model Complexity Control in Straight Line Program Genetic Programming
SN - 978-989-8565-77-8
AU - L. Alonso C.
AU - Luis Montaña J.
AU - Enrique Borges C.
PY - 2013
SP - 25
EP - 36
DO - 10.5220/0004554100250036