RUO Home

Repositorio Institucional de la Universidad de Oviedo

View Item 
  •   RUO Home
  • Producción Bibliográfica de UniOvi: RECOPILA
  • Artículos
  • View Item
  •   RUO Home
  • Producción Bibliográfica de UniOvi: RECOPILA
  • Artículos
  • View Item
    • español
    • English
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of RUOCommunities and CollectionsBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_issnAuthor profilesThis CollectionBy Issue DateAuthorsTitlesSubjectsxmlui.ArtifactBrowser.Navigation.browse_issn

My Account

LoginRegister

Statistics

View Usage Statistics

RECENTLY ADDED

Last submissions
Repository
How to publish
Resources
FAQs

A new linear genetic programming approach based on straight line programs: Some theoretical and experimental aspects

Author:
Alonso González, César LuisUniovi authority; Montaña Arnaiz, José Luis; Puente Peinador, JorgeUniovi authority; Borges Hernández, Cruz Enrique
Publication date:
2009
Editorial:

World Scientific Publishing Company

Publisher version:
http://dx.doi.org/10.1142/S0218213009000391
Citación:
International Journal on Artificial Intelligence Tools, 18, p. 757-781 (2009); doi:10.1142/S0218213009000391
Descripción física:
p. 757-781
Abstract:

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 introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations

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 introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations

URI:
http://hdl.handle.net/10651/6713
ISSN:
0218-2130
Identificador local:

20090269

DOI:
10.1142/S0218213009000391
Patrocinado por:

César Luis Alonso and José Luis Montaña are supported by spanish grant TIN2007- 67466-C02-02. Jorge Puente is supported by Spanish grant TIN2007-67466-C02-01. Cruz Enrique Borges is supported by FPU program and MTM2004-01167

Id. Proyecto:

TIN2007-67466-C02-02

TIN2007-67466-C02-01

MTM2004-01167

Collections
  • Artículos [33264]
  • Informática [664]
  • Investigaciones y Documentos OpenAIRE [6781]
Files in this item
Thumbnail
untranslated
postprint (310.4Kb)
Compartir
Exportar a Mendeley
Estadísticas de uso
Estadísticas de uso
Metadata
Show full item record
Página principal Uniovi

Biblioteca

Contacto

Facebook Universidad de OviedoTwitter Universidad de Oviedo
The content of the Repository, unless otherwise specified, is protected with a Creative Commons license: Attribution-Non Commercial-No Derivatives 4.0 Internacional
Creative Commons Image