arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.7410stat.ML
收藏

ParceLiNGAM:一种对潜在混杂因素鲁棒的因果排序方法

ParceLiNGAM: A causal ordering method robust against latent confounders

Tatsuya Tashiro, Shohei Shimizu, Aapo Hyvarinen, Takashi Washio

摘要:

我们考虑在一个称为LiNGAM的线性非高斯非循环模型中学习变量的因果排序。几种现有的方法已被证明是一致的估计因果排序假设所有的模型假设是正确的。但是,如果实际上违背了某些假设,估计结果可能会失真。在本文中,我们提出了一个新的算法学习因果顺序,是强大的对一个典型的违反模型假设:潜在的混淆。其关键思想是通过测试估计的外部影响之间的独立性来检测潜在混杂因素,并找到包含不受潜在混杂因素影响的变量的子集(包裹)。我们证明了我们的方法使用人工数据和模拟脑成像数据的有效性。

英文摘要:

We consider learning a causal ordering of variables in a linear non-Gaussian acyclic model called LiNGAM. Several existing methods have been shown to consistently estimate a causal ordering assuming that all the model assumptions are correct. But, the estimation results could be distorted if some assumptions actually are violated. In this paper, we propose a new algorithm for learning causal orders that is robust against one typical violation of the model assumptions: latent confounders. The key idea is to detect latent confounders by testing independence between estimated external influences and find subsets (parcels) that include variables that are not affected by latent confounders. We demonstrate the effectiveness of our method using artificial data and simulated brain imaging data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑