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...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
IEEE
2021
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/57fb50f62d6341fc965c97b77f4da80b |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!