Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networks
Hongzhe Li,Jiang Gui +1 more
TL;DR: A threshold gradient descent (TGD) regularization procedure for estimating the sparse precision matrix in the setting of Gaussian graphical models is introduced and demonstrated to identify biologically meaningful genetic networks based on microarray gene expression data.
read more
Abstract: SUMMARY Large-scale microarray gene expression data provide the possibility of constructing genetic networks or biological pathways. Gaussian graphical models have been suggested to provide an effective method for constructing such genetic networks. However, most of the available methods for constructing Gaussian graphs do not account for the sparsity of the networks and are computationally more demanding or infeasible, especially in the settings of high dimension and low sample size. We introduce a threshold gradient descent (TGD) regularization procedure for estimating the sparse precision matrix in the setting of Gaussian graphical models and demonstrate its application to identifying genetic networks. Such a procedure is computationally feasible and can easily incorporate prior biological knowledge about the network structure. Simulation results indicate that the proposed method yields a better estimate of the precision matrix than the procedures that fail to account for the sparsity of the graphs. We also present the results on inference of a gene network for isoprenoid biosynthesis in Arabidopsis thaliana. These results demonstrate that the proposed procedure can indeed identify biologically meaningful genetic networks based on microarray gene expression data.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Model selection and estimation in the Gaussian graphical model
Ming Yuan,Yi Lin +1 more
TL;DR: The implementation of the penalized likelihood methods for estimating the concentration matrix in the Gaussian graphical model is nontrivial, but it is shown that the computation can be done effectively by taking advantage of the efficient maxdet algorithm developed in convex optimization.
Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data
TL;DR: This work considers the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse, and presents two new algorithms for solving problems with at least a thousand nodes in the Gaussian case.
Partial Correlation Estimation by Joint Sparse Regression Models.
TL;DR: It is shown that space performs well in both nonzero partial correlation selection and the identification of hub variables, and also outperforms two existing methods.
High dimensional covariance matrix estimation using a factor model
TL;DR: This work examines covariance matrix estimation in the asymptotic framework that the dimensionality p tends to [infinity] as the sample size n increases and identifies situations under which the factor approach increases performance substantially or marginally.
820
Joint estimation of multiple graphical models
TL;DR: An estimator forGaussian graphical models appropriate for data from several graphical models that share the same variables and some of the dependence structure is developed, aiming to preserve the common structure, while allowing for differences between the categories.
References
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Network biology: understanding the cell's functional organization
TL;DR: This work states that rapid advances in network biology indicate that cellular networks are governed by universal laws and offer a new conceptual framework that could potentially revolutionize the view of biology and disease pathologies in the twenty-first century.
Lethality and centrality in protein networks
TL;DR: It is demonstrated that the phenotypic consequence of a single gene deletion in the yeast Saccharomyces cerevisiae is affected to a large extent by the topological position of its protein product in the complex hierarchical web of molecular interactions.
5.8K
High-dimensional graphs and variable selection with the Lasso
TL;DR: It is shown that neighborhood selection with the Lasso is a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs and is hence equivalent to variable selection for Gaussian linear models.
High-dimensional graphs and variable selection with the Lasso
TL;DR: In this article, neighborhood selection with the Lasso is proposed as a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs, which is equivalent to variable selection for Gaussian linear models.
3K