ACM Home Page
Please provide us with feedback. Feedback
Using differential evolution for symbolic regression and numerical constant creation
Full text PdfPdf (351 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
SESSION: Genetic programming papers table of contents
Pages 1195-1202  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Authors
Brian M. Cerny  University of Illinois at Chicago, Chicago, IL, USA
Peter C. Nelson  University of Illinois at Chicago, Chicago, IL, USA
Chi Zhou  Motorola Inc., Schaumburg, IL, USA
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 57,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389331
What is a DOI?

ABSTRACT

One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf nodes are either variables or constants. Such constants are usually unknown in Symbolic Regression (SR) problems, and GP, as well as many of its derivatives, lack the ability to precisely approximate these values. This is due to the inherently discrete encoding of GP-like methods which are more suited to combinatorial searches than real-valued optimization tasks. Previously, several attempts have been made to resolve this issue, and the dominant solutions have been to either embed a real-valued local optimizer or to develop additional numerically oriented operators. In this paper, an entirely new approach is proposed for constant creation. Through the adoption of a robust, real-valued optimization algorithm known as Differential Evolution (DE), constants and GP-like programs will be simultaneously evolved in such a way that the values of the leaf nodes will be approximated as the tree structure is itself changing. Experimental results from several SR benchmarks are presented and analyzed. The results demonstrate the feasibility of the proposed algorithm and suggest that exotic or computationally expensive methods are not necessary for successful constant creation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Cândida Ferreira. Gene expression programming: A new adaptive algorithm for solving problems. Complex Systems, 13(2):87--129, 2001.
 
3
 
4
 
5
 
6
Chi Zhou, Weimin Xiao, Thomas M. Tirpak, and Peter C. Nelson. Evolving Accurate and Compact Classification Rules with Gene Expression Programming. IEEE Transactions on Evolutionary Computation, 7(6):519--531, December 2003.
 
7
 
8
 
9
 
10
Stefano Cagnoni, Daniel Rivero, and Leonardo Vanneschi. A purely evolutionary memetic algorithm as a first step towards symbiotic coevolution. In Proceedings of the IEEE Congress on Evolutionary Computation, (CEC 2005), pages 1156--1163, Edinburgh, UK, September 2005. IEEE.
 
11
Alexander Topchy and William Punch. Faster Genetic Programming based on Local Gradient Search of Numeric Leaf Values. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pages 155--162, San Francisco, CA, USA, July 2001. Morgan Kaufmann.
 
12
Gunther R. Raidl. A Hybrid GP Approach for Numerically Robust Symbolic Regression. In Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 323--328, Madison, WI, USA, July 1998. Morgan Kaufmann.
 
13
 
14
Conor Ryan and Maarten Keijzer. An Analysis of Diversity of Constants of Genetic Programming. In Genetic Programming, 6th European Conference, EuroGP 2003, pages 404--413. Springer, 2003.
 
15
Xin Li, Chi Zhou, Peter C. Nelson, and Thomas M. Tirpak. Investigation of Constant Creation Techniques in the Context of Gene Expression Programming. In Maarten Keijzer, editor, Late Breaking Papers at the 2004 Genetic and Evolutionary Computation Conference, Seattle, WA, USA, July 2004.
 
16
Michael O'Neill, Ian Dempsey, Anthony Brabazon, and Conor Ryan. Analysis of a Digit Concatenation Approach to Constant Creation. In Genetic Programming, 6th European Conference, EuroGP 2003, pages 173--182. Springer, 2003.
 
17
Maarten Keijzer. Improving Symbolic Regression with Interval Arithmetic and Linear Scaling. In Genetic Programming, 6th European Conference, EuroGP 2003, pages 70--82. Springer, 2003.
 
18
Michael O'Neill and Anthony Brabazon. Grammatical Differential Evolution. In Proceedings of the 2006 International Conference on Artificial Intelligence (ICAI 2006), pages 231--236. CSREA Press, 2006.
 
19
 
20

Collaborative Colleagues:
Brian M. Cerny: colleagues
Peter C. Nelson: colleagues
Chi Zhou: colleagues