Joint Signal Recovery and Graph Learning from Incomplete Time-Series
Not on the map. Why?
Abstract (arXiv)
Learning a graph from data is the key to taking advantage of graph signal processing tools. Most of the conventional algorithms for graph learning require complete data statistics, which might not be available in some scenarios. In this work, we aim to learn a graph from incomplete time-series observations. From another viewpoint, we consider the problem of semi-blind recovery of time-varying graph signals where the underlying graph model is unknown. We propose an algorithm based on the method of block successive upperbound minimization (BSUM), for simultaneous inference of the signal and the graph from incomplete data. Simulation results on synthetic and real time-series demonstrate the performance of the proposed method for graph learning and signal recovery.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 9 of its 22 references that are in the map. First posted on arXiv 28 Dec 2023.
Builds on
9 of 22 references.
References · 9
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2016How to learn a graph from smooth signalscited by 146
- 2019A Unified Framework for Structured Graph Learning via Spectral Constraintscited by 53
- 2014Signal Recovery on Graphs: Variation Minimizationcited by 26
- 2020Learning Undirected Graphs in Financial Marketscited by 13
- 2019Decentralized Bayesian Learning over Graphscited by 9
- 2016Graph Learning from Data under Structural and Laplacian Constraintscited by 8
- 2018Semi-Blind Inference of Topologies and Dynamical Processes over Graphscited by 7
- 2016Towards stationary time-vertex signal processingcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.