Learning Laplacian Matrix in Smooth Graph Signal Representations

by   Xiaowen Dong, et al.

The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful graph is not always readily available from the data, nor easy to define depending on the application domain. In particular, it is often desirable in graph signal processing applications that a graph is chosen such that the data admit certain regularity or smoothness on the graph. In this paper, we address the problem of learning graph Laplacians, which is equivalent to learning graph topologies, such that the input data form graph signals with smooth variations on the resulting topology. To this end, we adopt a factor analysis model for the graph signals and impose a Gaussian probabilistic prior on the latent variables that control these signals. We show that the Gaussian prior leads to an efficient representation that favors the smoothness property of the graph signals. We then propose an algorithm for learning graphs that enforces such property and is based on minimizing the variations of the signals on the learned graph. Experiments on both synthetic and real world data demonstrate that the proposed graph learning framework can efficiently infer meaningful graph topologies from signal observations under the smoothness prior.


page 8

page 9

page 12


Kernel-based Graph Learning from Smooth Signals: A Functional Viewpoint

The problem of graph learning concerns the construction of an explicit t...

Learning Graphs from Data: A Signal Representation Perspective

The construction of a meaningful graph topology plays a crucial role in ...

Graph Laplacian Learning with Exponential Family Noise

A common challenge in applying graph machine learning methods is that th...

Inferring Graph Signal Translations as Invariant Transformations for Classification Tasks

The field of Graph Signal Processing (GSP) has proposed tools to general...

Learning heat diffusion graphs

Effective information analysis generally boils down to properly identify...

How to learn a graph from smooth signals

We propose a framework that learns the graph structure underlying a set ...

Optimal Bayesian Smoothing of Functional Observations over a Large Graph

In modern contexts, some types of data are observed in high-resolution, ...

Please sign up or login with your details

Forgot password? Click here to reset