Learning Laplacian Matrix in Smooth Graph Signal Representations
From MaRDI portal
Abstract: 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.
Cited in
(20)- The dual graph shift operator: identifying the support of the frequency domain
- Fractional spectral graph wavelets and their applications
- Local smoothness of graph signals
- Semisupervised dictionary learning with graph regularized and active points
- Estimate the spectrum of affine dynamical systems from partial observations of a single trajectory data
- scientific article; zbMATH DE number 7626710 (Why is no real title available?)
- Signal Processing on Simplicial Complexes
- Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
- Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures
- Extending compositional data analysis from a graph signal processing perspective
- Fault detection and isolation of multi-variate time series data using spectral weighted graph auto-encoders
- Tighter bound estimation for efficient biquadratic optimization over unit spheres
- Bayesian Nonlinear Tensor Regression with Functional Fused Elastic Net Prior
- Learning graph Laplacian with MCP
- Applications of dual regularized Laplacian matrix for community detection
- Random space-time sampling and reconstruction of sparse bandlimited graph diffusion field
- A graph learning approach for kernel-based system identification with manifold regularization
- Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
- A comparison study of graph Laplacian computation
- Approximation theorems on graphs
This page was built for publication: Learning Laplacian Matrix in Smooth Graph Signal Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621072)
