Online Structural Change-point Detection of High-dimensional Streaming Data via Dynamic Sparse Subspace Learning

Abstract

High-dimensional streaming data are becoming increasingly ubiquitous in many fields. They often lie in multiple low-dimensional subspaces, and the manifold structures may change abruptly on the time scale due to pattern shift or occurrence of anomalies. However, the problem of detecting the structural changes in a real-time manner has not been well studied. To fill this gap, we propose a dynamic sparse subspace learning approach for online structural change-point detection of high-dimensional streaming data. A novel multiple structural change-point model is proposed and the asymptotic properties of the estimators are investigated. A tuning method based on Bayesian information criterion and change-point detection accuracy is proposed for penalty coefficients selection. An efficient Pruned Exact Linear Time based algorithm is proposed for online optimization and change-point detection. The effectiveness of the proposed method is demonstrated through several simulation studies and a real case study on gesture data for motion tracking.

References in corpus (10)

• Optimal detection of changepoints with a linear computational cost
• High-dimensional graphs and variable selection with the Lasso
• Extended Bayesian Information Criteria for Gaussian Graphical Models
• Sparse permutation invariant covariance estimation
• An Algorithm for Optimal Partitioning of Data on an Interval
• Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
• Asymptotic normality and optimalities in estimation of large Gaussian graphical models
• mgm: Estimating Time-Varying Mixed Graphical Models in High-Dimensional Data
• Regularized Estimation of Piecewise Constant Gaussian Graphical Models: The Group-Fused Graphical Lasso
• Asymptotic properties of maximum likelihood estimators in models with multiple change points