首页> 美国卫生研究院文献>other >Inferring functional connectivity in MRI using Bayesian network structure learning with a modified PC algorithm
【2h】

Inferring functional connectivity in MRI using Bayesian network structure learning with a modified PC algorithm

机译:使用修改的PC算法使用贝叶斯网络结构学习推断MRI中的功能连通性

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

摘要

Resting state functional connectivity MRI (rs-fcMRI) is a popular technique used to gauge the functional relatedness between regions in the brain for typical and special populations. Most of the work to date determines this relationship by using Pearson's correlation on BOLD fMRI timeseries. However, it has been recognized that there are at least two key limitations to this method. First, it is not possible to resolve the direct and indirect connections/influences. Second, the direction of information flow between the regions cannot be differentiated. In the current paper, we follow-up on recent work by , and apply a Bayesian approach called the PC algorithm to both simulated data and empirical data to determine whether these two factors can be discerned with group average, as opposed to single subject, functional connectivity data. When applied on simulated individual subjects, the algorithm performs well determining indirect and direct connection but fails in determining directionality. However, when applied at group level, PC algorithm gives strong results for both indirect and direct connections and the direction of information flow. Applying the algorithm on empirical data, using a diffusion-weighted imaging (DWI) structural connectivity matrix as the baseline, the PC algorithm outperformed the direct correlations. We conclude that, under certain conditions, the PC algorithm leads to an improved estimate of brain network structure compared to the traditional connectivity analysis based on correlations.
机译:静止状态功能连接MRI(rs-fcMRI)是一种流行的技术,用于评估典型人群和特殊人群大脑区域之间的功能相关性。迄今为止,大多数工作都是通过在BOLD fMRI时间序列上使用Pearson相关性来确定这种关系。但是,已经认识到该方法至少有两个关键限制。首先,不可能解决直接和间接的联系/影响。其次,区域之间的信息流动方向无法区分。在当前论文中,我们对的最新工作进行了跟踪,并对模拟数据和经验数据应用了一种称为PC算法的贝叶斯方法,以确定这两个因素是否可以通过群体平均来区分,而不是与单个主题相对。连接数据。当应用于模拟的个体对象时,该算法可以很好地确定间接和直接连接,但是无法确定方向性。但是,当在组级别应用时,PC算法对于间接和直接连接以及信息流的方向都给出了很强的结果。将算法应用于经验数据,以扩散加权成像(DWI)结构连通性矩阵为基准,PC算法优于直接相关性。我们得出的结论是,与传统的基于相关性的连接分析相比,在某些条件下,PC算法可改善对大脑网络结构的估计。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号