The reviewed record of science sign in
Pith

arxiv: 2102.02431 · v1 · pith:7Q7NWST5 · submitted 2021-02-04 · cs.LG · cs.IT· math.IT

Graph Coding for Model Selection and Anomaly Detection in Gaussian Graphical Models

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:7Q7NWST5record.jsonopen to challenge →

classification cs.LG cs.ITmath.IT
keywords modelgraphdatadescriptiongaussianlengthselectiongraphical
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.