東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Estimation and inference in high dim...

Shojaie, Ali.

FindBook

Google Book

Amazon

博客來

Estimation and inference in high dimensional networks, with applications to biological systems.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Estimation and inference in high dimensional networks, with applications to biological systems./
作者:	Shojaie, Ali.
面頁冊數:	179 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 6861.
Contained By:	Dissertation Abstracts International71-11B.
標題:	Biology, Biostatistics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3429397
ISBN:	9781124282862

Estimation and inference in high dimensional networks, with applications to biological systems.
Shojaie, Ali.

Estimation and inference in high dimensional networks, with applications to biological systems. - 179 p.

Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 6861.

Thesis (Ph.D.)--University of Michigan, 2010.

This dissertation discusses several aspects of estimation and inference for high dimensional networks, and is divided into three main parts. First, to assess the significance of arbitrary subnetworks (e.g. pathways), I propose a latent variable model that directly incorporates the network information. By formulating the problem as a (generalized) mixed linear model, I introduce a general inference procedure for testing the significance of subnetworks, that can be used to test for changes in both expression levels of the corresponding nodes (e.g. genes), as well as the structure of the network. The framework is then extended for analysis of data obtained from complex experimental designs. We also study the effect of noise in the network information, both theoretically and empirically, and show that the proposed inference procedure is robust to the presence of random noise.

ISBN: 9781124282862Subjects--Topical Terms:

1018416
Biology, Biostatistics.

Estimation and inference in high dimensional networks, with applications to biological systems.
LDR:03340nam 2200313 4500 001 1404602
005 20111130124054.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124282862
035 $a (UMI)AAI3429397
035 $a AAI3429397
040 $a UMI $c UMI
100 1 $a Shojaie, Ali. $3 1683935
245 1 0 $a Estimation and inference in high dimensional networks, with applications to biological systems.
300 $a 179 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 6861.
500 $a Adviser: George Michailidis.
502 $a Thesis (Ph.D.)--University of Michigan, 2010.
520 $a This dissertation discusses several aspects of estimation and inference for high dimensional networks, and is divided into three main parts. First, to assess the significance of arbitrary subnetworks (e.g. pathways), I propose a latent variable model that directly incorporates the network information. By formulating the problem as a (generalized) mixed linear model, I introduce a general inference procedure for testing the significance of subnetworks, that can be used to test for changes in both expression levels of the corresponding nodes (e.g. genes), as well as the structure of the network. The framework is then extended for analysis of data obtained from complex experimental designs. We also study the effect of noise in the network information, both theoretically and empirically, and show that the proposed inference procedure is robust to the presence of random noise.
520 $a In the second part, we consider the problem of estimating directed graphs from observed data. The general problem of estimation of directed graphs is computationally NP-hard and direction of interactions may not be distinguishable from observations. I consider a special case of this problem, where the nodes (i.e. variables) inherit a natural ordering, and propose efficient penalized likelihood methods for estimating the underlying network structure. Consistency of the estimators in the high dimensional setting (more variables than observations) is established. I also propose an extension of the lasso penalty that results in improved estimation of graphical Granger causality from time-course observations.
520 $a The last part of the dissertation is devoted to issues of dimension reduction and efficient computation in networks. I propose a dimension reduction algorithm for networks using Laplacian eigenmaps, discuss the connections of this method to principal component analysis, and formulate the inference problem using a group lasso penalty. I also address computational aspects of estimation in networks, by proposing a distributed algorithm based on block-relaxation and derive conditions required for convergence of the algorithm to the maximum likelihood estimates. Finally, I present an extension of the block-relaxation algorithm, called approximate block-relaxation, that facilitates the use of iterative algorithms in optimization problems with complex objective functions.
590 $a School code: 0127.
650 4 $a Biology, Biostatistics. $3 1018416
650 4 $a Statistics. $3 517247
650 4 $a Biology, Bioinformatics. $3 1018415
690 $a 0308
690 $a 0463
690 $a 0715
710 2 $a University of Michigan. $3 777416
773 0 $t Dissertation Abstracts International $g 71-11B.
790 1 0 $a Michailidis, George, $e advisor
790 $a 0127
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3429397