mlsanityData to 7 Oct 2026

Subspace Change-Point Detection via Low-Rank Matrix Factorisation

arXiv 2110.04044 ↗First posted 8 Oct 2021stat.ME cs.LG eess.SPcited by 1

Not on the map. Why?

Abstract (arXiv)

Multivariate time series can often have a large number of dimensions, whether it is due to the vast amount of collected features or due to how the data sources are processed. Frequently, the main structure of the high-dimensional time series can be well represented by a lower dimensional subspace. As vast quantities of data are being collected over long periods of time, it is reasonable to assume that the underlying subspace structure would change over time. In this work, we propose a change-point detection method based on low-rank matrix factorisation that can detect multiple changes in the underlying subspace of a multivariate time series. Experimental results on both synthetic and real data sets demonstrate the effectiveness of our approach and its advantages against various state-of-the-art methods.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 31 references that are in the map. First posted on arXiv 8 Oct 2021.

Builds on

6 of 31 references.

References · 6

  1. 2015Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuitcited by 50
  2. 2013A Nonparametric Approach for Multiple Change Point Analysis of Multivariate Datacited by 28
  3. 2016Multiple-change-point detection for high dimensional time series via sparsified binary segmentationcited by 24
  4. 2016Simultaneous multiple change-point and factor analysis for high-dimensional time seriescited by 5
  5. 2017Provable Dynamic Robust PCA or Robust Subspace Trackingcited by 5
  6. 2018Fast Nonconvex Deconvolution of Calcium Imaging Datacited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.