Spatiotemporal Smoothness-based Graph Learning Method for Sensor Networks

Graph learning often boils down to discovering the hidden structure of data that is characterized by a graph. Most of the previous works mainly focus on static data processing. However, the distributed sensor network gives rise to space- time data which exhibits spatiotemporal correlation and evolves smoothly over time. In this paper, we address the problem of learning graphs from space-time sensing data. Based on a dynamic model that takes into account both the spatial and temporal correlated property in temporal evolution, we propose a spatiotemporal smoothness-based graph learning method (GLSS), which novelly introduces the spatiotemporal smoothness to the field of space-time data analysis. By simultaneously recovering data and refining graphs under the spatiotemporal smoothness prior, the graph learning accuracy can be efficiently improved. Experiments on synthetic data and real-world data in weather sensor networks demonstrate that joint space-time analysis in proposed GLSS can bring benefits to graph learning and outperforms current the state-of-the-art methods.

[1]  Hinrich Schütze,et al.  Introduction to information retrieval , 2008 .

[2]  Antonio Ortega,et al.  Graph Learning from Data under Structural and Laplacian Constraints , 2016, ArXiv.

[3]  Alfred O. Hero,et al.  Learning sparse graphs under smoothness prior , 2016, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

[5]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[6]  J. Shewchuk An Introduction to the Conjugate Gradient Method Without the Agonizing Pain , 1994 .

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

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

[9]  José M. F. Moura,et al.  Signal Processing on Graphs: Causal Modeling of Unstructured Data , 2015, IEEE Transactions on Signal Processing.

[10]  Santiago Segarra,et al.  Network topology inference from non-stationary graph signals , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

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

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

[14]  Joshua B. Tenenbaum,et al.  Discovering Structure by Learning Sparse Graphs , 2010 .

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

[16]  A. Davison,et al.  Statistical Modeling of Spatial Extremes , 2012, 1208.3378.

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