arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.00156cs.ITmath.ITq-bio.NC
收藏

一种区分直接和间接神经交互的图论方法

A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions

Patricia Wollstadt, Ulrich Meyer, Michael Wibral

摘要:

网络图已经成为一种流行的工具来表示由许多相互作用的子单元组成的复杂系统;特别是在神经科学中,网络图越来越多地用于表示和分析神经源之间的功能相互作用。相互作用经常使用成对双变量分析来重建,忽略了它们的多变量性质:它被忽略了,调查一个源对目标的影响需要考虑所有其他源作为潜在的滋扰变量;源的组合也可能共同作用于给定的目标。双变量分析产生的网络可能包含虚假的相互作用,这降低了网络及其图形度量的可解释性。然而,一个真正的多元重建,是计算上棘手的,由于潜在的相互作用的数量组合爆炸。因此,我们必须采取近似的方法来处理多变量相互作用重建的棘手性,从而使网络在神经科学中的使用。在这里,我们建议这样一个近似的方法,在一个算法的形式,通过识别潜在的虚假的相互作用事后扩展快速双变量相互作用重建:该算法标志潜在的虚假的边缘,然后可以从网络中修剪。这产生了一个统计上保守的网络近似,保证只包含非虚假的相互作用。我们描述了该算法,并提出了一个参考实现来测试其性能。我们讨论的算法与其他近似的多元方法,并突出合适的应用场景。我们的方法是一种易于处理和数据有效的方式重建近似网络的多元相互作用。如果可用数据有限或完全多变量方法在计算上不可行,则最好采用这种方法。

英文摘要:

Network graphs have become a popular tool to represent complex systems composed of many interacting subunits; especially in neuroscience, network graphs are increasingly used to represent and analyze functional interactions between neural sources. Interactions are often reconstructed using pairwise bivariate analyses, overlooking their multivariate nature: it is neglected that investigating the effect of one source on a target necessitates to take all other sources as potential nuisance variables into account; also combinations of sources may act jointly on a given target. Bivariate analyses produce networks that may contain spurious interactions, which reduce the interpretability of the network and its graph metrics. A truly multivariate reconstruction, however, is computationally intractable due to combinatorial explosion in the number of potential interactions. Thus, we have to resort to approximative methods to handle the intractability of multivariate interaction reconstruction, and thereby enable the use of networks in neuroscience. Here, we suggest such an approximative approach in the form of an algorithm that extends fast bivariate interaction reconstruction by identifying potentially spurious interactions post-hoc: the algorithm flags potentially spurious edges, which may then be pruned from the network. This produces a statistically conservative network approximation that is guaranteed to contain non-spurious interactions only. We describe the algorithm and present a reference implementation to test its performance. We discuss the algorithm in relation to other approximative multivariate methods and highlight suitable application scenarios. Our approach is a tractable and data-efficient way of reconstructing approximative networks of multivariate interactions. It is preferable if available data are limited or if fully multivariate approaches are computationally infeasible.

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

↑