Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation
暂无分享,去创建一个
Jose A. Lozano | Roberto Santana | Alexander Mendiburu | J. A. Lozano | Roberto Santana | A. Mendiburu
[1] David E. Goldberg,et al. Designing Competent Mutation Operators Via Probabilistic Model Building of Neighborhoods , 2004, GECCO.
[2] Pedro Larrañaga,et al. The Role of a Priori Information in the Minimization of Contact Potentials by Means of Estimation of Distribution Algorithms , 2007, EvoBIO.
[3] M. Bayati,et al. Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality , 2008, IEEE Transactions on Information Theory.
[4] William T. Freeman,et al. Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.
[5] Avi Pfeffer,et al. Loopy Belief Propagation as a Basis for Communication in Sensor Networks , 2002, UAI.
[6] David E. Goldberg,et al. Loopy Substructural Local Search for the Bayesian Optimization Algorithm , 2009, SLS.
[7] Martin Pelikan,et al. Analyzing probabilistic models in hierarchical BOA on traps and spin glasses , 2007, GECCO '07.
[8] James M. Coughlan,et al. Finding Deformable Shapes Using Loopy Belief Propagation , 2002, ECCV.
[9] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..
[10] William T. Freeman,et al. Learning Low-Level Vision , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[11] Pedro Larrañaga,et al. Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation , 2010, Evolutionary Computation.
[12] Max Henrion,et al. Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.
[13] D. Goldberg,et al. BOA: the Bayesian optimization algorithm , 1999 .
[14] Pedro Larrañaga,et al. Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.
[15] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[16] Heinz Mühlenbein,et al. FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.
[17] Alberto Sanfeliu,et al. Progress in Pattern Recognition, Speech and Image Analysis , 2003, Lecture Notes in Computer Science.
[18] Pedro Larrañaga,et al. Combinatonal Optimization by Learning and Simulation of Bayesian Networks , 2000, UAI.
[19] Martin V. Butz,et al. Substructural Neighborhoods for Local Search in the Bayesian Optimization Algorithm , 2006, PPSN.
[20] Brian Potetz,et al. Efficient Belief Propagation for Vision Using Linear Constraint Nodes , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[21] Riccardo Poli,et al. Genetic and Evolutionary Computation – GECCO 2004 , 2004, Lecture Notes in Computer Science.
[22] David E. Goldberg,et al. Efficiency enhancement of genetic algorithms via building-block-wise fitness estimation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).
[23] Robin Hons,et al. Estimation of Distribution Algorithms and Minimum Relative Entropy , 2005 .
[24] Yair Weiss,et al. Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[25] Roberto Santana,et al. Analyzing the probability of the optimum in EDAs based on Bayesian networks , 2009, 2009 IEEE Congress on Evolutionary Computation.
[26] Siddhartha Shakya,et al. DEUM : a framework for an estimation of distribution algorithm based on Markov random fields , 2006 .
[27] Martin Pelikan,et al. Analyzing Probabilistic Models in Hierarchical BOA , 2009, IEEE Transactions on Evolutionary Computation.
[28] David E. Goldberg,et al. Evaluation relaxation using substructural information and linear estimation , 2006, GECCO '06.
[29] Pedro Larrañaga,et al. Exact Bayesian network learning in estimation of distribution algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.
[30] D. Nilsson,et al. An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems , 1998, Stat. Comput..
[31] Roberto Santana,et al. Toward Understanding EDAs Based on Bayesian Networks Through a Quantitative Analysis , 2012, IEEE Transactions on Evolutionary Computation.
[32] Yair Weiss,et al. Belief Propagation , 2012, Encyclopedia of Social Network Analysis and Mining.
[33] Hans-Paul Schwefel,et al. Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.
[34] Kalyanmoy Deb,et al. Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.
[35] Mads Nielsen,et al. Computer Vision — ECCV 2002 , 2002, Lecture Notes in Computer Science.
[36] M. Soto,et al. Too busy to learn [individual learning interaction with evolutionary algorithm in Busy Beaver problem] , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[37] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[38] Heinz Mühlenbein,et al. The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle , 2006, Scalable Optimization via Probabilistic Modeling.
[39] David E. Goldberg,et al. A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..
[40] Heinz Mühlenbein,et al. The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.
[41] Pedro Larrañaga,et al. Protein Folding in Simplified Models With Estimation of Distribution Algorithms , 2008, IEEE Transactions on Evolutionary Computation.
[42] David E. Goldberg,et al. Sporadic model building for efficiency enhancement of hierarchical BOA , 2006, GECCO.
[43] Heinz Mühlenbein,et al. A Maximum Entropy Approach to Sampling in EDA ? The Single Connected Case , 2003, CIARP.
[44] Martin Pelikan,et al. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) , 2006 .
[45] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[46] Endika Bengoetxea,et al. A parallel framework for loopy belief propagation , 2007, GECCO '07.
[47] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[48] S. Baluja,et al. Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .
[49] Edmund K. Burke,et al. Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.
[50] Y. Weiss,et al. Finding the M Most Probable Configurations using Loopy Belief Propagation , 2003, NIPS 2003.
[51] Martin J. Wainwright,et al. Tree consistency and bounds on the performance of the max-product algorithm and its generalizations , 2004, Stat. Comput..