Efficient graph signal recovery over big networks

We consider the problem of recovering a smooth graph signal from noisy samples taken at a small number of graph nodes. The recovery problem is formulated as a convex optimization problem which minimizes the total variation (accounting for the smoothness of the graph signal) while controlling the empirical error. We solve this total variation minimization problem efficiently by applying a recent algorithm proposed by Nesterov for non-smooth optimization problems. Furthermore, we develop a distributed implementation of our algorithm and verify the performance of our scheme on a large-scale real-world dataset.

[1]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[2]  Sergio Barbarossa,et al.  Uncertainty principle and sampling of signals defined on graphs , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

[3]  Alexander Jung,et al.  Scalable graph signal recovery for big data over networks , 2016, 2016 IEEE 17th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[4]  José M. F. Moura,et al.  Big Data Analysis with Signal Processing on Graphs: Representation and processing of massive data sets with irregular structure , 2014, IEEE Signal Processing Magazine.

[5]  Mikhail Belkin,et al.  Regularization and Semi-supervised Learning on Large Graphs , 2004, COLT.

[6]  Avita Katal,et al.  Big data: Issues, challenges, tools and Good practices , 2013, 2013 Sixth International Conference on Contemporary Computing (IC3).

[7]  Hsin-Hsi Chen,et al.  Opinion Extraction, Summarization and Tracking in News and Blog Corpora , 2006, AAAI Spring Symposium: Computational Approaches to Analyzing Weblogs.

[8]  Yurii Nesterov,et al.  Smooth minimization of non-smooth functions , 2005, Math. Program..

[9]  Sunil K. Narang,et al.  Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data , 2011, IEEE Transactions on Signal Processing.

[10]  ANTONIN CHAMBOLLE,et al.  An Algorithm for Total Variation Minimization and Applications , 2004, Journal of Mathematical Imaging and Vision.

[11]  Yurii Nesterov,et al.  Lectures on Convex Optimization , 2018 .

[12]  Peter Sheridan Dodds,et al.  Universal behavior in a generalized model of contagion. , 2004, Physical review letters.

[13]  Emmanuel J. Candès,et al.  NESTA: A Fast and Accurate First-Order Method for Sparse Recovery , 2009, SIAM J. Imaging Sci..

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  José M. F. Moura,et al.  Big Data over Networks , 2016 .

[16]  Sinan Aral,et al.  Identifying Influential and Susceptible Members of Social Networks , 2012, Science.

[17]  Gerald Matz,et al.  On the convergence of average consensus with generalized metropolis-hasting weights , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[18]  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.

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

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

[21]  Nan Zheng,et al.  Issue Publics on the Web: Applying Network Theory to the War Blogosphere , 2006, J. Comput. Mediat. Commun..

[22]  Mikhail Belkin,et al.  Tikhonov regularization and semi-supervised learning on large graphs , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.