Clustering A Collection of Networks With Mixtures of L1-Sparse Graphical Models

Zuogong Yue, Victor Solo

Abstract

Attention has turned in recently to clustering of collections networks where each network is characterized by a sparse inverse covariance matrix. Here we consider a mixture model of sparse Gaussian graphical models and develop an exact EM algorithm that improves considerably on a previous approximation. We provide numerical examples to show its superior performance.
BibTeX
@inproceedings{yue2021clustering,
  author = {Zuogong Yue and Victor Solo},
  title = {{Clustering A Collection of Networks With Mixtures of L<sub>1</sub>-Sparse Graphical Models}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2021},
  url = {https://openreview.net/forum?id=trJ6UDkPfr4},
}

Loading related content...

Figure