Learning marginal AMP chain graphs under faithfulness revisited
详细信息 查看全文
- 作者：Jose M. Peñ ; aa ; jose.m.pena@liu.se" class="auth_mail" title="E-mail the corresponding author ; Manuel Gó ; mez-Olmedob ; mgomez@decsai.ugr.es" class="auth_mail" title="E-mail the corresponding author
- 关键词：Chain graphs ; AMP chain graphs ; MVR chain graphs ; Structure learning
- 刊名：International Journal of Approximate Reasoning
- 出版年：2016
- 出版时间：January 2016
- 年：2016
- 卷：68
- 期：Complete
- 页码：108-126
- 全文大小：539 K
文摘
- •
We present a constraint based algorithm for learning MAMP chain graphs.
- •
The algorithm assumes faithfulness.
- •
The MAMP chain graph learned is a distinguished member of its equivalence class.
- •
We show that the extension of Meek's conjecture to MAMP chain graphs does not hold.