Estimation and Inference for High-Dimensional Gaussian Graphical Models with Structural Constraints.
dc.contributor.author | Ma, Jing | en_US |
dc.date.accessioned | 2015-09-30T14:23:50Z | |
dc.date.available | NO_RESTRICTION | en_US |
dc.date.available | 2015-09-30T14:23:50Z | |
dc.date.issued | 2015 | en_US |
dc.date.submitted | en_US | |
dc.identifier.uri | https://hdl.handle.net/2027.42/113495 | |
dc.description.abstract | This work discusses several aspects of estimation and inference for high-dimensional Gaussian graphical models and consists of two main parts. The first part considers network-based pathway enrichment analysis based on incomplete network information. Pathway enrichment analysis has become a key tool for biomedical researchers to gain insight into the underlying biology of differentially expressed genes, proteins and metabolites. We propose a constrained network estimation framework that combines network estimation based on cell- and condition-specific high-dimensional Omics data with interaction information from existing data bases. The resulting pathway topology information is subsequently used to provide a framework for simultaneous testing of differences in expression levels of pathway members, as well as their interactions. We study the asymptotic properties of the proposed network estimator and the test for pathway enrichment, and investigate its small sample performance in simulated experiments and illustrate it on two cancer data sets. The second part of the thesis is devoted to reconstructing multiple graphical models simultaneously from high-dimensional data. We develop methodology that jointly estimates multiple Gaussian graphical models, assuming that there exists prior information on how they are structurally related. The proposed method consists of two steps: in the first one, we employ neighborhood selection to obtain estimated edge sets of the graphs using a group lasso penalty. In the second step, we estimate the nonzero entries in the inverse covariance matrices by maximizing the corresponding Gaussian likelihood. We establish the consistency of the proposed method for sparse high-dimensional Gaussian graphical models and illustrate its performance using simulation experiments. An application to a climate data set is also discussed. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Structured sparsity | en_US |
dc.subject | Maximum likelihood estimation | en_US |
dc.subject | Graphical lasso | en_US |
dc.subject | Group lasso penalty | en_US |
dc.subject | Norm consistency | en_US |
dc.subject | Pathway enrichment analysis | en_US |
dc.title | Estimation and Inference for High-Dimensional Gaussian Graphical Models with Structural Constraints. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Statistics | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.contributor.committeemember | Michailidis, George | en_US |
dc.contributor.committeemember | Shedden, Kerby A. | en_US |
dc.contributor.committeemember | Nan, Bin | en_US |
dc.contributor.committeemember | Zhu, Ji | en_US |
dc.subject.hlbsecondlevel | Statistics and Numeric Data | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/113495/1/mjing_1.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.