Paper Info
Title
Evolve schema directly using instruction matrix based genetic programming
Abstract
This paper proposes a new architecture for tree-based genetic programming to evolve schema directly. It uses fixed length hs-expressions to represent program trees, keeps schema information in an instruction matrix, and extracts individuals from it. In order to manipulate the instruction matrix and the hs-expression, new genetic operators and new matrix functions are developed. The experimental results verify that its results are better than those of the canonical genetic programming on the problems tested in this paper.
Year
DOI
Venue
2005
10.1007/978-3-540-31989-4_24
EuroGP
Keywords
Field
DocType
instruction matrix,length hs-expressions,schema information,tree-based genetic programming,extracts individual,new architecture,new matrix function,new genetic operator,canonical genetic programming,genetic operator,matrix function
Defining length,Computer science,Matrix (mathematics),Matrix function,Theoretical computer science,Genetic programming,Schema evolution,Schema (psychology),Genetic algorithm,Schema (genetic algorithms)
Conference
Volume
ISSN
ISBN
3447
0302-9743
3-540-25436-6
Citations 
PageRank 
References 
5
0.46
3
Authors
3
Name
Order
Citations
PageRank
Gang Li1263.36
Kin Hong Lee2506.56
Kwong-Sak Leung31887205.58