Learning AMP chain graphs and some marginal models thereof under faithfulness
2014 (English)In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 55, no 4, 1011-1021 p.Article in journal (Refereed) Published
This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. Moreover, we show that the extension of Meeks conjecture to AMP chain graphs does not hold, which compromises the development of efficient and correct score + search learning algorithms under assumptions weaker than faithfulness. We also study the problem of how to represent the result of marginalizing out some nodes in an AMP CG. We introduce a new family of graphical models that solves this problem partially. We name this new family maximal covariance-concentration graphs because it includes both covariance and concentration graphs as subfamilies.
Place, publisher, year, edition, pages
Elsevier , 2014. Vol. 55, no 4, 1011-1021 p.
AMP chain graphs; Chain graphs; Graphical models; Learning
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-106668DOI: 10.1016/j.ijar.2014.01.003ISI: 000334087400007OAI: oai:DiVA.org:liu-106668DiVA: diva2:718515