• Corpus ID: 238744416

Online network change point detection with missing values

  title={Online network change point detection with missing values},
  author={Paromita Dubey and Haotian Xu and Yi Yu},
In this paper we study online change point detection in dynamic networks with heterogeneous missing pattern across the networks and the time course. The missingness probabilities, the networks’ entrywise sparsity, the rank of the networks and the jump size in terms of the Frobenius norm, are all allowed to vary as functions of the pre-change sample size. To the best of our knowledge, such general framework has not been rigorously studied before in the literature. We propose a polynomial-time… 

Tables from this paper

Graph similarity learning for change-point detection in dynamic networks
This work designs a method to perform online network change-point detection that can adapt to the network domain and localise changes with no delay and requires a shorter data history to detect changes than most existing state-of-the-art baselines.


Change-Point Detection in Dynamic Networks with Missing Links
The proposed test for change-point detection at a temporal sequence of partially observed networks is based on the Matrix CUSUM test statistic and allows growing size of networks and is minimax optimal and robust to missing links.
Sequential change-point detection in high-dimensional Gaussian graphical models
This work introduces a novel scalable online algorithm for detecting an unknown number of abrupt changes in the inverse covariance matrix of sparse Gaussian graphical models with small delay and can be extended to a large class of continuous and discrete graphical models.
Sequential change-point detection based on nearest neighbors
  • Hao Chen
  • Computer Science
    The Annals of Statistics
  • 2019
We propose a new framework for the detection of change-points in online, sequential data analysis. The approach utilizes nearest neighbor information and can be applied to sequences of multivariate
Global spectral clustering in dynamic networks
Applying PisCES to medial prefrontal cortex in monkey rhesus brains from near conception to adulthood reveals dense communities that persist, merge, and diverge over time and others that are loosely organized and short lived, illustrating how dynamic community detection can yield interesting insights into processes such as brain development.
High-dimensional changepoint estimation with heterogeneous missingness
We propose a new method for changepoint estimation in partially-observed, highdimensional time series that undergo a simultaneous change in mean in a sparse subset of coordinates. Our first
Sequential Change-point Detection for High-dimensional and non-Euclidean Data
New test statistics under this nonparametric framework are considered that can make more positive detections and can detect anomaly events sooner than the existing test under many common scenarios with the false discovery rate controlled at the same level.
Change-Point Detection for Graphical Models in the Presence of Missing Values
This work proposes three imputation like methods for change points in high-dimensional covariance structures with an emphasis on challenging scenarios with missing values and investigates their implications on common losses used for change point detection.
A survey of methods for time series change point detection
This survey article enumerates, categorizes, and compares many of the methods that have been proposed to detect change points in time series, and presents some grand challenges for the community to consider.
On evolutionary spectral clustering
This article proposes two frameworks that incorporate temporal smoothness in evolutionary spectral clustering and demonstrates that their methods provide the optimal solutions to the relaxed versions of the corresponding evolutionary k-means clustering problems.
Information Bounds and Quick Detection of Parameter Changes in Stochastic Systems
  • T. Lai
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1998
By using information-theoretic bounds and sequential hypothesis testing theory, this paper provides a new approach to optimal detection of abrupt changes in stochastic systems which leads to detection rules which have manageable computational complexity for on-line implementation and yet are nearly optimal under the different performance criteria considered.