Semi-parametric graph kernel-based reconstruction

Signal reconstruction over graphs arises naturally in diverse science and engineering applications. Existing methods employ either parametric or nonparametric approaches based on graph kernels. Although the former are adequate when the signals of interest adhere to postulated models, their performance degrades rapidly under model mismatch. Non-parametric alternatives on the other hand are flexible, but not as parsimonious in capturing prior information. Targeting a hybrid “sweet spot,” the present contribution advocates an efficient semi-parametric approach capable of incorporating known signal structure without sacrificing the flexibility of the overall model. Numerical tests on synthetic as well as real data corroborate that the novel method leads to markedly improved signal reconstruction performance.

[1]  José M. F. Moura,et al.  Discrete Signal Processing on Graphs , 2012, IEEE Transactions on Signal Processing.

[2]  Sergio Barbarossa,et al.  Signals on Graphs: Uncertainty Principle and Sampling , 2015, IEEE Transactions on Signal Processing.

[3]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[4]  Alexander J. Smola,et al.  Kernels and Regularization on Graphs , 2003, COLT.

[5]  Georgios B. Giannakis,et al.  Kernel-Based Reconstruction of Graph Signals , 2016, IEEE Transactions on Signal Processing.

[6]  Risi Kondor,et al.  Diffusion kernels on graphs and other discrete structures , 2002, ICML 2002.

[7]  Antonio Ortega,et al.  Submitted to Ieee Transactions on Signal Processing 1 Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies , 2022 .

[8]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.

[9]  Sunil K. Narang,et al.  Localized iterative methods for interpolation in graph structured data , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[10]  Eric D. Kolaczyk,et al.  Statistical Analysis of Network Data: Methods and Models , 2009 .

[11]  Jelena Kovacevic,et al.  Signal Representations on Graphs: Tools and Applications , 2015, ArXiv.

[12]  A. Atiya,et al.  Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond , 2005, IEEE Transactions on Neural Networks.

[13]  Bernhard Schölkopf,et al.  A Generalized Representer Theorem , 2001, COLT/EuroCOLT.

[14]  Vladimir Vapnik,et al.  The Nature of Statistical Learning , 1995 .

[15]  Georgios B. Giannakis,et al.  Kernel-Based Reconstruction of Space-Time Functions on Dynamic Graphs , 2016, IEEE Journal of Selected Topics in Signal Processing.

[16]  John D. Garofalakis,et al.  Hierarchical Itemspace Rank: Exploiting hierarchy to alleviate sparsity in ranking-based recommendation , 2015, Neurocomputing.

[17]  Santiago Segarra,et al.  Reconstruction of Graph Signals Through Percolation from Seeding Nodes , 2015, IEEE Transactions on Signal Processing.

[18]  John D. Garofalakis,et al.  Top-N recommendations in the presence of sparsity: An NCD-based approach , 2015, Web Intell..

[19]  Pascal Frossard,et al.  Learning Parametric Dictionaries for Signals on Graphs , 2014, IEEE Transactions on Signal Processing.