arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.7566q-bio.QMcs.LGstat.ML
收藏

从基因表达数据中发现局部因果关系的依赖性与条件依赖性

Dependence versus Conditional Dependence in Local Causal Discovery from Gene Expression Data

University of Pittsburgh(匹兹堡大学)

Eric V. Strobl, Shyam Visweswaran

摘要:

动机:发现与目标有因果关系的变量的算法可以为实验设计提供信息。利用观测的基因表达数据,许多方法通过使用依赖性度量(DM)测量每个变量与目标的统计依赖程度来发现因果变量。然而,其他方法测量每个变量的能力,以解释目标和数据中的剩余变量之间的统计依赖性使用条件依赖性测量(CDM),因为这种策略是保证找到目标的直接原因,直接影响,直接原因的直接影响在无限的样本限制。在本文中,我们设计了一个新的算法,以系统地比较DM和CDM在发现因果变量从基因表达数据的相对能力。结果如下:所提出的算法使用CDM是样本效率,因为它始终优于其他国家的最先进的局部因果发现算法时,样本大小很小。然而,所提出的算法使用CDM优于所提出的算法使用DM只有当样本量是几百以上。这些结果表明,使用当前基于CDM的算法从基因表达数据中准确地发现因果关系需要具有至少几百个样本的数据集。可用性:所提出的算法可以在https://github.com/ericstrobl/DvCD上免费获得。

英文摘要:

Motivation: Algorithms that discover variables which are causally related to a target may inform the design of experiments. With observational gene expression data, many methods discover causal variables by measuring each variable's degree of statistical dependence with the target using dependence measures (DMs). However, other methods measure each variable's ability to explain the statistical dependence between the target and the remaining variables in the data using conditional dependence measures (CDMs), since this strategy is guaranteed to find the target's direct causes, direct effects, and direct causes of the direct effects in the infinite sample limit. In this paper, we design a new algorithm in order to systematically compare the relative abilities of DMs and CDMs in discovering causal variables from gene expression data. Results: The proposed algorithm using a CDM is sample efficient, since it consistently outperforms other state-of-the-art local causal discovery algorithms when samples sizes are small. However, the proposed algorithm using a CDM outperforms the proposed algorithm using a DM only when sample sizes are above several hundred. These results suggest that accurate causal discovery from gene expression data using current CDM-based algorithms requires datasets with at least several hundred samples. Availability: The proposed algorithm is freely available at https://github.com/ericstrobl/DvCD.

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

↑