A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Loopy Substructural Local Search for the Bayesian Optimization Algorithm
[chapter]
2009
Lecture Notes in Computer Science
This paper presents a local search method for the Bayesian optimization algorithm (BOA) based on the concepts of substructural neighborhoods and loopy belief propagation. The probabilistic model of BOA, which automatically identifies important problem substructures, is used to define the topology of the neighborhoods explored in local search. On the other hand, belief propagation in graphical models is employed to find the most suitable configuration of conflicting substructures. The results
doi:10.1007/978-3-642-03751-1_5
fatcat:vlxxqdosnjewpeigbwdv5hkquq