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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Jitendra K. Tugnait
Formato: article
Lenguaje:EN
Publicado: IEEE 2021
Materias:
Sparse graph learning
graph estimation
graph Laplacian
undirected graph
inverse covariance estimation
Electrical engineering. Electronics. Nuclear engineering
TK1-9971
Acceso en línea:https://doaj.org/article/57fb50f62d6341fc965c97b77f4da80b
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Internet

https://doaj.org/article/57fb50f62d6341fc965c97b77f4da80b

Ejemplares similares