mlsanityData to 7 Oct 2026

tPARAFAC2: Tracking evolving patterns in (incomplete) temporal data

arXiv 2407.01356 ↗First posted 1 Jul 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Tensor factorizations have been widely used for the task of uncovering patterns in various domains. Often, the input is time-evolving, shifting the goal to tracking the evolution of the underlying patterns instead. To adapt to this more complex setting, existing methods incorporate temporal regularization but they either have overly constrained structural requirements or lack uniqueness which is crucial for interpretation. In this paper, in order to capture the underlying evolving patterns, we introduce t(emporal)PARAFAC2, which utilizes temporal smoothness regularization on the evolving factors. Previously, Alternating Optimization (AO) and Alternating Direction Method of Multipliers (ADMM)-based algorithmic approach has been introduced to fit the PARAFAC2 model to fully observed data. In this paper, we extend this algorithmic framework to the case of partially observed data and use it to fit the tPARAFAC2 model to complete and incomplete datasets with the goal of revealing evolving patterns. Our numerical experiments on simulated datasets demonstrate that tPARAFAC2 can extract the underlying evolving patterns more accurately compared to the state-of-the-art in the presence of high amounts of noise and missing data. Using two real datasets, we also demonstrate the effectiveness of the algorithmic approach in terms of handling missing data and tPARAFAC2 model in terms of revealing evolving patterns. The paper provides an extensive comparison of different approaches for handling missing data within the proposed framework, and discusses both the advantages and limitations of tPARAFAC2 model.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 44 references that are in the map. First posted on arXiv 1 Jul 2024.

Builds on

13 of 44 references.

References · 13

  1. 2016TensorLy: Tensor Learning in Pythoncited by 104
  2. 2019The Dynamic Embedded Topic Modelcited by 41
  3. 2015A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorizationcited by 30
  4. 2018COPA: Constrained PARAFAC2 for Sparse & Large Datasetscited by 18
  5. 2021An AO-ADMM approach to constraining PARAFAC2 on all modescited by 12
  6. 2018Nonnegative PARAFAC2: a flexible coupling approachcited by 11
  7. 2021SSMF: Shifting Seasonal Matrix Factorizationcited by 11
  8. 2019Tracing Network Evolution Using the PARAFAC2 Modelcited by 10
  9. 2020A Flexible Optimization Framework for Regularized Matrix-Tensor Factorizations with Linear Couplingscited by 10
  10. 2018Identifying and Alleviating Concept Drift in Streaming Tensor Decompositioncited by 7
  11. 2018Using link and content over time for embedding generation in Dynamic Attributed Networkscited by 4
  12. 2023A Time-aware tensor decomposition for tracking evolving patternscited by 2
1 more
  1. 2020On Large-Scale Dynamic Topic Modeling with Nonnegative CP Tensor Decompositioncited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.