Inferring sparse Gaussian graphical models with latent structure

Details Inferring sparse Gaussian graphical models with latent structure Inferring sparse Gaussian graphical models with latent structure

2008-10-17

arxiv.org/abs/0810.3177v1

Electron. J. Statist. Volume 3 (2009), 205-238.

Statistics

Methodology

35 pages, 15 figures

Scientific paper

10.1214/08-EJS314

Our concern is selecting the concentration matrix's nonzero coefficients for a sparse Gaussian graphical model in a high-dimensional setting. This corresponds to estimating the graph of conditional dependencies between the variables. We describe a novel framework taking into account a latent structure on the concentration matrix. This latent structure is used to drive a penalty matrix and thus to recover a graphical model with a constrained topology. Our method uses an $\ell_1$ penalized likelihood criterion. Inference of the graph of conditional dependencies between the variates and of the hidden variables is performed simultaneously in an iterative \textsc{em}-like algorithm. The performances of our method is illustrated on synthetic as well as real data, the latter concerning breast cancer.

Affiliated with

Also associated with

No associations

Rating

Inferring sparse Gaussian graphical models with latent structure does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inferring sparse Gaussian graphical models with latent structure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inferring sparse Gaussian graphical models with latent structure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352618