Skip Navigation



Biometrika Advance Access published online on February 28, 2007
Biometrika, doi:10.1093/biomet/asm018
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
94/1/19    most recent
asm018v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Yuan, M.
Right arrow Articles by Lin, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © Biometrika Trust

Model election and estimation in the Gaussian graphical model

Ming Yuan and Yi Lin

School of Industrial and Systems Engineering, Georgia Institute of Technology, 755 Ferst Drive NW, Atlanta, Georgia 30332, U.S.A.
Department of Statistics, University of Wisconsin, Madison, Wisconsin 53706, U.S.A.

myuan{at}isye.gatech.edu

yilin{at}stat.wisc.edu

Received for publication 1 January 2006. Revision received 1 August 2006.
  Abstract

We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian graphical model. The methods lead to a sparse and shrinkage estimator of the concentration matrix that is positive definite, and thus conduct model selection and estimation simultaneously. The implementation of the methods is nontrivial because of the positive definite constraint on the concentration matrix, but we show that the computation can be done effectively by taking advantage of the efficient maxdet algorithm developed in convex optimization. We propose a BIC-type criterion for the selection of the tuning parameter in the penalized likelihood methods. The connection between our methods and existing methods is illustrated. Simulations and real examples demonstrate the competitive performance of the new methods.

Key Words: covariance selection • lasso • maxdet algorithm • nonnegative garrote • penalized likelihood


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
S. Anjum, A. Doucet, and C. C. Holmes
A boosting approach to structure learning of graphs with and without prior knowledge
Bioinformatics, November 15, 2009; 25(22): 2929 - 2936.
[Abstract] [Full Text] [PDF]

Home page
 BiostatisticsHome page
A. Andrei and C. Kendziorski
An efficient method for identifying statistical interactors in gene association networks
Biostat., October 1, 2009; 10(4): 706 - 718.
[Abstract] [Full Text] [PDF]

Home page
 BiostatisticsHome page
J. Friedman, T. Hastie, and R. Tibshirani
Sparse inverse covariance estimation with the graphical lasso
Biostat., July 1, 2008; 9(3): 432 - 441.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.