* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Estimation Over Multiple Undirected Graphs
Pathogenomics wikipedia , lookup
History of genetic engineering wikipedia , lookup
Epigenetics of neurodegenerative diseases wikipedia , lookup
Copy-number variation wikipedia , lookup
Public health genomics wikipedia , lookup
Genetic engineering wikipedia , lookup
Oncogenomics wikipedia , lookup
Epigenetics of human development wikipedia , lookup
Neuronal ceroid lipofuscinosis wikipedia , lookup
Genome evolution wikipedia , lookup
Saethre–Chotzen syndrome wikipedia , lookup
Vectors in gene therapy wikipedia , lookup
Epigenetics of diabetes Type 2 wikipedia , lookup
Genome (book) wikipedia , lookup
Gene therapy of the human retina wikipedia , lookup
Gene therapy wikipedia , lookup
The Selfish Gene wikipedia , lookup
Nutriepigenomics wikipedia , lookup
Site-specific recombinase technology wikipedia , lookup
Gene desert wikipedia , lookup
Helitron (biology) wikipedia , lookup
Therapeutic gene modulation wikipedia , lookup
Gene nomenclature wikipedia , lookup
Gene expression programming wikipedia , lookup
Microevolution wikipedia , lookup
Gene expression profiling wikipedia , lookup
Department of Statistics STATISTICS COLLOQUIUM YUNZHANG ZHU School of Statistics University of Minnesota Estimation Over Multiple Undirected Graphs WEDNESDAY, January 22, 2014 at 10:00 AM Ryerson 277, 1100 E. 58th Street, Chicago, IL 60637 ABSTRACT Graphical models are useful in analyzing complex systems involving a large number of interacting units. For example, in gene expression analysis, one key challenge is reconstruction of gene networks, describing gene-gene interactions. Observed attributes of genes, such as gene expressions, are used to reconstruct gene networks through graphical models. In this presentation, I will focus on estimation of multiple undirected graphs, motivated from network analysis under different experimental conditions, such as gene networks for disparate cancer subtypes. A method for pursuing two types of structures, clustering and sparseness, is proposed based on the penalized maximum likelihood. Theoretically, I will present a finite-sample error bound for reconstructing these two types of structures. This leads to consistent reconstruction of them simultaneously, permitting the number of unknown parameters to be exponential in the sample size, in addition to optimality of the proposed estimator as if the true structures were given a priori. Computationally, a necessary and sufficient partition rule is derived, on which estimation of multiple large graphs can proceed with smaller disjoint subproblems. This divide-and-conquer strategy permits efficient computation. Finally, I will demonstrate the proposed method on real examples. For further information and inquiries about building access for persons with disabilities, please contact Kirsten Wellman at 773.702.8333 or send her an email at [email protected]. If you wish to subscribe to our email list, please visit the following website: https://lists.uchicago.edu/web/arc/statseminars.