Improving EDAs’ Performance by Using Real-valued Models
Date Issued
2011
Date
2011
Author(s)
Lee, Jui-Ting
Abstract
Existing estimation of distribution algorithms (EDAs) learn linkages starting from pairwise interactions of variables and construct models from the linkages. The characteristic function of models which indicates the relations among variables are binary. In other words, the characteristic function indicates that there exist or not interactions among variables. Empirically, it can occur that two variables should be sometimes related but sometimes not. This thesis introduces a real-valued characteristic function to illustrate this property of fuzziness. We examine all the possible binary models and real-valued models on test problems. The results show that EDAs using optimal real-valued models outperforms the one using optimal binary models. This thesis also proposes two recombination algorithms which are able to utilize the information provided by real-valued models. Experiments show that the proposed pairwise crossover could reduce function evaluations by three quarters. Moreover, this thesis proposes an effective method to find a threshold for entropy based linkage-learning metric and a method to generate real-valued models. Experiments show that the proposed crossover with generated real-valued models works well.
Subjects
Estimation of Distribution Algorithm
Linkage Learning
Building Block
Model Building
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-100-R98921050-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):0d30768e9d075001dbc1eadc15688a6a