Skip Navigation


Biostatistics Advance Access first published online on December 2, 2005
This version published online on December 7, 2005
Biostatistics, doi:10.1093/biostatistics/kxj008
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
7/2/302    most recent
kxj008v2
kxj008v1
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 Similar articles in PubMed
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
Right arrow Disclaimer
Google Scholar
Right arrow Articles by Li, H.
Right arrow Articles by Gui, J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Li, H.
Right arrow Articles by Gui, J.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oxfordjournals.org.
Received May 31, 2005
Revised November 23, 2005
Accepted November 29, 2005

Article

Gradient Directed Regularization for Sparse Gaussian Concentration Graphs, with Applications to Inference of Genetic Networks

Hongzhe Li 1 * and Jiang Gui 1

1 Department of Biostatistics and Epidemiology, University of Pennsylvania School of Medicine, Philadelphia, PA 19104-6021, U.S.A.

* To whom correspondence should be addressed.
Hongzhe Li, E-mail: hli{at}cceb.upenn.edu


  Abstract

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 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.

This article has been removed from open access.


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
 Genome ResHome page
S. Ma, Q. Gong, and H. J. Bohnert
An Arabidopsis gene network based on the graphical Gaussian model
Genome Res., November 1, 2007; 17(11): 1614 - 1625.
[Abstract] [Full Text] [PDF]

Home page
 BiometrikaHome page
M. Yuan and Y. Lin
Model selection and estimation in the Gaussian graphical model
Biometrika, March 1, 2007; 94(1): 19 - 35.
[Abstract] [Full Text] [PDF]

Home page
 Clin. Cancer Res.Home page
J. Fan and Y. Ren
Statistical Analysis of DNA Microarray Data in Cancer Research
Clin. Cancer Res., August 1, 2006; 12(15): 4469 - 4473.
[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.