Accelerating genetic programming by frequent subtree mining


One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) which protects the subtrees repeatedly appearing in superior individuals. Currently GPTM utilizes a FREQT-like efficient data mining method to find such subtrees. GPTM is evaluated by… (More)
DOI: 10.1145/1389095.1389332


13 Figures and Tables

Cite this paper

@inproceedings{Kameya2008AcceleratingGP, title={Accelerating genetic programming by frequent subtree mining}, author={Yoshitaka Kameya and Junichi Kumagai and Yoshiaki Kurata}, booktitle={GECCO}, year={2008} }