@article {211,
	title = {{B}lankets {J}oint {P}osterior score for learning {M}arkov network structures   },
	journal = {International Journal of Approximate Reasoning},
	volume = {https://doi.org/10.1016/j.ijar.2017.10.018},
	year = {2017},
	month = {10/2017},
	type = {Regular Issu},
	abstract = {<p>Markov networks are extensively used to model\&nbsp;complex sequential, spatial, and relational interactions\&nbsp;in a wide range of fields.\&nbsp;By learning the Markov network independence structure of a domain, more accurate joint probability distributions can be obtained for inference tasks or, more directly, for interpreting the most significant relations among the variables. Recently, several researchers have investigated techniques for automatically learning the structure from data by obtaining the probabilistic maximum-a-posteriori structure given the available data. However, all the approximations proposed decompose the posterior of the whole structure into local sub-problems, by assuming that the posteriors of\&nbsp;the Markov blankets of all the variables are mutually independent.\&nbsp;In this work, we propose a scoring function for relaxing such assumption.\&nbsp;The Blankets Joint Posterior\&nbsp;score computes the\&nbsp;joint posterior of structures as a joint distribution of the collection of its Markov blankets. Essentially, the whole posterior is obtained by computing the posterior of the blanket of each variable as a conditional distribution that takes into account information from other blankets in the network.\&nbsp;We show in our experimental results that the proposed approximation\&nbsp;can improve the sample complexity of state-of-the-art competitors\&nbsp;when learning complex networks, where the independence assumption between blanket variables is clearly incorrect.\&nbsp;</p>
},
	keywords = {blankets posterior, irregular structures, Markov network, scoring function, Structure learning},
	author = {Schl{\"u}ter, Federico and Strappa, Yanela and Bromberg, Facundo and Milone, Diego H.}
}
