MINT: Tensor Decomposition on Stacked Recurrence Matrices for Time Series Data Mining
Not on the map. Why?
Abstract (arXiv)
Recurrence plots are a time series data mining primitive applied to a variety of domains (e.g. star light curves, sound waveforms, CCT telemetry). This work proposes tensorized self-similarity matrices as a primitive for univariate time series datasets (N× n) of N time series of length n with a subsequence window of length m, and whose tensor-based nature is naturally extensible to multivariate datasets. The proposed method to compute this primitive computes dot plots of size N × (n-m+1) × (n-m+ 1) from these datasets, where the subsequent tensor is mined using tensor decomposition methods to mine for co-clustered patterns. We demonstrate our results in mass rapid transit, electricity demand, wind turbine, and car traffic data, finding the MINT pipeline effectively co-clusters cross-sensor patterns in highly regular datasets containing motifs at regular intervals.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 31 references that are in the map. First posted on arXiv 4 Aug 2026.
Builds on
5 of 31 references.
References · 5
- 2016Tensor Decomposition for Signal Processing and Machine Learningcited by 223
- 2023LargeST: A Benchmark Dataset for Large-Scale Traffic Forecastingcited by 116
- 2016TensorLy: Tensor Learning in Pythoncited by 104
- 2021Modelling matrix time series via a tensor CP-decompositioncited by 5
- 2024Joint Background-Anomaly-Noise Decomposition for Robust Hyperspectral Anomaly Detection via Constrained Convex Optimizationcited by 2
Built on by
Not cited yet.