Factorized binary search: Change point detection in the network structure of multivariate high-dimensional time series

因子化二分查找:多元高维时间序列网络结构中的变化点检测

阅读:2

Abstract

Functional magnetic resonance imaging (fMRI) time series data present a unique opportunity to understand the behavior of temporal brain connectivity, and models that uncover the complex dynamic workings of this organ are of keen interest in neuroscience. We are motivated to develop accurate change point detection and network estimation techniques for high-dimensional whole-brain fMRI data. To this end, we introducefactorized binary search(FaBiSearch), a novel change point detection method in the network structure of multivariate high-dimensional time series in order to understand the large-scale characterizations and dynamics of the brain. FaBiSearch employs non-negative matrix factorization, an unsupervised dimension reduction technique, and a new binary search algorithm to identify multiple change points. In addition, we propose a new method for network estimation for data between change points. We seek to understand the dynamic mechanism of the brain, particularly for two fMRI data sets. The first is a resting-state fMRI experiment, where subjects are scanned over three visits. The second is a task-based fMRI experiment, where subjects read Chapter 9 ofHarry Potter and the Sorcerer's Stone. For the resting-state data set, we examine the test-retest behavior of dynamic functional connectivity, while for the task-based data set, we explore network dynamics during the reading and whether change points across subjects coincide with key plot twists in the story. Further, we identify hub nodes in the brain network and examine their dynamic behavior. Finally, we make all the methods discussed available in the R package fabisearch onCRAN, as well as all experiments onGitHub.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。