Finiteness properties of some families of GP-trees

• Alonso, César L. ^[1] ; Montaña, José Luis ^[2]
  1. [1] Universidad de Oviedo

     Universidad de Oviedo

     Oviedo, España

     
  2. [2] Universidad de Cantabria

     Universidad de Cantabria

     Santander, España

     
• Localización: XII Conferencia de la Asociación Española para la Inteligencia Artificial: (CAEPIA 2007). Actas / coord. por Daniel Borrajo Millán , Luis Castillo Vidal , Juan Manuel Corchado Rodríguez , Vol. 1, 2007, ISBN 978-84-611-8847-5, págs. 107-116
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We provide upper bounds for the Vapnik-Chervonenkis dimension of classes of subsets of IRn that can be recognized by computer programs built from arithmetical assignments, infinitely differentiable algebraic operations (like k-root extraction and, more generally, operations defined by algebraic series of fractional powers), conditional statements and while instructions. This includes certain classes of GP-trees considered in Genetic Programming for symbolic regression and bi-classification. As a consequence we show explicit quantitative properties that can help to design the fitness function of a GP learning machine.