Change search
ReferencesLink to record
Permanent link

Direct link
Learning AMP chain graphs and some marginal models thereof under faithfulness
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
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
Abstract [en]

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.
Keyword [en]
AMP chain graphs; Chain graphs; Graphical models; Learning
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-106668DOI: 10.1016/j.ijar.2014.01.003ISI: 000334087400007OAI: diva2:718515
Available from: 2014-05-21 Created: 2014-05-19 Last updated: 2014-06-03

Open Access in DiVA

fulltext(357 kB)61 downloads
File information
File name FULLTEXT01.pdfFile size 357 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Pena, Jose M
By organisation
Database and information techniquesThe Institute of Technology
In the same journal
International Journal of Approximate Reasoning
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 61 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 66 hits
ReferencesLink to record
Permanent link

Direct link