東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Approaches to clustering gene expres...

Krishnamurthy, Praveen.

FindBook

Google Book

Amazon

博客來

Approaches to clustering gene expression time course data.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approaches to clustering gene expression time course data./
作者:	Krishnamurthy, Praveen.
面頁冊數:	68 p.
附註:	Source: Masters Abstracts International, Volume: 45-01, page: 0358.
Contained By:	Masters Abstracts International45-01.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1436837
ISBN:	9780542772269

Approaches to clustering gene expression time course data.
Krishnamurthy, Praveen.

Approaches to clustering gene expression time course data. - 68 p.

Source: Masters Abstracts International, Volume: 45-01, page: 0358.

Thesis (M.S.)--State University of New York at Buffalo, 2006.

Conventional techniques to cluster gene expression time course data have either ignored the time aspect, by treating time points as independent, or have used parametric models where the model complexity has to be fixed beforehand. In this thesis, we have applied a non-parametric version of the traditional hidden Markov model (HMM), called the hierarchical Dirichlet process - hidden Markov model (HDP-HMM), to the task of clustering gene expression time course data. The HDP-HMM is an instantiation of an HMM in the hierarchical Dirichlet process (HDP) framework of Teh et al. (2004), in which we place a non-parametric prior on the number of hidden states of an HMM that allows for a countably infinite number of hidden states, and hence overcomes the issue of fixing model complexity. At the same time, by having a Dirichlet process in a hierarchical framework we let the same countably infinite set of "next states" in the Markov chain of the HMM be shared without constraining the flexible architecture of the model. We describe the algorithm in detail and compare the results obtained by our method with those obtained from traditional methods on two popular datasets - Iyer et al. (1999) and Cho et al. (1998). We show that a nonparametric hierarchical model such as ours can solve complex clustering tasks effectively without having to fix the model complexity beforehand and at the same time avoids overfitting.

ISBN: 9780542772269Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Approaches to clustering gene expression time course data.
LDR:02283nmm 2200277 4500 001 1830550
005 20070430071721.5
008 130610s2006 eng d
020 $a 9780542772269
035 $a (UnM)AAI1436837
035 $a AAI1436837
040 $a UnM $c UnM
100 1 $a Krishnamurthy, Praveen. $3 1919374
245 1 0 $a Approaches to clustering gene expression time course data.
300 $a 68 p.
500 $a Source: Masters Abstracts International, Volume: 45-01, page: 0358.
500 $a Adviser: Matthew J. Beal.
502 $a Thesis (M.S.)--State University of New York at Buffalo, 2006.
520 $a Conventional techniques to cluster gene expression time course data have either ignored the time aspect, by treating time points as independent, or have used parametric models where the model complexity has to be fixed beforehand. In this thesis, we have applied a non-parametric version of the traditional hidden Markov model (HMM), called the hierarchical Dirichlet process - hidden Markov model (HDP-HMM), to the task of clustering gene expression time course data. The HDP-HMM is an instantiation of an HMM in the hierarchical Dirichlet process (HDP) framework of Teh et al. (2004), in which we place a non-parametric prior on the number of hidden states of an HMM that allows for a countably infinite number of hidden states, and hence overcomes the issue of fixing model complexity. At the same time, by having a Dirichlet process in a hierarchical framework we let the same countably infinite set of "next states" in the Markov chain of the HMM be shared without constraining the flexible architecture of the model. We describe the algorithm in detail and compare the results obtained by our method with those obtained from traditional methods on two popular datasets - Iyer et al. (1999) and Cho et al. (1998). We show that a nonparametric hierarchical model such as ours can solve complex clustering tasks effectively without having to fix the model complexity beforehand and at the same time avoids overfitting.
590 $a School code: 0656.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Computer Science. $3 626642
690 $a 0715
690 $a 0984
710 2 0 $a State University of New York at Buffalo. $3 1017814
773 0 $t Masters Abstracts International $g 45-01.
790 1 0 $a Beal, Matthew J., $e advisor
790 $a 0656
791 $a M.S.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1436837