Temporal Graph Signal Decomposition
Maxwell McNeil, Lin Zhang, Petko Bogdanov

TL;DR
This paper introduces a scalable dictionary-based framework for decomposing temporal graph signals, effectively capturing structure and improving tasks like imputation, clustering, and period estimation in large-scale data.
Contribution
It presents the first joint graph and temporal dictionary decomposition method for temporal graph signals, enhancing interpretability and scalability.
Findings
Achieves 28% RMSE reduction in temporal interpolation.
Scales to 3.5 million data points in under 20 seconds.
Produces parsimonious models with improved accuracy.
Abstract
Temporal graph signals are multivariate time series with individual components associated with nodes of a fixed graph structure. Data of this kind arises in many domains including activity of social network users, sensor network readings over time, and time course gene expression within the interaction network of a model organism. Traditional matrix decomposition methods applied to such data fall short of exploiting structural regularities encoded in the underlying graph and also in the temporal patterns of the signal. How can we take into account such structure to obtain a succinct and interpretable representation of temporal graph signals? We propose a general, dictionary-based framework for temporal graph signal decomposition (TGSD). The key idea is to learn a low-rank, joint encoding of the data via a combination of graph and time dictionaries. We propose a highly scalable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
