Title
Parse-matrix evolution for symbolic regression
Abstract
Data-driven model is highly desirable for industrial data analysis in case the experimental model structure is unknown or wrong, or the concerned system has changed. Symbolic regression is a useful method to construct the data-driven model (regression equation). Existing algorithms for symbolic regression such as genetic programming and grammatical evolution are difficult to use due to their special target programming language (i.e., LISP) or additional function parsing process. In this paper, a new evolutionary algorithm, parse-matrix evolution (PME), for symbolic regression is proposed. A chromosome in PME is a parse-matrix with integer entries. The mapping process from the chromosome to the regression equation is based on a mapping table. PME can easily be implemented in any programming language and free to control. Furthermore, it does not need any additional function parsing process. Numerical results show that PME can solve the symbolic regression problems effectively.
Year
DOI
Venue
2012
10.1016/j.engappai.2012.05.015
Eng. Appl. of AI
Keywords
Field
DocType
mapping process,experimental model structure,special target programming language,parse-matrix evolution,data-driven model,programming language,genetic programming,additional function,regression equation,symbolic regression,symbolic regression problem,data analysis,artificial intelligence,grammatical evolution,evolutionary computation
Evolutionary algorithm,Regression analysis,Computer science,Lisp,Evolutionary computation,Algorithm,Genetic programming,Artificial intelligence,Parsing,Grammatical evolution,Symbolic regression,Machine learning
Journal
Volume
Issue
ISSN
25
6
0952-1976
Citations 
PageRank 
References 
7
0.69
15
Authors
2
Name
Order
Citations
PageRank
Changtong Luo1365.66
Shao-Liang Zhang29219.06