首页> 美国卫生研究院文献>other >A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions
【2h】

A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions

机译:图算法将直接与间接神经相互作用分开

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

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 multiple neural sources. Interactions are often reconstructed using pairwise bivariate analyses, overlooking the multivariate nature of interactions: 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 because of the 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 uses interaction delays reconstructed for directed bivariate interactions to tag potentially spurious edges on the basis of their timing signatures in the context of the surrounding network. Such tagged interactions may then be pruned, which produces a statistically conservative network approximation that is guaranteed to contain non-spurious interactions only. We describe the algorithm and present a reference implementation in MATLAB to test the algorithm’s performance on simulated networks as well as networks derived from magnetoencephalographic data. 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.
机译:网络图已成为一种流行的工具,用来表示由许多相互作用的子单元组成的复杂系统。特别是在神经科学领域,网络图越来越多地用于表示和分析多个神经源之间的功能相互作用。交互作用通常是使用成对的双变量分析重建的,而忽略了交互作用的多变量性质。来源的组合也可以共同作用于给定的目标。双变量分析产生的网络可能包含虚假交互,从而降低了网络及其图形度量的可解释性。但是,由于潜在相互作用的数量呈爆炸性增长,因此真正的多变量重构在计算上难以实现。因此,我们必须求助于近似方法来处理多元交互重建的难点,从而使网络能够在神经科学中使用。在这里,我们以算法的形式建议这样一种近似方法,该方法通过事后识别潜在的虚假交互来扩展快速的双变量交互重建:该算法使用针对定向双变量交互而重建的交互延迟来根据其时序标记潜在的虚假边缘周围网络环境中的签名。然后可以修剪此类标记的交互,这会产生统计上保守的网络近似值,可以保证仅包含非虚假交互。我们描述了该算法,并提供了在MATLAB中的参考实现,以测试该算法在模拟网络以及从脑磁图数据得出的网络上的性能。我们将讨论与其他近似多元方法有关的算法,并重点介绍合适的应用场景。我们的方法是一种重构多元交互的近似网络的易处理且数据高效的方法。如果可用数据有限或在计算上不可行完全多元的方法,则是更可取的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号