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

この論文にアクセスする

この論文をさがす

著者

抄録

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.

収録刊行物

  • 電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society

    電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society 130(5), 775-781, 2010-05-01

    一般社団法人 電気学会

参考文献:  17件中 1-17件 を表示

各種コード

  • NII論文ID(NAID)
    10026228984
  • NII書誌ID(NCID)
    AN10065950
  • 本文言語コード
    JPN
  • 資料種別
    ART
  • ISSN
    03854221
  • NDL 記事登録ID
    10662451
  • NDL 雑誌分類
    ZN31(科学技術--電気工学・電気機械工業)
  • NDL 請求記号
    Z16-795
  • データ提供元
    CJP書誌  NDL  J-STAGE 
ページトップへ