Enabling Prediction via Multi-Layer Graph Inference and Sampling

In this work we propose a novel method to efficiently predict dynamic signals over both space and time, exploiting the theory of sampling and recovery of band-limited graph signals. The approach hinges on a multi-layer graph topology, where each layer refers to a spatial map of points where the signal is observed at a given time, whereas different layers pertain to different time instants. Then, a dynamic learning method is employed to infer space-time relationships among data in order to find a band-limited representation of the observed signal over the multi-layer graph. Such a parsimonious representation is then instrumental to use sampling theory over graphs to predict the value of the signal on a future layer, based on the observations over the past graphs. The method is then tested on a real data-set, which contains the outgoing cellular data traffic over the city of Milan. Numerical simulations illustrate how the proposed approach is very efficient in predicting the calls activity over a grid of nodes at a given daily hour, based on the observations of previous traffic activity over both space and time.

[1]  Vassilis Kalofolias,et al.  How to Learn a Graph from Smooth Signals , 2016, AISTATS.

[2]  Pascal Frossard,et al.  Learning Laplacian Matrix in Smooth Graph Signal Representations , 2014, IEEE Transactions on Signal Processing.

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

[4]  Sergio Barbarossa,et al.  Graph Topology Inference Based on Sparsifying Transform Learning , 2018, IEEE Transactions on Signal Processing.

[5]  Georgios B. Giannakis,et al.  Topology Identification and Learning over Graphs: Accounting for Nonlinearities and Dynamics , 2018, Proceedings of the IEEE.

[6]  Santiago Segarra,et al.  Inference of Graph Topology , 2018 .

[7]  Michael G. Rabbat,et al.  Characterization and Inference of Graph Diffusion Processes From Observations of Stationary Signals , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[8]  Georgios B. Giannakis,et al.  Semi-Blind Inference of Topologies and Dynamical Processes Over Dynamic Graphs , 2018, IEEE Transactions on Signal Processing.

[9]  José M. F. Moura,et al.  Discrete Signal Processing on Graphs: Frequency Analysis , 2013, IEEE Transactions on Signal Processing.

[10]  R. Tibshirani,et al.  Sparse inverse covariance estimation with the graphical lasso. , 2008, Biostatistics.

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

[12]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[13]  I. Pesenson Sampling in paley-wiener spaces on combinatorial graphs , 2008, 1111.5896.

[14]  Santiago Segarra,et al.  Network Topology Inference from Spectral Templates , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[15]  Pascal Frossard,et al.  Learning Heat Diffusion Graphs , 2016, IEEE Transactions on Signal and Information Processing over Networks.

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

[17]  Sergio Barbarossa,et al.  Sampling and Recovery of Graph Signals , 2017, 1712.09310.