arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2010.02332stat.MEstat.AP
收藏

连通组学的多尺度图主成分分析

Multi-scale graph principal component analysis for connectomics

Steven Winter, Zhengwu Zhang, David Dunson

摘要:

在脑连接组学中,皮质表面在统计分析之前被包裹成不同的感兴趣区域(ROI)。每个个体的脑连接体然后可以被表示为图,其中节点对应于ROI,边对应于ROI之间的连接。这样的图可以被概括为邻接矩阵,其中每个单元包含一对ROI之间的连接强度。这些矩阵是对称的,对应于通常排除的自连接的对角元素。连接体的这种表示的主要缺点是它们对所选择的ROI的敏感性,包括关键的ROI的数量以及因此的图的规模。随着比例变得更细,使用更多的ROI,图形变得越来越稀疏。显然,下游统计分析的结果可能高度依赖于所选择的分装。为了解决这个问题,我们提出了一个多尺度图分解,它通过一组共同的个人特定的分数链接在一起的规模特定的分解。这些分数总结了一个人的大脑结构,结合了各个测量尺度的信息。我们获得了一个简单而有效的算法实现,并说明了在模拟和分析人类连接组计划数据集的单尺度方法的实质性优势。

英文摘要:

In brain connectomics, the cortical surface is parcellated into different regions of interest (ROIs) prior to statistical analysis. The brain connectome for each individual can then be represented as a graph, with the nodes corresponding to ROIs and edges to connections between ROIs. Such a graph can be summarized as an adjacency matrix, with each cell containing the strength of connection between a pair of ROIs. These matrices are symmetric with the diagonal elements corresponding to self-connections typically excluded. A major disadvantage of such representations of the connectome is their sensitivity to the chosen ROIs, including critically the number of ROIs and hence the scale of the graph. As the scale becomes finer and more ROIs are used, graphs become increasingly sparse. Clearly, the results of downstream statistical analyses can be highly dependent on the chosen parcellation. To solve this problem, we propose a multi-scale graph factorization, which links together scale-specific factorizations through a common set of individual-specific scores. These scores summarize an individual's brain structure combining information across measurement scales. We obtain a simple and efficient algorithm for implementation, and illustrate substantial advantages over single scale approaches in simulations and analyses of the Human Connectome Project dataset.

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

↑