Structured Graph Learning Via Laplacian Spectral Constraints

09/24/2019
by   Sandeep Kumar, et al.
0

Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In this paper, we first show that for a set of important graph families it is possible to convert the structural constraints of structure into eigenvalue constraints of the graph Laplacian matrix. Then we introduce a unified graph learning framework, lying at the integration of the spectral properties of the Laplacian matrix with Gaussian graphical modeling that is capable of learning structures of a large class of graph families. The proposed algorithms are provably convergent and practically amenable for large-scale semi-supervised and unsupervised graph-based learning tasks. Extensive numerical experiments with both synthetic and real data sets demonstrate the effectiveness of the proposed methods. An R package containing code for all the experimental results is available at https://cran.r-project.org/package=spectralGraphTopology.

READ FULL TEXT
research
04/22/2019

A Unified Framework for Structured Graph Learning via Spectral Constraints

Graph learning from data represents a canonical problem that has receive...
research
06/26/2020

Does the ℓ_1-norm Learn a Sparse Graph under Laplacian Constrained Graphical Models?

We consider the problem of learning a sparse graph under Laplacian const...
research
04/07/2022

The seriation problem in the presence of a double Fiedler value

Seriation is a problem consisting of seeking the best enumeration order ...
research
11/16/2016

Graph Learning from Data under Structural and Laplacian Constraints

Graphs are fundamental mathematical structures used in various fields to...
research
11/15/2017

PQSER: A Matlab package for spectral seriation

The seriation problem is an important ordering issue which consists of f...
research
12/11/2011

Graph Construction for Learning with Unbalanced Data

Unbalanced data arises in many learning tasks such as clustering of mult...
research
05/07/2012

Graph-based Learning with Unbalanced Clusters

Graph construction is a crucial step in spectral clustering (SC) and gra...

Please sign up or login with your details

Forgot password? Click here to reset