Accelerating genetic programming by frequent subtree mining

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 1203-1210

  Kameya, Yoshitaka ^a   Kumagai, Junichi ^a,b   Kurata, Yoshiaki ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b FUJITSU LABORATORIES LTD   (Japan)

Author keywords

Building blocks; Frequent subtree mining; Genetic programming; Probabilistic model building genetic programming

Indexed keywords

DATA MINING; GENETIC ALGORITHMS; MODEL BUILDINGS; POLES;

BENCH-MARK PROBLEMS; BUILDING BLOCKES; DATA MINING METHODS; FREQUENT SUBTREE MINING; PROBABILISTIC MODEL BUILDING GENETIC PROGRAMMING; PROBABILISTIC MODELING; SUBTREES; TREE MINING;

GENETIC PROGRAMMING;

EID: 57349160276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389332     Document Type: Conference Paper

References (17)

1. P. J. Angeline and J. B. Pollack. The evolutionary induction of subroutines. In Proc. of the 14th Conf. of the Cognitive Science Society, pages 236-241, 1992.
2. H. Arimura and T. Uno. A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. In Proc. of the 16th Intl. Symp. on Algorithms and Computation (ISAAC-2005), pages 724-737, 2005.
3. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, and S. Arikawa. Efficent substructure discovery from large semi-structured data. In Proc. of the 2nd SIAM Intl. Conf. on Data Mining, 2002.
4. Y. Chi, Y. Yang, Y. Xia, and R. R. Muntz. CMTree Miner: mining both closed and maximal frequent subtrees. In Proc. of the 8th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD-2004), pages 63-73, 2004.
5. T. C. Fogarty. Varying the probability of mutation in the genetic algorithm. In Proc. of the 3rd Intl. Conf. on Genetic Algorithms (ICGA-89), pages 104-109, 1989.
6. Y. Hasegawa and H. Iba. Optimizing programs with estimation of Bayesian network. In Proc. of the 2006 Congress on Evolutionary Computation (CEC-2006), pages 1378-1385, 2006.
7. Y. Hasegawa and H. Iba. Probabilistic model building genetic programming based on estimation of Bayesian network. Trans. of the Japanese Society for Artificial Intelligence, 22(1):37-47, 2007. In Japanese.
8. R. D. Howard and J. R. Koza. Evolving modules in genetic programming by subtree encapsulation. In Proc. of the 4th European Conf. on Genetic Programming (EuroGP 2001), pages 160-175, 2001.
9. T. Ito, H. Iba, and S. Sato. Depth-dependent crossover for genetic programming. In Proc. of the 1998 IEEE Intl. Conf. on Evolutionary Computation (ICEC-98), pages 775-780, 1998.
10. J. R. Koza. Genetic Programming: On the Programming of Computers by means of Natural Selection. MIT Press, 1992.
11. J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Subprograms. MIT Press, 1994.
12. B. Punch, D. Zongker, and E. Goodman. The royal tree problem - a benchmark for single and multi-population genetic prgramming. In P. J. Angeline and K. E. Kinnear (Eds), Advances in Genetic Programming II. MIT Press, 1996.
13. J. P. Rosea and D. H. Ballard. Discovery of subroutines in genetic programming. In P. J. Angeline and K. E. Kinnear (Eds), Advances in Genetic Programming II. MIT Press, 1996.
14. R. Salustowicz and J. Schmidhuber. Probabilistic incremental program evolution. Evolutionary Computation, 5(2): 123-141, 1997.
15. Y. Shan, R. I. McKay, R. Baxter, H. Abbass, D. Essam, and H. X. Nguyen. Grammar model-based program evolution. In Proc. of the 2004 Congress on Evolutionary Computation (CEC-2004), pages 478-485, 2004.
16. W. A. Tackett. Mining the genetic program. IEEE Expert, 10(3):28-38, 1995.
17. K. Yanai and H. Iba. Program evolution by integrating EDP and GP. In Proc. of the Genetic and Evolutionary Computation (GECCO-2004), pages 774-785, 2004.