计算大规模多变量全球不变量:大规模(脑)图的计算
Computing Scalable Multivariate Glocal Invariants of Large (Brain-) Graphs
AI总结:
本文提出一种计算大规模脑图多变量全球不变量的方法,结合稀疏矩阵和高效近似技术,为神经科学提供工具,降低生物学家的使用门槛。
摘要:
图已成为数据表示的重要抽象形式。连接组学研究将大脑视为图,顶点对应神经元,边对应连接。本文定义了多变量全球图不变量,通过链式结合、稀疏矩阵和高效近似计算这些特征。我们开发了开源Python包作为Web服务的后端,支持多核处理,可处理120个脑图,每个约含1600万顶点和9000万边。
英文摘要:
Graphs are quickly emerging as a leading abstraction for the representation of data. One important application domain originates from an emerging discipline called "connectomics". Connectomics studies the brain as a graph; vertices correspond to neurons (or collections thereof) and edges correspond to structural or functional connections between them. To explore the variability of connectomes---to address both basic science questions regarding the structure of the brain, and medical health questions about psychiatry and neurology---one can study the topological properties of these brain-graphs. We define multivariate glocal graph invariants: these are features of the graph that capture various local and global topological properties of the graphs. We show that the collection of features can collectively be computed via a combination of daisy-chaining, sparse matrix representation and computations, and efficient approximations. Our custom open-source Python package serves as a back-end to a Web-service that we have created to enable researchers to upload graphs, and download the corresponding invariants in a number of different formats. Moreover, we built this package to support distributed processing on multicore machines. This is therefore an enabling technology for network science, lowering the barrier of entry by providing tools to biologists and analysts who otherwise lack these capabilities. As a demonstration, we run our code on 120 brain-graphs, each with approximately 16M vertices and up to 90M edges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。