DeepAI AI Chat
Log In Sign Up

Learning Gaussian Graphical Models Using Discriminated Hub Graphical Lasso

by   Zhen Li, et al.
NC State University

We develop a new method called Discriminated Hub Graphical Lasso (DHGL) based on Hub Graphical Lasso (HGL) by providing prior information of hubs. We apply this new method in two situations: with known hubs and without known hubs. Then we compare DHGL with HGL using several measures of performance. When some hubs are known, we can always estimate the precision matrix better via DHGL than HGL. When no hubs are known, we use Graphical Lasso (GL) to provide information of hubs and find that the performance of DHGL will always be better than HGL if correct prior information is given and will seldom degenerate when the prior information is wrong.


page 1

page 2

page 3

page 4


Tree-based Node Aggregation in Sparse Graphical Models

High-dimensional graphical models are often estimated using regularizati...

Graphical Elastic Net and Target Matrices: Fast Algorithms and Software for Sparse Precision Matrix Estimation

We consider estimation of undirected Gaussian graphical models and inver...

antGLasso: An Efficient Tensor Graphical Lasso Algorithm

The class of bigraphical lasso algorithms (and, more broadly, 'tensor'-g...

Graphical model inference with external network data

A frequent challenge when using graphical models in applications is that...

Statistical Downscaling of Model Projections with Multivariate Basis Graphical Lasso

We describe an improved statistical downscaling method for Earth science...

Exact Hybrid Covariance Thresholding for Joint Graphical Lasso

This paper considers the problem of estimating multiple related Gaussian...