HS-Model: a hierarchical statistical subtree-generating model for genetic programming

Authors:
Lingyun Wen;Guiquan Liu;Yinghai Zhao
Affiliations:
Key Laboratory of Software in Computing and Communication, AnHui Province, Hefei, China;Key Laboratory of Software in Computing and Communication, AnHui , Hefei, China;University of Science and Technology of China, Hefei, China
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 4
Cited 0

Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Discovery of subroutines in genetic programming

Advances in genetic programming
Solving the artificial ant on the Santa Fe trail problem in 20,696 fitness evaluations

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Accelerating genetic programming by frequent subtree mining

Proceedings of the 10th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In genetic programming with subtrees, two issues are crucial: how to acquire promising subtrees efficiently and how to keep these subtrees to be used repeatedly in the evolutional process. In this paper, we propose a hierarchical statistical model for program trees, named HS-Model, to deal with both the above issues. The HS-Model conducts statistic analysis of the current population and generates superior subtrees automatically with efficiency. The HS-Model leaves out the tedious operations to keep the promising subtrees for reusing and also omits updating the subtree library according to certain criterion. Experimental results on solving the classical artificial ant problem proved the effectiveness and the efficiency of our proposed method.