Influence of selection on structure learning in markov network EDAs: an empirical study

Learning a good model structure is important to the efficient solving of problems by estimation of distribution algorithms. In this paper we present the results of a series of experiments, applying a structure learning algorithm for undirected probabilistic graphical models based on statistical dependency tests to three fitness functions with different selection operators, proportions and pressures. The number of spurious interactions found by the algorithm are measured and reported. Truncation selection, and its complement (selecting only low fitness solutions) prove quite robust, resulting in a similar number of spurious dependencies regardless of selection pressure. In contrast, tournament and fitness proportionate selection are strongly affected by the selection proportion and pressure.

[1]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[2]  Shingo Mabu,et al.  Use of infeasible individuals in probabilistic model building genetic network programming , 2011, GECCO '11.

[3]  Paul A. Viola,et al.  MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

[4]  Pedro Larrañaga,et al.  Research topics in discrete estimation of distribution algorithms based on factorizations , 2009, Memetic Comput..

[5]  C. Reeves,et al.  Properties of fitness functions and search landscapes , 2001 .

[6]  Gilbert Owusu,et al.  A fully multivariate DEUM algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.

[7]  Martin Pelikan,et al.  Spurious dependencies and EDA scalability , 2010, GECCO '10.

[8]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[9]  Alexander E. I. Brownlee,et al.  Multivariate Markov networks for fitness modelling in an estimation of distribution algorithm , 2009 .

[10]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[11]  Shumeet Baluja,et al.  Using Optimal Dependency-Trees for Combinational Optimization , 1997, ICML.

[12]  Pedro Larrañaga,et al.  Exact Bayesian network learning in estimation of distribution algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.

[13]  Pedro Larrañaga,et al.  Interactions and dependencies in estimation of distribution algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[14]  Qingfu Zhang,et al.  Approaches to selection and their effect on fitness modelling in an Estimation of Distribution Algorithm , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[15]  Roberto Santana A Markov Network Based Factorized Distribution Algorithm for Optimization , 2003, ECML.

[16]  Qingfu Zhang,et al.  Structure learning and optimisation in a Markov-network based estimation of distribution algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.

[17]  Yi Hong,et al.  Estimation of distribution algorithms making use of both high quality and low quality individuals , 2009, 2009 IEEE International Conference on Fuzzy Systems.

[18]  Siddhartha Shakya,et al.  An EDA based on local markov property and gibbs sampling , 2008, GECCO '08.

[19]  Siddhartha Shakya,et al.  Markov Networks in Evolutionary Computation , 2012 .

[20]  Martin Pelikan,et al.  Analyzing Probabilistic Models in Hierarchical BOA , 2009, IEEE Transactions on Evolutionary Computation.

[21]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

[22]  Paul A. Watters,et al.  Statistics in a nutshell - a desktop quick reference , 2008 .

[23]  Masaharu Munetomo,et al.  Introducing assignment functions to Bayesian optimization algorithms , 2008, Inf. Sci..

[24]  Roberto Santana,et al.  Estimation of Distribution Algorithms with Kikuchi Approximations , 2005, Evolutionary Computation.

[25]  David E. Goldberg,et al.  Bayesian optimization algorithm: from single level to hierarchy , 2002 .

[26]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[27]  Pedro Larrañaga,et al.  Evolutionary computation based on Bayesian classifiers , 2004 .

[28]  L. A. Marascuilo,et al.  Nonparametric and Distribution-Free Methods for the Social Sciences , 1977 .

[29]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[30]  David E. Goldberg,et al.  Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination , 2005, GECCO '05.

[31]  Heinz Mühlenbein,et al.  Evolutionary optimization using graphical models , 2009, New Generation Computing.

[32]  Siddhartha Shakya,et al.  Optimization by estimation of distribution with DEUM framework based on Markov random fields , 2007, Int. J. Autom. Comput..

[33]  David E. Goldberg,et al.  Population sizing for entropy-based model building in discrete estimation of distribution algorithms , 2007, GECCO '07.

[34]  Concha Bielza,et al.  Mining probabilistic models learned by EDAs in the optimization of multi-objective problems , 2009, GECCO.

[35]  Conor Ryan,et al.  Using over-sampling in a Bayesian classifier EDA to solve deceptive and hierarchical problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[36]  David E. Goldberg,et al.  Scalability of the Bayesian optimization algorithm , 2002, Int. J. Approx. Reason..

[37]  David E. Goldberg,et al.  Model accuracy in the Bayesian optimization algorithm , 2011, Soft Comput..