{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:07:51Z","timestamp":1762506471530},"reference-count":121,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T00:00:00Z","timestamp":1419292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11047-014-9473-2","type":"journal-article","created":{"date-parts":[[2014,12,22]],"date-time":"2014-12-22T10:36:58Z","timestamp":1419244618000},"page":"165-180","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A review of message passing algorithms in estimation of distribution algorithms"],"prefix":"10.1007","volume":"15","author":[{"given":"Roberto","family":"Santana","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Mendiburu","sequence":"additional","affiliation":[]},{"given":"Jose A.","family":"Lozano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,23]]},"reference":[{"key":"9473_CR1","first-page":"1743","volume":"7","author":"P Abbeel","year":"2006","unstructured":"Abbeel P, Koller D, Ng AY (2006) Learning factor graphs in polynomial time and sample complexity. J Mach Learn Res 7:1743\u20131788","journal-title":"J Mach Learn Res"},{"key":"9473_CR2","first-page":"30","volume-title":"Proceedings of the 14th international conference on machine learning","author":"S Baluja","year":"1997","unstructured":"Baluja S, Davies S (1997) Using optimal dependency-trees for combinatorial optimization: learning the structure of the search space. In: Fisher DH (ed) Proceedings of the 14th international conference on machine learning. Morgan Kaufmann, San Francisco, pp 30\u201338"},{"key":"9473_CR3","doi-asserted-by":"crossref","unstructured":"Batra D, Gallagher A, Parikh D, Chen T (2010) Beyond trees: MRF inference via outer-planar decomposition. In: 2010 IEEE conference on computer vision and pattern recognition (CVPR). IEEE, San Francisco, pp 2496\u20132503","DOI":"10.1109\/CVPR.2010.5539951"},{"key":"9473_CR4","unstructured":"Bickson D (2008) Gaussian belief propagation: theory and application. arXiv preprint arXiv:0811.2518 . Accessed 18 Dec 2014"},{"issue":"2","key":"9473_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A Braunstein","year":"2005","unstructured":"Braunstein A, M\u00e9zard M, Zecchina R (2005) Survey propagation: an algorithm for satisfiability. Random Struct Algorithms 27(2):201\u2013226","journal-title":"Random Struct Algorithms"},{"key":"9473_CR6","first-page":"107","volume-title":"Computational complexity and statistical physics","author":"A Braunstein","year":"2006","unstructured":"Braunstein A, M\u00e9zard M, Zecchina R (2006) Constraint satisfaction by survey propagation. In: Percus A, Istrate G, Moore C (eds) Computational complexity and statistical physics. Oxford University Press, Oxford, pp 107\u2013124"},{"key":"9473_CR7","doi-asserted-by":"crossref","unstructured":"Brownlee AE, McCall JA, Shakya SK, Zhang Q (2010) Structure learning and optimisation in a Markov network based estimation of distribution algorithm. In: Exploitation of linkage learning in evolutionary algorithms. Springer, Berlin, pp 45\u201369","DOI":"10.1007\/978-3-642-12834-9_3"},{"key":"9473_CR8","unstructured":"Brownlee AEI (2009) Multivariate Markov networks for fitness modelling in an estimation of distribution algorithm. PhD Thesis, The Robert Gordon University, School of Computing, Aberdeen"},{"key":"9473_CR9","doi-asserted-by":"crossref","unstructured":"Brownlee AEI, McCall J, Pelikan M (2012) Influence of selection on structure learning in Markov network EDAs: an empirical study. MEDAL Report No. 2012006. Missouri Estimation of Distribution Algorithms Laboratory (MEDAL)","DOI":"10.1145\/2330163.2330200"},{"key":"9473_CR10","doi-asserted-by":"crossref","unstructured":"Brownlee AEI, McCall J, Zhang Q, Brown D (2008) Approaches to selection and their effect on fitness modelling in an estimation of distribution algorithm. In: Proceedings of the 2008 congress on evolutionary computation CEC-2008. IEEE Press, Hong Kong, pp 2621\u20132628","DOI":"10.1109\/CEC.2008.4631150"},{"issue":"1","key":"9473_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s13748-011-0005-3","volume":"1","author":"J Ceberio","year":"2012","unstructured":"Ceberio J, Irurozki E, Mendiburu A, Lozano JA (2012) A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Prog Artif Intell 1(1):103\u2013117","journal-title":"Prog Artif Intell"},{"key":"9473_CR12","doi-asserted-by":"crossref","unstructured":"Ceberio J, Mendiburu A, Lozano JA (2013) The Plackett\u2013Luce ranking model on permutation-based optimization problems. In: 2013 IEEE congress on evolutionary computation (CEC). IEEE, Canc\u00fan, pp 494\u2013501","DOI":"10.1109\/CEC.2013.6557609"},{"key":"9473_CR13","doi-asserted-by":"crossref","unstructured":"Chen B, Hu J (2010a) An adaptive niching EDA based on clustering analysis. In: 2010 IEEE congress on evolutionary computation (CEC). IEEE, Barcelona, pp 1\u20137","DOI":"10.1109\/CEC.2010.5586387"},{"key":"9473_CR14","doi-asserted-by":"crossref","unstructured":"Chen B, Hu J (2010b) A novel clustering based niching EDA for protein folding. In: Proceedings of the world congress on nature and biologically inspired computing, 2009. NaBIC 2009. IEEE, Coimbatore, pp 748\u2013753","DOI":"10.1109\/NABIC.2009.5393870"},{"key":"9473_CR15","unstructured":"Crick C, Pfeffer A (2003) Loopy belief propagation as a basis for communication in sensor networks. In: Proceedings of the 19th annual conference on uncertainty in artificial intelligence (UAI-2003). Morgan Kaufmann Publishers, San Francisco, pp 159\u2013166"},{"issue":"4","key":"9473_CR16","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1214\/aoms\/1177731829","volume":"11","author":"WE Deming","year":"1940","unstructured":"Deming WE, Stephan FF (1940) On a least squares adjustment of a sampled frequency table when the expected marginal totals are known. Ann Math Stat 11(4):427\u2013444","journal-title":"Ann Math Stat"},{"key":"9473_CR17","unstructured":"Dolev D, Bickson D, Johnson J (2009) Fixing convergence of Gaussian belief propagation. In: IEEE international symposium on information theory, 2009. ISIT 2009. IEEE, Seoul, pp 1674\u20131678"},{"issue":"12","key":"9473_CR18","doi-asserted-by":"crossref","first-page":"P12007","DOI":"10.1088\/1742-5468\/2011\/12\/P12007","volume":"2011","author":"E Dom\u00ednguez","year":"2011","unstructured":"Dom\u00ednguez E, Lage-Castellanos A, Mulet R, Ricci-Tersenghi F, Rizzo T (2011) Characterizing and improving generalized belief propagation algorithms on the 2D Edwards\u2013Anderson model. J Stat Mech Theory Exp 2011(12):P12007","journal-title":"J Stat Mech Theory Exp"},{"key":"9473_CR19","unstructured":"Dong W, Yao X (2008) NichingEDA: utilizing the diversity inside a population of EDAs for continuous optimization. In: Proceedings of the 2008 congress on evolutionary computation CEC-2008. IEEE Press, Hong Kong, pp 1260\u20131267"},{"key":"9473_CR20","doi-asserted-by":"crossref","unstructured":"Duchi J, Tarlow D, Elidan G, Koller D (2007) Using combinatorial optimization within max-product belief propagation. In: Advances in neural information processing systems 19: proceedings of the 2006 conference, vol 19. The MIT Press, Cambridge, p 369","DOI":"10.7551\/mitpress\/7503.003.0051"},{"key":"9473_CR21","unstructured":"Echegoyen C (2012) Contributions to the analysis and understanding of estimation of distribution algorithms. PhD Thesis, Department of Computer Science and Artificial Intelligence, University of the Basque Country"},{"key":"9473_CR22","doi-asserted-by":"crossref","unstructured":"Echegoyen C, Lozano JA, Santana R, Larra\u00f1aga P (2007) Exact Bayesian network learning in estimation of distribution algorithms. In: Proceedings of the 2007 congress on evolutionary computation CEC-2007. IEEE Press, Los Alamitos, pp 1051\u20131058. doi: 10.1109\/CEC.2007.4424586","DOI":"10.1109\/CEC.2007.4424586"},{"key":"9473_CR23","doi-asserted-by":"crossref","unstructured":"Echegoyen C, Santana R, Lozano JA, Larra\u00f1aga P (2008) The impact of probabilistic learning algorithms in EDAs based on Bayesian networks. In: Linkage in evolutionary computation, studies in computational intelligence. Springer, Berlin, pp 109\u2013139. doi: 10.1007\/978-3-540-85068-7_6","DOI":"10.1007\/978-3-540-85068-7_6"},{"key":"9473_CR24","doi-asserted-by":"crossref","unstructured":"Echegoyen C, Mendiburu A, Santana R, Lozano JA (2009) Analyzing the probability of the optimum in EDAs based on Bayesian networks. In: Proceedings of the 2009 congress on evolutionary computation CEC-2009. IEEE Press, Trondheim, pp 1652\u20131659. doi: 10.1109\/CEC.2009.4983140","DOI":"10.1109\/CEC.2009.4983140"},{"key":"9473_CR25","doi-asserted-by":"crossref","unstructured":"Echegoyen C, Mendiburu A, Santana R, Lozano JA (2010a) Analyzing the k most probable solutions in EDAs based on Bayesian networks. In: Exploitation of linkage learning in evolutionary algorithms, evolutionary learning and optimization. Springer, pp 163\u2013189. doi: 10.1007\/978-3-642-12834-9_8","DOI":"10.1007\/978-3-642-12834-9_8"},{"key":"9473_CR26","doi-asserted-by":"crossref","unstructured":"Echegoyen C, Mendiburu A, Santana R, Lozano JA (2010b) Estimation of Bayesian networks algorithms in a class of complex networks. In: Proceedings of the 2010 congress on evolutionary computation CEC-2010. IEEE Press, Barcelona. doi: 10.1109\/CEC.2010.5586511","DOI":"10.1109\/CEC.2010.5586511"},{"key":"9473_CR27","doi-asserted-by":"crossref","unstructured":"Echegoyen C, Zhang Q, Mendiburu A, Santana R, Lozano JA (2011) On the limits of effectiveness in estimation of distribution algorithms. In: Proceedings of the 2011 congress on evolutionary computation CEC-2007. IEEE Press, New Orleans, pp 1573\u20131580. doi: 10.1109\/CEC.2011.5949803","DOI":"10.1109\/CEC.2011.5949803"},{"issue":"2","key":"9473_CR28","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TEVC.2010.2102037","volume":"16","author":"C Echegoyen","year":"2012","unstructured":"Echegoyen C, Mendiburu A, Santana R, Lozano JA (2012) Toward understanding EDAs based on Bayesian networks through a quantitative analysis. IEEE Trans Evol Comput 16(2):173\u2013189. doi: 10.1109\/TEVC.2010.2102037","journal-title":"IEEE Trans Evol Comput"},{"key":"9473_CR29","first-page":"332","volume-title":"Proceedings of the second symposium on artificial intelligence (CIMAF-99)","author":"R Etxeberria","year":"1999","unstructured":"Etxeberria R, Larra\u00f1aga P (1999) Global optimization using Bayesian networks. In: Ochoa A, Soto MR, Santana R (eds) Proceedings of the second symposium on artificial intelligence (CIMAF-99). Editorial Academia, Havana, pp 332\u2013339"},{"key":"9473_CR30","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315:972\u2013976","journal-title":"Science"},{"key":"9473_CR31","unstructured":"Furtlehner C, Schoenauer M (2010) Multi-objective 3-SAT with survey-propagation. In: Proceedings of the NIPS 2010 workshop on discrete optimization in machine learning: structures, algorithms and applications (DISCML), Whistler, Canada. http:\/\/hal.inria.fr\/inria-00533149 Accessed 18 Dec 2014"},{"issue":"1","key":"9473_CR32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1162\/1063656053583423","volume":"13","author":"Y Gao","year":"2005","unstructured":"Gao Y, Culberson JC (2005) Space complexity of estimation of distribution algorithms. Evol Comput 13(1):125\u2013143","journal-title":"Evol Comput"},{"issue":"6","key":"9473_CR33","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1162\/neco.2009.05-08-785","volume":"21","author":"IE Givoni","year":"2009","unstructured":"Givoni IE, Frey BJ (2009) A binary variable model for affinity propagation. Neural Comput 21(6):1589\u20131600","journal-title":"Neural Comput"},{"key":"9473_CR34","unstructured":"Givoni IE, Chung C, Frey BJ (2011) Hierarchical affinity propagation. In: Proceedings of the 27th annual conference on uncertainty in artificial intelligence (UAI-2011). Morgan Kaufmann, Barcelona"},{"key":"9473_CR35","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading"},{"issue":"4","key":"9473_CR36","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0888-613X(02)00092-0","volume":"31","author":"C Gonz\u00e1lez","year":"2002","unstructured":"Gonz\u00e1lez C, Lozano JA, Larra\u00f1aga P (2002) Mathematical modeling of UMDAc algorithm with tournament selection. Behaviour on linear and quadratic functions. Int J Approx Reason 31(4):313\u2013340","journal-title":"Int J Approx Reason"},{"key":"9473_CR37","doi-asserted-by":"crossref","unstructured":"Grahl J, Minner S, Bosman PA (2008) Learning structure illuminates black boxes\u2014an introduction to estimation of distribution algorithms. In: Advances in metaheuristics for hard optimization. Springer, Berlin, pp 365\u2013395","DOI":"10.1007\/978-3-540-72960-0_18"},{"key":"9473_CR38","volume-title":"Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report 99010","author":"G Harik","year":"1999","unstructured":"Harik G (1999) Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report 99010. University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana"},{"key":"9473_CR39","doi-asserted-by":"crossref","DOI":"10.1002\/3527606734","volume-title":"Phase transitions in combinatorial optimization problems: basics, algorithms and statistical mechanics","author":"AK Hartmann","year":"2005","unstructured":"Hartmann AK, Weigt M (2005) Phase transitions in combinatorial optimization problems: basics, algorithms and statistical mechanics. Wiley, Weinheim"},{"issue":"3","key":"9473_CR40","doi-asserted-by":"crossref","first-page":"621","DOI":"10.2478\/amcs-2014-0045","volume":"24","author":"BH Helmi","year":"2014","unstructured":"Helmi BH, Rahmani AT, Pelikan M (2014) A factor graph based genetic algorithm. Int J Appl Math Comput Sci 24(3):621\u2013633","journal-title":"Int J Appl Math Comput Sci"},{"key":"9473_CR41","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/B978-0-444-70396-5.50019-4","volume-title":"Proceedings of the second annual conference on uncertainty in artificial intelligence","author":"M Henrion","year":"1988","unstructured":"Henrion M (1988) Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In: Lemmer JF, Kanal LN (eds) Proceedings of the second annual conference on uncertainty in artificial intelligence. Elsevier, Amsterdam, pp 149\u2013164"},{"key":"9473_CR42","doi-asserted-by":"crossref","first-page":"2379","DOI":"10.1162\/0899766041941943","volume":"16","author":"T Heskes","year":"2004","unstructured":"Heskes T (2004) On the uniqueness of belief propagation fixed points. Neural Comput 16:2379\u20132413","journal-title":"Neural Comput"},{"key":"9473_CR43","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann Arbor"},{"key":"9473_CR44","unstructured":"H\u00f6ns R (2006) Estimation of distribution algorithms and minimum relative entropy. PhD Thesis, University of Bonn, Bonn"},{"key":"9473_CR45","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-642-28900-2_11","volume-title":"Markov networks in evolutionary computation","author":"R H\u00f6ns","year":"2012","unstructured":"H\u00f6ns R (2012) Using maximum entropy and generalized belief propagation in estimation of distribution algorithms. In: Shakya S, Santana R (eds) Markov networks in evolutionary computation. Springer, Berlin, pp 175\u2013190"},{"key":"9473_CR46","unstructured":"H\u00f6ns R, Santana R, Larra\u00f1aga P, Lozano JA (2007) Optimization by max-propagation using Kikuchi approximations. Technical Report EHU-KZAA-IK-2\/07. Department of Computer Science and Artificial Intelligence, University of the Basque Country"},{"issue":"1","key":"9473_CR47","first-page":"905","volume":"6","author":"AT Ihler","year":"2006","unstructured":"Ihler AT, Fisher J, Willsky AS (2006) Loopy belief propagation: convergence and effects of message errors. J Mach Learn Res 6(1):905","journal-title":"J Mach Learn Res"},{"key":"9473_CR48","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-9473(93)E0055-9","volume":"19","author":"R Jirou\u0161ek","year":"1995","unstructured":"Jirou\u0161ek R, P\u0159eu\u010dil S (1995) On the effective implementation of the iterative proportional fitting procedure. Comput Stat Data Anal 19:177\u2013189","journal-title":"Comput Stat Data Anal"},{"key":"9473_CR49","doi-asserted-by":"crossref","unstructured":"Johnson A, Shapiro JL (2002) The importance of selection mechanisms in distribution estimation algorithms. In: Collet P (ed) Proceedings of EA 2001, lecture notes in computer science, vol 2310. Springer, pp 91\u2013103","DOI":"10.1007\/3-540-46033-0_8"},{"key":"9473_CR50","doi-asserted-by":"crossref","unstructured":"Kaban A, Bootkrajang J, Durrant RJ (2013) Towards large scale continuous EDA: a random matrix theory perspective. In: Proceedings of the genetic and evolutionary computation conference GECCO-2013. ACM, Amsterdam, pp 383\u2013390","DOI":"10.1145\/2463372.2463423"},{"key":"9473_CR51","doi-asserted-by":"crossref","unstructured":"Karshenas H, Santana R, Bielza C, Larra\u00f1aga P (2011) Multi-objective optimization with joint probabilistic modeling of objectives and variables. In: Evolutionary multi-criterion optimization: sixth international conference, EMO 2011, lecture notes in computer science. Springer, Berlin, pp 298\u2013312. doi: 10.1007\/978-3-642-19893-9_21","DOI":"10.1007\/978-3-642-19893-9_21"},{"key":"9473_CR52","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-642-28900-2_10","volume-title":"Markov networks in evolutionary computation","author":"H Karshenas","year":"2012","unstructured":"Karshenas H, Santana R, Bielza C, Larra\u00f1aga P (2012) Continuous estimation of distribution algorithms based on factorized Gaussian Markov networks. In: Shakya S, Santana R (eds) Markov networks in evolutionary computation. Springer, Berlin, pp 157\u2013173. doi: 10.1007\/978-3-642-28900-2-10"},{"key":"9473_CR53","doi-asserted-by":"crossref","unstructured":"Kim K, McKay BR, Punithan D (2010) Sampling bias in estimation of distribution algorithms for genetic programming using prototype trees. In: PRICAI 2010: trends in artificial intelligence. Springer, Berlin, pp 100\u2013111","DOI":"10.1007\/978-3-642-15246-7_12"},{"key":"9473_CR54","doi-asserted-by":"crossref","unstructured":"Kroc L, Sabharwal A, Selman B (2009) Message-passing and local heuristics as decimation strategies for satisfiability. In: Proceedings of the 2009 ACM symposium on applied computing. ACM, Honolulu, pp 1408\u20131414","DOI":"10.1145\/1529282.1529596"},{"issue":"2","key":"9473_CR55","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang FR, Frey BJ, Loeliger HA (2001) Factor graphs and the sum\u2013product algorithm. IEEE Trans Inf Theory 47(2):498\u2013519","journal-title":"IEEE Trans Inf Theory"},{"key":"9473_CR56","volume-title":"Estimation of distribution algorithms. A new tool for evolutionary computation","year":"2002","unstructured":"Larra\u00f1aga P, Lozano JA (eds) (2002) Estimation of distribution algorithms. A new tool for evolutionary computation. Kluwer Academic Publishers, Boston"},{"issue":"20","key":"9473_CR57","doi-asserted-by":"crossref","first-page":"2708","DOI":"10.1093\/bioinformatics\/btm414","volume":"23","author":"M Leone","year":"2007","unstructured":"Leone M, Weigt S, Weigt M (2007) Clustering by soft-constraint affinity propagation: applications to gene-expression data. Bioinformatics 23(20):2708\u20132715","journal-title":"Bioinformatics"},{"key":"9473_CR58","doi-asserted-by":"crossref","unstructured":"Lima CF (2009) Substructural local search in discrete estimation of distribution algorithms. PhD Thesis, University of Algarve","DOI":"10.1007\/978-3-642-03751-1_5"},{"key":"9473_CR59","doi-asserted-by":"crossref","unstructured":"Lima CF, Pelikan M, Goldberg DE, Lobo FG, Sastry K, Hauschild M (2007) Influence of selection and replacement strategies on linkage learning in BOA. In: Proceedings of the 2007 congress on evolutionary computation CEC-2007. IEEE Press, Los Alamitos, pp 1083\u20131090","DOI":"10.1109\/CEC.2007.4424590"},{"key":"9473_CR60","doi-asserted-by":"crossref","unstructured":"Lima CF, Pelikan M, Lobo FG, Goldberg DE (2009) Loopy substructural local search for the Bayesian optimization algorithm. In: Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Springer, Berlin, pp 61\u201375","DOI":"10.1007\/978-3-642-03751-1_5"},{"key":"9473_CR61","volume-title":"Towards a new evolutionary computation: advances on estimation of distribution algorithms","year":"2006","unstructured":"Lozano JA, Larra\u00f1aga P, Inza I, Bengoetxea E (eds) (2006) Towards a new evolutionary computation: advances on estimation of distribution algorithms. Springer, Heidelberg"},{"key":"9473_CR62","unstructured":"Mahfoud SW (1995) Niching methods for genetic algorithms. PhD Thesis, University of Illinois at Urbana-Champaign, Urbana. Also IlliGAL Report No. 95001"},{"key":"9473_CR63","first-page":"2031","volume":"7","author":"DM Malioutov","year":"2006","unstructured":"Malioutov DM, Johnson JK, Willsky AS (2006) Walk-sums and belief propagation in Gaussian graphical models. J Mach Learn Res 7:2031\u20132064","journal-title":"J Mach Learn Res"},{"key":"9473_CR64","doi-asserted-by":"crossref","unstructured":"Meltzer T, Yanover C, Weiss Y (2005) Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In: Tenth IEEE international conference on computer vision, pp 428\u2013435","DOI":"10.1109\/ICCV.2005.110"},{"issue":"4","key":"9473_CR65","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/TEVC.2005.850299","volume":"9","author":"A Mendiburu","year":"2005","unstructured":"Mendiburu A, Lozano J, Miguel-Alonso J (2005) Parallel implementation of EDAs based on probabilistic graphical models. IEEE Trans Evol Comput 9(4):406\u2013423","journal-title":"IEEE Trans Evol Comput"},{"key":"9473_CR66","doi-asserted-by":"crossref","unstructured":"Mendiburu A, Santana R, Bengoetxea E, Lozano, J (2007a) A parallel framework for loopy belief propagation. In: Thierens D et al (eds) Proceedings of the genetic and evolutionary computation conference GECCO-2007, vol II. Companion material. ACM Press, London, pp 2843\u20132850. http:\/\/dl.acm.org\/citation.cfm?id=1274084 Accessed 18 Dec 2014","DOI":"10.1145\/1274000.1274084"},{"key":"9473_CR67","unstructured":"Mendiburu A, Santana R, Lozano JA (2007b) Introducing belief propagation in estimation of distribution algorithms: a parallel framework. Technical Report EHU-KAT-IK-11\/07. Department of Computer Science and Artificial Intelligence, University of the Basque Country"},{"key":"9473_CR68","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-28900-2_9","volume-title":"Markov networks in evolutionary computation","author":"A Mendiburu","year":"2012","unstructured":"Mendiburu A, Santana R, Lozano JA (2012) Fast fitness improvements in estimation of distribution algorithms using belief propagation. In: Santana R, Shakya S (eds) Markov networks in evolutionary computation. Springer, Berlin, pp 141\u2013155. doi: 10.1007\/978-3-642-28900-2-9"},{"key":"9473_CR69","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1126\/science.1073287","volume":"297","author":"M M\u00e9zard","year":"2002","unstructured":"M\u00e9zard M, Parisi G, Zechina R (2002) Analytic and algorithmic solution of random satisfiability problems. Science 297:812\u2013812. doi: 10.1126\/science.1073287","journal-title":"Science"},{"key":"9473_CR70","unstructured":"Minka T (2001) A family of algorithms for approximate bayesian inference. PhD Thesis, Massachusetts Institute of Technology"},{"key":"9473_CR71","unstructured":"Minka T (2005) Divergence measures and message passing. Technical Report TR-2005-173. Mitsubishi Electric Research Laboratories"},{"key":"9473_CR72","unstructured":"Mooij JM (2005) Validity estimates for loopy belief propagation on binary real-world networks. In: Advances in neural information processing systems 17. MIT Press, Cambridge, pp 945\u2013952"},{"key":"9473_CR73","first-page":"2169","volume":"11","author":"J Mooij","year":"2010","unstructured":"Mooij J (2010) libDAI: a free and open source C++ library for discrete approximate inference in graphical models. J Mach Learn Res 11:2169\u20132173","journal-title":"J Mach Learn Res"},{"key":"9473_CR74","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-642-28900-2_6","volume-title":"Markov networks in evolutionary computation","author":"H M\u00fchlenbein","year":"2012","unstructured":"M\u00fchlenbein H (2012) Convergence theorems of estimation of distribution algorithms. In: Shakya S, Santana R (eds) Markov networks in evolutionary computation. Springer, Berlin, pp 91\u2013108"},{"key":"9473_CR75","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein H, H\u00f6ns R (2006) The factorized distributions and the minimum relative entropy principle. In: Pelikan M, Sastry K, Cant\u00fa-Paz E (eds) Scalable optimization via probabilistic modeling: from algorithms to applications, studies in computational intelligence. Springer, Berlin, pp 11\u201338","DOI":"10.1007\/978-3-540-34954-9_2"},{"issue":"3","key":"9473_CR76","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0888-613X(02)00093-2","volume":"31","author":"H M\u00fchlenbein","year":"2002","unstructured":"M\u00fchlenbein H, Mahnig T (2002) Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning. Int J Approx Reason 31(3):157\u2013192","journal-title":"Int J Approx Reason"},{"key":"9473_CR77","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel problem solving from nature\u2014PPSN IV, lectures notes in computer science","author":"H M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein H, Paa\u00df G (1996) From recombination of genes to the estimation of distributions I. Binary parameters. In: Voigt HM, Ebeling W, Rechenberg I, Schwefel HP (eds) Parallel problem solving from nature\u2014PPSN IV, lectures notes in computer science, vol 1141. Springer, Berlin, pp 178\u2013187"},{"issue":"2","key":"9473_CR78","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1009689913453","volume":"5","author":"H M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein H, Mahnig T, Ochoa A (1999) Schemata, distributions and graphical models in evolutionary optimization. J Heuristics 5(2):213\u2013247","journal-title":"J Heuristics"},{"issue":"1","key":"9473_CR79","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.ins.2007.08.014","volume":"178","author":"M Munetomo","year":"2008","unstructured":"Munetomo M, Murao N, Akama K (2008) Introducing assignment functions to Bayesian optimization algorithms. Inf Sci 178(1):152\u2013163","journal-title":"Inf Sci"},{"key":"9473_CR80","unstructured":"Murphy KP, Weiss Y, Jordan MI (1999) Loopy belief propagation for approximate inference: an empirical study. In: Proceedings of the fifteenth conference on Uncertainty in artificial intelligence. Morgan Kaufmann Publishers, Inc., San Francisco, pp 467\u2013475"},{"key":"9473_CR81","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1008990218483","volume":"2","author":"D Nilsson","year":"1998","unstructured":"Nilsson D (1998) An efficient algorithm for finding the M most probable configurations in probabilistic expert systems. Stat Comput 2:159\u2013173","journal-title":"Stat Comput"},{"key":"9473_CR82","unstructured":"Ocenasek J, Schwarz J (2002) Estimation of distribution algorithm for mixed continuous\u2013discrete optimization problems. In: Proceedings of the 2nd Euro-international symposium on computational intelligence. IOS Press, Kosice, pp 227\u2013232"},{"key":"9473_CR83","doi-asserted-by":"crossref","unstructured":"Ochoa A, H\u00f6ns R, Soto MR, M\u00fchlenbein H (2003) A maximum entropy approach to sampling in EDA\u2014the single connected case. In: Progress in pattern recognition, speech and image analysis, lectures notes in computer science, vol 2905. Springer, Berlin, pp 683\u2013690","DOI":"10.1007\/978-3-540-24586-5_84"},{"key":"9473_CR84","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J Pearl","year":"1988","unstructured":"Pearl J (1988) Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Mateo"},{"issue":"1","key":"9473_CR85","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M Pelikan","year":"2002","unstructured":"Pelikan M, Goldberg DE, Lobo F (2002) A survey of optimization by building and using probabilistic models. Comput Optim Appl 21(1):5\u201320","journal-title":"Comput Optim Appl"},{"issue":"1","key":"9473_CR86","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1162\/1063656053583432","volume":"13","author":"J Pe\u00f1a","year":"2005","unstructured":"Pe\u00f1a J, Lozano JA, Larra\u00f1aga P (2005) Globally multimodal problem optimization via an estimation of distribution algorithm based on unsupervised learning of Bayesian networks. Evol Comput 13(1):43\u201366","journal-title":"Evol Comput"},{"key":"9473_CR87","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-28900-2_7","volume-title":"Markov networks in evolutionary computation","author":"E Ponce de Le\u00f3n","year":"2012","unstructured":"Ponce de Le\u00f3n E, D\u00edaz E (2012) 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. Springer, Berlin, pp 109\u2013123"},{"key":"9473_CR88","unstructured":"Regnier-Coudert O (2013) Bayesian network structure learning using characteristic properties of permutation representations with applications to prostate cancer treatment. PhD Thesis, Robert Gordon University"},{"key":"9473_CR89","volume-title":"Design of an algorithm based on the estimation of distributions to generate new rules in the XCS classifier system. Technical Report ICIMAF 2000-100, CEMAFIT 2000-78","author":"JP Rivera","year":"2000","unstructured":"Rivera JP, Santana R (2000) Design of an algorithm based on the estimation of distributions to generate new rules in the XCS classifier system. Technical Report ICIMAF 2000-100, CEMAFIT 2000-78. Institute of Cybernetics, Mathematics and Physics, Havana"},{"key":"9473_CR90","volume-title":"Factorized Distribution Algorithms: selection without selected population. Technical Report ICIMAF 2003-240","author":"R Santana","year":"2003","unstructured":"Santana R (2003) Factorized Distribution Algorithms: selection without selected population. Technical Report ICIMAF 2003-240. Institute of Cybernetics, Mathematics and Physics, Havana"},{"key":"9473_CR91","unstructured":"Santana R (2006) Advances in probabilistic graphical models for optimization and learning. Applications in protein modelling. PhD Thesis, University of the Basque Country"},{"key":"9473_CR92","doi-asserted-by":"crossref","unstructured":"Santana R, Larra\u00f1aga P, Lozano JA (2005) Interactions and dependencies in estimation of distribution algorithms. In: Proceedings of the 2005 congress on evolutionary computation CEC-2005. IEEE Press, Edinburgh, pp 1418\u20131425. doi: 10.1109\/CEC.2005.1554856","DOI":"10.1109\/CEC.2005.1554856"},{"key":"9473_CR93","unstructured":"Santana R, Mendiburu A, Lozano JA (2008) An empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs. In: Jaeger M, Nielsen TD (eds) Proceedings of the fourth European workshop on probabilistic graphical models (PGM-2008), pp 249\u2013256"},{"key":"9473_CR94","doi-asserted-by":"crossref","unstructured":"Santana R, Larra\u00f1aga P, Lozano JA (2010) Learning factorizations in estimation of distribution algorithms using affinity propagation. Evol Comput 18(4):515\u2013546. http:\/\/www.mitpressjournals.org\/doi\/abs\/10.1162\/EVCO_a_00002 . Accessed 18 Dec 2014","DOI":"10.1162\/EVCO_a_00002"},{"key":"9473_CR95","doi-asserted-by":"crossref","unstructured":"Santana R, Mendiburu A, Lozano JA (2012a) Evolving NK-complexity for evolutionary solvers. In: Companion proceedings of the 2012 genetic and evolutionary computation conference GECCO-2012. ACM Press, Philadelphia, pp 1473\u20131474. http:\/\/dl.acm.org\/citation.cfm?id=2330997 . Accessed 18 Dec 2014","DOI":"10.1145\/2330784.2330997"},{"key":"9473_CR96","unstructured":"Santana R, Mendiburu A, Lozano JA (2012b) New methods for generating populations in Markov network based EDAs: decimation strategies and model-based template recombination. Technical Report EHU-KZAA-TR:2012-05. Department of Computer Science and Artificial Intelligence, University of the Basque Country. http:\/\/hdl.handle.net\/10810\/9180 . Accessed 18 Dec 2014"},{"key":"9473_CR97","doi-asserted-by":"crossref","unstructured":"Santana R, Mendiburu A, Lozano JA (2013) Message passing methods for estimation of distribution algorithms based on Markov networks. In: Proceedings of the 4th conference on swarm, evolutionary, and memetic computing (SEMCCO-2013), lectures notes in computer science. Springer, Chennai, pp 419\u2013430 (in press)","DOI":"10.1007\/978-3-319-03756-1_38"},{"key":"9473_CR98","doi-asserted-by":"crossref","unstructured":"Sastry K, Abbass HA, Goldberg DE, Johnson D (2005) Sub-structural niching in estimation of distribution algorithms. In: Proceedings of the 2005 conference on genetic and evolutionary computation. ACM, Washington, DC, pp 671\u2013678","DOI":"10.1145\/1068009.1068123"},{"key":"9473_CR99","doi-asserted-by":"crossref","unstructured":"Sastry K, Lima CF, Goldberg DE (2006) Evaluation relaxation using substructural information and linear estimation. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 419\u2013426","DOI":"10.1145\/1143997.1144074"},{"key":"9473_CR100","first-page":"577","volume-title":"Proceedings of the genetic and evolutionary computation conference GECCO-2007","author":"K Sastry","year":"2007","unstructured":"Sastry K, Goldberg DE, Llor\u00e1 X (2007) Towards billion-bit optimization via a parallel estimation of distribution algorithm. In: Thierens D et al (eds) Proceedings of the genetic and evolutionary computation conference GECCO-2007, vol I. ACM Press, London, pp 577\u2013584"},{"key":"9473_CR101","doi-asserted-by":"crossref","unstructured":"Sato H, Hasegawa Y, Bollegala D, Iba H (2012) Probabilistic model building GP with belief propagation. In: 2012 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2012.6256483"},{"issue":"2","key":"9473_CR102","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10710-011-9149-y","volume":"13","author":"S Shakya","year":"2012","unstructured":"Shakya S, Santana R, Lozano JA (2012) A Markovianity based optimisation algorithm. Genet Program Evol Mach 13(2):159\u2013195. doi: 10.1007\/s10710-011-9149-y","journal-title":"Genet Program Evol Mach"},{"key":"9473_CR103","unstructured":"Soto MR (2003) A single connected factorized distribution algorithm and its cost of evaluation. PhD Thesis, University of Havana, Havana (in Spanish)"},{"key":"9473_CR104","doi-asserted-by":"crossref","unstructured":"Suwannik W, Chongstitvatana P (2008) Solving one-billion-bit noisy OneMax problem using estimation distribution algorithm with arithmetic coding. In: Proceedings of the 2008 congress on evolutionary computation CEC-2008. IEEE Press, Hong Kong, pp 1203\u20131206","DOI":"10.1109\/CEC.2008.4630949"},{"issue":"36","key":"9473_CR105","doi-asserted-by":"crossref","first-page":"8675","DOI":"10.1088\/0305-4470\/37\/36\/007","volume":"37","author":"K Tanaka","year":"2004","unstructured":"Tanaka K, Shouno H, Okada M, Titterington D (2004) Accuracy of the Bethe approximation for hyperparameter estimation in probabilistic image processing. J Phys A 37(36):8675","journal-title":"J Phys A"},{"key":"9473_CR106","doi-asserted-by":"crossref","unstructured":"Valdez-Pe\u00f1a IS, Hern\u00e1ndez-Aguirre A, Botello-Rionda S (2009) Approximating the search distribution to the selection distribution in EDAs. In: Proceedings of the genetic and evolutionary computation conference GECCO-2009. ACM, New York, pp 461\u2013468","DOI":"10.1145\/1569901.1569965"},{"key":"9473_CR107","unstructured":"Van Hoyweghen C, Goldberg D, Naudts B (2002a) From twomax to the Ising model: easy and hard symmetrical problems. In: Proceedings of the genetic and evolutionary computation conference GECCO-2002. Morgan Kaufmann Publishers, Inc., San Francisco, pp 626\u2013633"},{"issue":"4","key":"9473_CR108","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1162\/106365602760972749","volume":"10","author":"C Hoyweghen Van","year":"2002","unstructured":"Van Hoyweghen C, Naudts B, Goldberg D (2002b) Spin-flip symmetry and synchronization. Evol Comput 10(4):317\u2013344","journal-title":"Evol Comput"},{"key":"9473_CR109","volume-title":"Graphical models, exponential families, and variational inference. Technical Report 649","author":"MJ Wainwright","year":"2003","unstructured":"Wainwright MJ, Jordan MI (2003) Graphical models, exponential families, and variational inference. Technical Report 649. Department of Statistics, University of California, Berkeley"},{"key":"9473_CR110","first-page":"809","volume":"15","author":"M Wainwright","year":"2002","unstructured":"Wainwright M, Jaakkola T, Willsky A (2002) Exact MAP estimates by (hyper) tree agreement. Adv Neural Inf Process Syst 15:809\u2013816","journal-title":"Adv Neural Inf Process Syst"},{"key":"9473_CR111","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/B:STCO.0000021412.33763.d5","volume":"14","author":"M Wainwright","year":"2004","unstructured":"Wainwright M, Jaakkola T, Willsky A (2004) Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Stat Comput 14:143\u2013166","journal-title":"Stat Comput"},{"key":"9473_CR112","unstructured":"Wang Z, Zoghi M, Hutter F, Matheson D, De Freitas N (2013) Bayesian optimization in high dimensions via random embeddings. In: Proceedings of the Twenty-Third international joint conference on Artificial Intelligence. AAAI Press, Chicago, pp 1778\u20131784"},{"key":"9473_CR113","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/089976600300015880","volume":"12","author":"Y Weiss","year":"2000","unstructured":"Weiss Y (2000) Correctness of local probability propagation in graphical models with loops. Neural Comput 12:1\u201341","journal-title":"Neural Comput"},{"issue":"2","key":"9473_CR114","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1109\/18.910585","volume":"47","author":"Y Weiss","year":"2001","unstructured":"Weiss Y, Freeman WT (2001) On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Trans Inf Theory 47(2):723\u2013735","journal-title":"IEEE Trans Inf Theory"},{"key":"9473_CR115","unstructured":"Welling M (2004) On the choice of regions for generalized belief propagation. In: Proceedings of the 20th conference on uncertainty in artificial intelligence (UAI-2004). Morgan Kaufmann Publishers, Banff, pp 585\u2013592"},{"key":"9473_CR116","unstructured":"Wiegerinck W, Heskes T (2003) Fractional belief propagation. In: Advances in neural information processing systems. MIT, Vancouver, pp 455\u2013462"},{"key":"9473_CR117","volume-title":"Graph partition strategies for generalized mean field inference. Technical Report CSD-03-1274","author":"EP Xing","year":"2003","unstructured":"Xing EP, Jordan MI (2003) Graph partition strategies for generalized mean field inference. Technical Report CSD-03-1274. Division of Computer Science, University of California, Berkeley"},{"key":"9473_CR118","first-page":"1457","volume-title":"Advances in neural information processing systems 15","author":"C Yanover","year":"2003","unstructured":"Yanover C, Weiss Y (2003) Approximate inference and protein-folding. In: Becker S, Thrun S, Obermayer K (eds) Advances in neural information processing systems 15. MIT Press, Cambridge, pp 1457\u20131464"},{"issue":"7","key":"9473_CR119","doi-asserted-by":"crossref","first-page":"2282","DOI":"10.1109\/TIT.2005.850085","volume":"51","author":"JS Yedidia","year":"2005","unstructured":"Yedidia JS, Freeman WT, Weiss Y (2005) Constructing free energy approximations and generalized belief propagation algorithms. IEEE Trans Inf Theory 51(7):2282\u20132312","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"9473_CR120","first-page":"1691","volume":"14","author":"A Yuille","year":"2001","unstructured":"Yuille A (2001) A double-loop algorithm to minimize the Bethe and Kikuchi free energies. Neural Comput 14(6):1691\u20131722","journal-title":"Neural Comput"},{"issue":"3","key":"9473_CR121","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein S (1996) Using anytime algorithms in intelligent systems. AI Mag 17(3):73","journal-title":"AI Mag"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-014-9473-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-014-9473-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-014-9473-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T21:09:36Z","timestamp":1690751376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-014-9473-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,23]]},"references-count":121,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9473"],"URL":"https:\/\/doi.org\/10.1007\/s11047-014-9473-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,23]]}}}