The learning of PGMs encoding multivariate distributions is a computationally expensive task, therefore, it is usual for EDAs to estimate multivariate statistics from bivariate statistics. Such relaxation allows PGM to be built in polynomial time in <math>N</math>; however, it also limits the generality of such EDAs.
The learning of PGMs encoding multivariate distributions is a computationally expensive task, therefore, it is usual for EDAs to estimate multivariate statistics from bivariate statistics. Such relaxation allows PGM to be built in polynomial time in <math>N</math>; however, it also limits the generality of such EDAs.<ref>{{cite journal|last1=Martins|first1=Jean P.|last2=Delbem|first2=Alexandre C.B.|title=Pairwise independence and its impact on Estimation of Distribution Algorithms|journal=Swarm and Evolutionary Computation|date=April 2016|volume=27|pages=80–96|doi=10.1016/j.swevo.2015.10.001}}</ref><ref>{{cite journal|last1=Martins|first1=Jean P.|last2=Fonseca|first2=Carlos M.|last3=Delbem|first3=Alexandre C.B.|title=On the performance of linkage-tree genetic algorithms for the multidimensional knapsack problem|journal=Neurocomputing|date=December 2014|volume=146|pages=17–29|doi=10.1016/j.neucom.2014.04.069}}</ref><ref>{{cite journal|last1=Martins|first1=Jean P.|last2=Delbem|first2=Alexandre Claudio Botazzo|title=The Influence of Linkage-learning in the Linkage-tree GA when Solving Multidimensional Knapsack Problems|journal=Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation|date=1 January 2013|pages=821–828|doi=10.1145/2463372.2463476|url=http://dl.acm.org/citation.cfm?id=2463476|publisher=ACM}}</ref><ref>{{cite journal|last1=Martins|first1=Jean P.|last2=Delbem|first2=Alexandre C.B.|title=Multimodality and the Linkage-learning Difficulty of Additively Separable Functions|journal=Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation|date=1 January 2014|pages=365–372|doi=10.1145/2576768.2598281|url=http://dl.acm.org/citation.cfm?id=2598281|publisher=ACM}}</ref><ref>{{cite journal|last1=Martins|first1=J. P.|last2=Neto|first2=C. B.|last3=Crocomo|first3=M. K.|last4=Vittori|first4=K.|last5=Delbem|first5=A. C. B.|title=A comparison of Linkage-learning-based Genetic Algorithms in Multidimensional Knapsack Problems|journal=2013 IEEE Congress on Evolutionary Computation|date=1 June 2013|pages=502–509|doi=10.1109/CEC.2013.6557610}}</ref>
