Localized Iterative Methods for Interpolation in Graph Structured Data

Abstract

In this paper, we present two localized graph filtering based methods for interpolating graph signals defined on the vertices of arbitrary graphs from only a partial set of samples. The first method is an extension of previous work on reconstructing bandlimited graph signals from partially observed samples. The iterative graph filtering approach very closely approximates the solution proposed in the that work, while being computationally more efficient. As an alternative, we propose a regularization based framework in which we define the cost of reconstruction to be a combination of smoothness of the graph signal and the reconstruction error with respect to the known samples, and find solutions that minimize this cost. We provide both a closed form solution and a computationally efficient iterative solution of the optimization problem. The experimental results on the recommendation system datasets demonstrate effectiveness of the proposed methods.

References in corpus (1)

• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains

Cited by in corpus (7)

• Sampling Signals on Graphs: From Theory to Applications
• Observing and Tracking Bandlimited Graph Processes
• Guided Signal Reconstruction Theory
• A Probabilistic Interpretation of Sampling Theory of Graph Signals
• Active Learning On Weighted Graphs Using Adaptive And Non-adaptive Approaches
• Asymptotic Justification of Bandlimited Interpolation of Graph signals for Semi-Supervised Learning
• Robust Semi-Supervised Graph Classifier Learning with Negative Edge Weights