Abstract
Linkage learning to identify the interaction structure of an optimization problem helps the evolutionary algorithms to search the optimal solution. Learning the structure of a distribution representing the interactions of the optimization problem is equivalent to learning the variables of the problem linkage. The objective of this paper is to test the efficiency of an EDA that use Boltzmann selection and a cliqued Gibbs sampler (named Adaptive Extended Tree Cliqued - EDA (AETCEDA)) to learn the linkage of the problem and generate samples. Some optimization problems difficult for the Genetic Algorithms are used to test the proposed algorithm. As results of the experiment is to emphasize that the difficulty of the optimization, as assessed by the number of evaluations, is proportional to the sizes of the cliques of the learned models, that in time, is proportional to the structure of the test problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akaike, H.: A New Look at the Statistical Model Identification. IEEE Transactions on Automatic Control 19(6), 716–723 (1974)
Berge, C.: Graphs and Hypergraph. North-Holland, Amsterdam (1976)
Besag, J.E.: Spatial interaction and the statistical analysis of lattice systems (with discussion). J. Royal Statist. Soc. Series B. 36, 192–326 (1974)
Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory IT-14(3), 462–467 (1968)
De la Maza, M., Tidor, B.: An analysis of selection procedures with particular attention paid to proportional and Boltzmann selection. In: Proceedings of the 5th International Conference on Genetic Algorithms, pp. 124–131. Morgan Kaufmann Publishers Inc., San Francisco (1993)
Diaz, E., Ponce-de-Leon, E., Larrañaga, P., Bielza, C.: Probabilistic Graphical Markov Model Learning: An Adaptive Strategy. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds.) MICAI 2009. LNCS, vol. 5845, pp. 225–236. Springer, Heidelberg (2009)
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions and the bayesian distribution of images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 721–741 (1984)
Holland, J.H.: Adaptation in natural and artificial system, pp. 11–12. Univ. of Michigan Press, Ann. Arbor (1975/1992)
Kindermann, R., Snell, J.L.: Markov random fields and their applications. American Mathematical Society, Contemporary Mathematics, Providence, RI (1980)
Kruskal, J.B.: On the Shortest Spanning Tree of a Graph and the Traveling Salesman Problem. Proceeding American Mathematical Society 7, 48–50 (1956)
Lauritzen, S.L.: Graphical models. Oxford University Press, USA (1996)
Mühlenbein, H.: The equation for the response to selection and its use for prediction. Evolutionary Computation 5(3), 303–346 (1997)
Mühlenbein, H., Mahnig, T., Ochoa Rodriguez, A.: Schemata, Distributions and Graphical Models in Evolutionary Optimization. Journal of Heuristic 5(2), 215–247 (1999)
Mühlenbein, H., Paaß, G.: From Recombination of Genes to the Estimation of Distributions I. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178–187. Springer, Heidelberg (1996)
Munetomo, M., Goldberg, D.E.: Linkage Identification by Non - monotonicity Detection for Overlapping Functions. Evolutionary Computation 7(4), 377–398 (1999)
Pelikan, M.: Bayesian Optimization Algorithm: From Single Level to Hierarchy. University Illinois at Urbana Champain, PHD Thesis. Also IlliGAL Report No. 2002023 (2002)
Pelikan, M., Mühlenbein, H.: The bivariate marginal distribution algorithm. In: Roy, R., Furuhashi, T., Chawdhry, P.K. (eds.) Advances in Soft Computing - Engineering Design and Manufacturing, pp. 521–535. Springer, London (1999)
Ponce-de-Leon-Senti, E., Diaz, E.: Adaptive Evolutionary Algorithm based on a Cliqued Gibbs Sampling over Graphical Markov Model Structure. In: Shakya, S., Santana, R. (eds.) Markov Networks in Evolutionary Computation. Adaptation, Learning, and Optimization, vol. 14, pp. 109–123. Springer, Heidelberg (2012)
Santana, R., Mühlenbein, H.: Blocked Stochastic Sampling versus Estimation of Distribution Algorithms. In: Proceedings of the 2002 Congress on the Evolutionary Computation, CEC 2002, vol. 2, pp. 1390–1395. IEEE Press (2002)
Winter, P.C., Hickey, G.I., Fletcher, H.L.: Instant Notes in Genetics, 2nd edn. Springer, New York (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ponce-de-Leon-Senti, E.E., Diaz-Diaz, E. (2013). Linkage Learning Using Graphical Markov Model Structure: An Experimental Study. In: Schütze, O., et al. EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II. Advances in Intelligent Systems and Computing, vol 175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31519-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-31519-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31518-3
Online ISBN: 978-3-642-31519-0
eBook Packages: EngineeringEngineering (R0)