木構造のランダムサンプリングによるGPの個体生成手法の提案と評価  [in Japanese] A New GP Recombination Method Using Random Tree Sampling  [in Japanese]

Access this Article

Search this Article

Author(s)

Abstract

We propose a new program evolution method named PORTS (Program Optimization by Random Tree Sampling) which is motivated by the idea of preservation and control of tree fragments in GP (Genetic Programming). We assume that to recombine genetic materials efficiently, tree fragments of any size should be preserved into the next generation. PORTS samples tree fragments and concatenates them by traversing and transitioning between promising trees instead of using subtree crossover and mutation. Because the size of a fragment preserved during a generation update follows a geometric distribution, merits of the method are that it is relatively easy to predict the behavior of tree fragments over time and to control sampling size, by changing a single parameter. From experimental results on RoyalTree, Symbolic Regression and 6-Multiplexer problem, we observed that the performance of PORTS is competitive with Simple GP. Furthermore, the average node size of optimal solutions obtained by PORTS was simple than Simple GP's result.

Journal

  • IEEJ Transactions on Electronics, Information and Systems

    IEEJ Transactions on Electronics, Information and Systems 130(5), 775-781, 2010-05-01

    The Institute of Electrical Engineers of Japan

References:  17

Codes

  • NII Article ID (NAID)
    10026228984
  • NII NACSIS-CAT ID (NCID)
    AN10065950
  • Text Lang
    JPN
  • Article Type
    ART
  • ISSN
    03854221
  • NDL Article ID
    10662451
  • NDL Source Classification
    ZN31(科学技術--電気工学・電気機械工業)
  • NDL Call No.
    Z16-795
  • Data Source
    CJP  NDL  J-STAGE 
Page Top