期刊
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS
卷 20, 期 4, 页码 892-900出版社
AMER STATISTICAL ASSOC
DOI: 10.1198/jcgs.2011.11051a
关键词
Convex optimization; Gene expression; Inverse covariance estimation; l(1) penalty; Networks; Sparsity
We consider the graphical lasso formulation for estimating a Gaussian graphical model in the high-dimensional setting. This approach entails estimating the inverse covariance matrix under a multivariate normal model by maximizing the l(1)-penalized log-likelihood. We present a very simple necessary and sufficient condition that can be used to identify the connected components in the graphical lasso solution. The condition can be employed to determine whether the estimated inverse covariance matrix will be block diagonal, and if so, then to identify the blocks. This in turn can lead to drastic speed improvements, since one can simply apply a standard graphical lasso algorithm to each block separately. Moreover, the necessary and sufficient condition provides insight into the graphical lasso solution: the set of connected nodes at any given tuning parameter value is a superset of the set of connected nodes at any larger tuning parameter value. This article has supplementary material online.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据