Sparse Graph Learning Under Laplacian-Related Constraints

Sparse Graph Learning Under Laplacian-Related Constraints

We consider the problem of learning a sparse undirected graph underlying a given set of multivariate data. We focus on graph Laplacian-related constraints on the sparse precision matrix that encodes conditional dependence between the random variables associated with the graph nodes. Under these cons...

Full description

Bibliographic Details
Main Author: Jitendra K. Tugnait
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Sparse graph learning
graph estimation
graph Laplacian
undirected graph
inverse covariance estimation
Online Access:https://ieeexplore.ieee.org/document/9606894/

Internet

https://ieeexplore.ieee.org/document/9606894/

Similar Items