.png){kind=icon}
返回
Mining Markov Blankets Without Causal Sufficiency
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2018.2828982.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Markov blankets (MBs) in Bayesian networks (BNs) play an important role in both local causal discovery and largescale BN structure learning. Almost all existing MB discovery algorithms are designed under the assumption of causal sufficiency, which states that there are no latent common causes for two or more of the observed variables in data. However, latent common causes are ubiquitous in many applications, and hence, this assumption is often violated in practice. Thus, developing algorithms for discovering MBs without assuming causal sufficiency is of practical significance, and it is crucial for causal structure learning in real-world data. In this paper, we focus on addressing this problem. Specifically, we adopt a maximal ancestral graph (MAG) model to represent latent common causes and the concept of MBs without assuming causal sufficiency. Then, we propose an effective and efficient algorithm to discover the MB of a target variable in an MAG. Using benchmark and real-world data sets, the experiments validate the algorithm proposed in this paper.
Keyword:
Directed acyclic graph (DAG)
latent common cause
Markov blanket (MB)
maximal ancestral graph (MAG)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
分享收藏LEARNING HIGH-DIMENSIONAL DIRECTED ACYCLIC GRAPHS WITH LATENT AND SELECTION VARIABLES学习具有潜在变量和选择变量的高维有向无环图.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏
Chlorinated hydrocarbons and total mercury in the prey of the white-tailed eagle (Haliaeetus albicilla L.) in the quarken straits of the gulf of bothnia, Finland芬兰博特尼亚湾夸肯海峡的白尾鹰 (Haliaeetus albicilla L.) 猎物中的氯代烃和总汞
PREAI
分享收藏
查看更多内容