Cross-covariance isolate detect: A new change-point method for estimating dynamic functional connectivity.

Evidence of the non stationary behavior of functional connectivity (FC) networks has been observed in task based functional magnetic resonance imaging (fMRI) experiments and even prominently in resting state fMRI data. This has led to the development of several new statistical methods for estimating this time-varying connectivity, with the majority of the methods utilizing a sliding window approach. While computationally feasible, the sliding window approach has several limitations. In this paper, we circumvent the sliding window, by introducing a statistical method that finds change-points in FC networks where the number and location of change-points are unknown a priori. The new method, called cross-covariance isolate detect (CCID), detects multiple change-points in the second-order (cross-covariance or network) structure of multivariate, possibly high-dimensional time series. CCID allows for change-point detection in the presence of frequent changes of possibly small magnitudes, can assign change-points to one or multiple brain regions, and is computationally fast. In addition, CCID is particularly suited to task based data, where the subject alternates between task and rest, as it firstly attempts isolation of each of the change-points within subintervals, and secondly their detection therein. Furthermore, we also propose a new information criterion for CCID to identify the change-points. We apply CCID to several simulated data sets and to task based and resting state fMRI data and compare it to recent change-point methods. CCID may also be applicable to electroencephalography (EEG), magentoencephalography (MEG) and electrocorticography (ECoG) data. Similar to other biological networks, understanding the complex network organization and functional dynamics of the brain can lead to profound clinical implications. Finally, the R package ccid implementing the method from the paper is available from CRAN.

Detecting multiple generalized change-points by isolating single ones.

We introduce a new approach, called Isolate-Detect (ID), for the consistent estimation of the number and location of multiple generalized change-points in noisy data sequences. Examples of signal changes that ID can deal with are changes in the mean of a piecewise-constant signal and changes, continuous or not, in the linear trend. The number of change-points can increase with the sample size. Our method is based on an isolation technique, which prevents the consideration of intervals that contain more than one change-point. This isolation enhances ID's accuracy as it allows for detection in the presence of frequent changes of possibly small magnitudes. In ID, model selection is carried out via thresholding, or an information criterion, or SDLL, or a hybrid involving the former two. The hybrid model selection leads to a general method with very good practical performance and minimal parameter choice. In the scenarios tested, ID is at least as accurate as the state-of-the-art methods; most of the times it outperforms them. ID is implemented in the R packages IDetect and breakfast, available from CRAN. SUPPLEMENTARY INFORMATION: The online version supplementary material available at 10.1007/s00184-021-00821-6.

Detecting possibly frequent change-points: Wild Binary Segmentation 2 and steepest-drop model selection-rejoinder.

Many existing procedures for detecting multiple change-points in data sequences fail in frequent-change-point scenarios. This article proposes a new change-point detection methodology designed to work well in both infrequent and frequent change-point settings. It is made up of two ingredients: one is "Wild Binary Segmentation 2" (WBS2), a recursive algorithm for producing what we call a 'complete' solution path to the change-point detection problem, i.e. a sequence of estimated nested models containing 0 , … , T - 1 change-points, where T is the data length. The other ingredient is a new model selection procedure, referred to as "Steepest Drop to Low Levels" (SDLL). The SDLL criterion acts on the WBS2 solution path, and, unlike many existing model selection procedures for change-point problems, it is not penalty-based, and only uses thresholding as a certain discrete secondary check. The resulting WBS2.SDLL procedure, combining both ingredients, is shown to be consistent, and to significantly outperform the competition in the frequent change-point scenarios tested. WBS2.SDLL is fast, easy to code and does not require the choice of a window or span parameter.