A number of estimation of distribution algorithms have been proposed that do not use explicitly crossover and mutation of traditional genetic algorithms, but estimate the distribution of population for more efficient search. But because it is not easy to discover higher-order correlations of variables, lower-order correlations are estimated most cases under various constraints. In this paper, we propose a new estimation of distribution algorithm that represents higher-order correlations of the data and finds global optimum more efficiently. The proposed algorithm represents the higher-order correlations among variables by building random hypergraph model composed of hyperedges consisting of variables which are expected to be correlated, and generates the next population by Bayesian sampling algorithm Experimental results show that the proposed algorithm can find global optimum and outperforms the simple genetic algorithm and BOA(Bayesian Optimization Algorithm) on decomposable functions with deceptive building blocks.
[1]
David E. Goldberg,et al.
Influence of selection and replacement strategies on linkage learning in BOA
,
2007,
2007 IEEE Congress on Evolutionary Computation.
[2]
Kalyanmoy Deb,et al.
Analyzing Deception in Trap Functions
,
1992,
FOGA.
[3]
Shumeet Baluja,et al.
A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
,
1994
.
[4]
Byoung-Tak Zhang,et al.
Hypernetworks: A Molecular Evolutionary Architecture for Cognitive Learning and Memory
,
2008,
IEEE Computational Intelligence Magazine.
[5]
Byoung-Tak Zhang,et al.
DNA Hypernetworks for Information Storage and Retrieval
,
2006,
DNA.