Please use this identifier to cite or link to this item:
|Title:||Gene expression programming for symbolic regression||Authors:||Jandhyala Manognya||Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems||Issue Date:||2009||Abstract:||Gene Expression Programming is an evolutionary algorithm that mimics biological evolution to solve a user defined problem. Just like chromosomes are used to represent human beings, each chromosome in the GEP seeks to represent the solution to the problem. GEP uses linear character chromosomes made up of genes, each of which contains a head and a tail. Population of chromosomes are created to best fit a selection environment. With repeated modification or evolution by means of mutation, inversion, transposition and reproduction, the perfect solution to problems can be achieved. Many problems can be solved to illustrate the power and versatility of gene expression programming. Some of the more famous ones include symbolic regression, decision tree induction, designing of neutral networks, combinational optimization, etc. That said, this report would be focusing on solving the problem of symbolic regression and induction state transducers. The term symbolic regression is the process by which a set of data is made to fit to a mathematical formula. This process is very frequently used in experiments as the experimental results always seem to point to a pattern or relationship between the variables in the experiment. Transducers are state machines which depict a behaviour or pattern of a certain system. Although there have been solution to state machines, GEP was not used before. The author thus, proposes a method to using GEP to solve Induction state transducer problems.||URI:||http://hdl.handle.net/10356/17859||Rights:||Nanyang Technological University||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Student Reports (FYP/IA/PA/PI)|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.