Graph Coding for Model Selection and Anomaly Detection in Gaussian Graphical Models
arXiv:2102.02431 · doi:10.1109/ISIT45174.2021.9518002
Abstract
A classic application of description length is for model selection with the minimum description length (MDL) principle. The focus of this paper is to extend description length for data analysis beyond simple model selection and sequences of scalars. More specifically, we extend the description length for data analysis in Gaussian graphical models. These are powerful tools to model interactions among variables in a sequence of i.i.d Gaussian data in the form of a graph. Our method uses universal graph coding methods to accurately account for model complexity, and therefore provide a more rigorous approach for graph model selection. The developed method is tested with synthetic and electrocardiogram (ECG) data to find the graph model and anomaly in Gaussian graphical models. The experiments show that our method gives better performance compared to commonly used methods.
arXiv commentSubmitted to ISIT 2021
References in corpus (7)
- High-dimensional graphs and variable selection with the Lasso
- Extended Bayesian Information Criteria for Gaussian Graphical Models
- Sparse permutation invariant covariance estimation
- Sparsistency and rates of convergence in large covariance matrix estimation
- Brain covariance selection: better individual functional connectivity models using population prior
- Fast and accurate multivariate Gaussian modeling of protein families: Predicting residue contacts and protein-interaction partners
- Change-point detection in high-dimensional covariance structure