A factor graph based genetic algorithm

Abbeel, P., Koller, D. and Ng, A.Y. (2006). Learning factor graphs in polynomial time and sample complexity, Journal of Machine Learning Research 7: 1743-1788.Search in Google Scholar

Gámez, J.A., Mateo, J.L. and Puerta, J.M. (2008). Improved EDNA (estimation of dependency networks algorithm) using combining function with bivariate probability distributions, Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO’08, Atlanta, GA, USA, pp. 407-414.Search in Google Scholar

Kschischang, F.R., Frey, B.J. and Loeliger, H.A. (2001). Factor graphs and the sum-product algorithm, IEEE Transactions on Information Theory 47(2): 498-519.10.1109/18.910572Search in Google Scholar

Kuang, D., Park, H. and Ding, C.H.Q. (2012). Symmetric nonnegative matrix factorization for graph clustering, Proceedings of the 12 SIAM International Conference on Data Mining, Anaheim, CA, USA, pp. 106-117.Search in Google Scholar

Larrañaga, P. and Lozano, J.A. (2001). Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer Academic Publishers, Norwell, MA.10.1007/978-1-4615-1539-5Search in Google Scholar

Lee, D.D. and Seung, H.S. (2001). Algorithms for non-negative matrix factorization, in T.K. Leen, T.G. Dietterich and V. Tresp (Eds.), Advances in Neural Information Processing Systems 13, MIT Press, Cambridge, MA, pp. 556-562.Search in Google Scholar

Mahnig, T. and M¨uhlenbein, H. (1999). FDA-a scalable evolutionary algorithm for the optimization of additively decomposed functions, Evolutionary Computation, 7(4): 353-376.10.1162/evco.1999.7.4.35310578027Search in Google Scholar

Mendiburu, A., Santana, R. and Lozano, J.A. (2007). Introducing belief propagation in estimation of distribution algorithms: A parallel approach, Technical Report EHUKAT- IK-11-07, University of the Basque Country, Bilbao.Search in Google Scholar

Miquelez, T., Bengoetxea, E. and Larra˜naga, P. (2004). Evolutionary computation based on Bayesian classifiers, International Journal of Applied Mathematics and Computer Science 14(3): 335-349.Search in Google Scholar

Mühlenbein, H. (2008). Convergence of estimation of distribution algorithms for finite samples, Technical report, Fraunhofer Institute for Autonomous Intelligent Systems, Sankt Augustin.Search in Google Scholar

Mühlenbein, H. (2012). Convergence theorems of estimation of distribution algorithms, in S. Shakya and R. Santana (Eds.), Markov Networks in Evolutionary Computation, Adaptation, Learning, and Optimization, Vol. 14, Springer, Berlin/Heidelberg, pp. 91-108.10.1007/978-3-642-28900-2_6Search in Google Scholar

Mühlenbein, H. and Paaß, G. (1996). From recombination of genes to the estimation of distributions, I: Binary parameters, in H.M. Voigt, W. Ebeling, I. Rechenberger and H.P. Schwefel (Eds.), Parallel Problem Solving from Nature IV, Vol. 1141, Lecture Notes in Computer Science, Springer-Verlag, London, pp. 178-187.10.1007/3-540-61723-X_982Search in Google Scholar

Munetomo, M. and Goldberg, D.E. (1999). Identifying linkage groups by nonlinearity/nonmonotonicity detection, Genetic and Evolutionary Computation Conference (GECCO-99), Orlando, FL, USA, pp. 433-440.Search in Google Scholar

Pelikan, M. (2005). Hierarchical Bayesian Optimization Algorithm, Springer-Verlag, Berlin/Heidelberg.10.1007/b10910Search in Google Scholar

Pelikan, M., Goldberg, D.E. and Lobo, F.G. (2002). A survey of optimization by building and using probabilistic models, Computational Optimization and Applications 21(1): 5-20.10.1023/A:1013500812258Search in Google Scholar

Pelikan, M., Hauschild, M., and Thierens, D. (2011). Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm, MEDAL Report No. 2011001, University of Missouri at St. Louis, St. Louis, MO.Search in Google Scholar

Santana, R., Larraaga, P. and Lozano, J. (2008). Adaptive estimation of distribution algorithms, in C. Cotta, M. Sevaux and K. Srensen (Eds.), Adaptive and Multilevel Metaheuristics, Studies in Computational Intelligence, Vol. 136, Springer, Berlin/Heidelberg, pp. 177-197.10.1007/978-3-540-79438-7_9Search in Google Scholar

Sastry, K. and Goldberg, D. (2004). Designing competent mutation operators via probabilistic model building of neighborhoods, in K. Deb (Ed.), Genetic and Evolutionary Computation, GECCO 2004, Lecture Notes in Computer Science, Vol. 3103, Springer, Berlin/Heidelberg, pp. 114-125.10.1007/978-3-540-24855-2_11Search in Google Scholar

Sastry, K. and Goldberg, D. E. (2000). On extended compact genetic algorithm, IlliGAL Report No. 2000026, University of Illinois at Urbana-Champaign, Urbana, IL.Search in Google Scholar

Thierens, D. (2010). Linkage tree genetic algorithm: First results, Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO’10), Portland, OR, USA, pp. 1953-1958.Search in Google Scholar

Yu, K., Yu, S. and Tresp, V. (2006). Soft clustering on graphs, in Y. Weiss, B. Sch¨olkopf and J. Platt (Eds.), Advances in Neural Information Processing Systems 18, MIT Press, Cambridge, MA, pp. 1553-1560.Search in Google Scholar

Yu, T.-L. (2006). A Matrix Approach for Finding Extrema: Problems with Modularity, Hierarchy, and Overlap, Ph.D. thesis, University of Illinois at Urbana-Champaign, Champaign, IL.Search in Google Scholar

Yu, T.-L. and Goldberg, D.E. (2006). Conquering hierarchical difficulty by explicit chunking: Substructural chromosome compression, 8th Annual Conference on Genetic and Evolutionary Computation, (GECCO-2006), Seattle, WA, USA, pp. 1385-1392.Search in Google Scholar

Yu, T.-L., Sastry, K., Goldberg, D. E. and Pelikan, M. (2007). Population sizing for entropy-based model building in discrete estimation of distribution algorithms, Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO ’07, London, UK, pp. 601-608.Search in Google Scholar

Zhou, D., Sch¨olkopf, B. and Hofmann, T. (2005). Semi-supervised learning on directed graphs, in L.K.Search in Google Scholar

Saul, Y. Weiss and L. Bottou (Eds.), Advances in Neural Information Processing Systems 17, MIT Press, Cambridge, MA, pp. 1633-1640. Search in Google Scholar