Solving the symbolic regression problem with tree-adjunct grammar guided genetic programming: the comparative results
Nguyễn Xuân Hoài, Bob McKay, Daryl Essam, Rowena Chau · 2003
In this paper, we show some experimental results of tree-adjunct grammar-guided genetic programming (TAG3P) on the symbolic regression problem, a benchmark problem in genetic programming. We compare the results with genetic programming (GP) and grammar-guided genetic programming (GGGP). The results show that TAG3P significantly outperforms GP and GGGP on the target functions attempted in terms of the probability of success. Moreover, TAG3P still performed well when the structural complexity of the target function was scaled up.