abstract = "a novel self-learning gene expression programming
(GEP) methodology named SL-GEP is proposed to improve
the search accuracy and efficiency of GEP. In contrast
to the existing GEP variants, the proposed SL-GEP
features a novel chromosome representation where each
chromosome is embedded with subfunctions that can be
deployed to construct the final solution. As part of
the chromosome, the subfunctions are self-learned or
self-evolved by the proposed algorithm during the
evolutionary search. By encompassing subfunctions or
any partial solution as input arguments of another
subfunction, the proposed SL-GEP facilitates the
formation of sophisticated, higher-order, and
constructive subfunctions that improve the accuracy and
efficiency of the search. Further, a novel search
mechanism based on differential evolution is proposed
for the evolution of chromosomes in the SL-GEP. The
proposed SL-GEP is simple, generic and has much fewer
control parameters than the traditional GEP variants.
The proposed SL-GEP is validated on 15 symbolic
regression problems and six even parity problems.
Experimental results show that the proposed SL-GEP
offers enhanced performances over several
state-of-the-art algorithms in terms of accuracy and
search efficiency.",
notes = "School of Computer Engineering, Nanyang Technological
University, Singapore.