人工知能学会論文誌
Online ISSN : 1346-8030
Print ISSN : 1346-0714
ISSN-L : 1346-0714
論文
潜在アノテーション推定を用いた確率文法による分布推定アルゴリズム
長谷川 禎彦伊庭 斉志
著者情報
ジャーナル フリー

2008 年 23 巻 1 号 p. 13-26

詳細
抄録

Evolutionary algorithms (EAs) are optimization methods and are based on the concept of natural evolution. Recently, growing interests has been observed on applying estimation of distribution techniques to EAs (EDAs). Although probabilistic context free grammar (PCFG) is a widely used model in EDAs for program evolution, it is not able to estimate the building blocks from promising solutions because it takes advantage of the context freedom assumption. We have proposed a new program evolution algorithm based on PCFG with latent annotations which weaken the context freedom assumption. Computational experiments on two subjects (the royal tree problem and the DMAX problem) demonstrate that our new approach is highly effective compared to prior approaches including the conventional GP.

著者関連情報
© 2008 JSAI (The Japanese Society for Artificial Intelligence)
前の記事 次の記事
feedback
Top