Metraipolis › archive › dc_fd473f0ab286
MINT: Tensor Decomposition on Stacked Recurrence Matrices for Time Series Data Mining — arXiv:2608.04157
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04157
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:34:39.534Z
- SHA-256 of the archived text
a3f4e71cf308b824cbff57e0c765416288c5fa1b457fd3655c6b4a3913e1b59e- Stable URL of this page
https://metraipolis.com/documento/dc_fd473f0ab286
How to cite
MINT: Tensor Decomposition on Stacked Recurrence Matrices for Time Series Data Mining — arXiv:2608.04157 — arXiv (en), https://arxiv.org/abs/2608.04157 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd473f0ab286 (Metraipolis archive dc_fd473f0ab286, sha256 a3f4e71cf308b824cbff57e0c765416288c5fa1b457fd3655c6b4a3913e1b59e)
BibTeX
@misc{dcfd473f0ab286,
title = {MINT: Tensor Decomposition on Stacked Recurrence Matrices for Time Series Data Mining — arXiv:2608.04157},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04157},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd473f0ab286; sha256 a3f4e71cf308b824cbff57e0c765416288c5fa1b457fd3655c6b4a3913e1b59e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04157. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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\times 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 \times (n-m+1) \times (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. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-06 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.04157 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T11:24:48.760Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).