Recursive Prediction of Graph Signals with Incoming Nodes
arXiv:1911.11542
Abstract
Kernel and linear regression have been recently explored in the prediction of graph signals as the output, given arbitrary input signals that are agnostic to the graph. In many real-world problems, the graph expands over time as new nodes get introduced. Keeping this premise in mind, we propose a method to recursively obtain the optimal prediction or regression coefficients for the recently propose Linear Regression over Graphs (LRG), as the graph expands with incoming nodes. This comes as a natural consequence of the structure C(W)= of the regression problem, and obviates the need to solve a new regression problem each time a new node is added. Experiments with real-world graph signals show that our approach results in good prediction performance which tends to be close to that obtained from knowing the entire graph apriori.
References in corpus (11)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Learning graphs from data: A signal representation perspective
- Signals on Graphs: Uncertainty Principle and Sampling
- Signal Recovery on Graphs: Variation Minimization
- Stationary Graph Processes and Spectral Estimation
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- Kernel-based Reconstruction of Graph Signals
- Greedy Sampling of Graph Signals
- Distributed Recursive Least-Squares: Stability and Performance Analysis
- Supervised Linear Regression for Graph Learning from Graph Signals
- Extreme Learning Machine for Graph Signal Processing