By Topic

Binary Representation in Gene Expression Programming: Towards a Better Scalability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Moreno-Torres, J.G. ; Illinois Genetic Algorithms Lab. (IlliGAL), Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA ; Llora, X. ; Goldberg, D.E.

One of the main problems that arises when using gene expression programming (GEP) conditions in learning classifier systems is the increasing number of symbols present as the problem size grows. When doing model-building LCS, this issue limits the scalability of such a technique, due to the cost required. This paper proposes a binary representation of GEP chromosomes to palliate the computation requirements needed. A theoretical reasoning behind the proposed representation is provided, along with empirical validation.

Published in:

Intelligent Systems Design and Applications, 2009. ISDA '09. Ninth International Conference on

Date of Conference:

Nov. 30 2009-Dec. 2 2009