東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Comparison of clustering algorithms ...

Liao, Hsin-I.

FindBook

Google Book

Amazon

博客來

Comparison of clustering algorithms for gene expression microarray data.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Comparison of clustering algorithms for gene expression microarray data./
作者:	Liao, Hsin-I.
面頁冊數:	156 p.
附註:	Source: Dissertation Abstracts International, Volume: 64-03, Section: B, page: 1031.
Contained By:	Dissertation Abstracts International64-03B.
標題:	Biology, Biostatistics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3084839

Comparison of clustering algorithms for gene expression microarray data.
Liao, Hsin-I.

Comparison of clustering algorithms for gene expression microarray data. - 156 p.

Source: Dissertation Abstracts International, Volume: 64-03, Section: B, page: 1031.

Thesis (Ph.D.)--Boston University, 2003.

Gene expression microarrays are a revolutionary high-throughput technology with enormous promise to help geneticists understand and explore the genome. Cluster analysis was one of the first statistical techniques applied to microarray data. In fact, microarray data can be treated as a matrix: rows represent gene variables and columns represent subjects. Generally there are two types of experimental designs: a single subject with multiple observations over time; and multiple subjects with single time. Here subjects can be treated as cell lines, experiments, or drug treatments, etc. In addition, the matrices can be studied through two aspects: comparing RNA expression profiles of genes by comparing rows; and comparing profiles of subjects by comparing columns. The latter case is familiar to statisticians who are used to dealing with data featuring small to medium number of variables and large number of subjects. The former case is new. Here researchers and statisticians have to deal with hundreds or even thousands of variables and, usually, a small number of subjects. The emphasis is on clustering genes with similar expressions over multiple observations. In a genetic sense, if two genes are similarly expressed, we can hypothesize that the two genes are related functionally. This thesis concerns itself with this situation.Subjects--Topical Terms:

1018416
Biology, Biostatistics.

Comparison of clustering algorithms for gene expression microarray data.
LDR:03455nmm 2200277 4500 001 1856148
005 20040621100419.5
008 130614s2003 eng d
035 $a (UnM)AAI3084839
035 $a AAI3084839
040 $a UnM $c UnM
100 1 $a Liao, Hsin-I. $3 1943936
245 1 0 $a Comparison of clustering algorithms for gene expression microarray data.
300 $a 156 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-03, Section: B, page: 1031.
500 $a Major Adviser: Ralph B. D'Agostino, Sr.
502 $a Thesis (Ph.D.)--Boston University, 2003.
520 $a Gene expression microarrays are a revolutionary high-throughput technology with enormous promise to help geneticists understand and explore the genome. Cluster analysis was one of the first statistical techniques applied to microarray data. In fact, microarray data can be treated as a matrix: rows represent gene variables and columns represent subjects. Generally there are two types of experimental designs: a single subject with multiple observations over time; and multiple subjects with single time. Here subjects can be treated as cell lines, experiments, or drug treatments, etc. In addition, the matrices can be studied through two aspects: comparing RNA expression profiles of genes by comparing rows; and comparing profiles of subjects by comparing columns. The latter case is familiar to statisticians who are used to dealing with data featuring small to medium number of variables and large number of subjects. The former case is new. Here researchers and statisticians have to deal with hundreds or even thousands of variables and, usually, a small number of subjects. The emphasis is on clustering genes with similar expressions over multiple observations. In a genetic sense, if two genes are similarly expressed, we can hypothesize that the two genes are related functionally. This thesis concerns itself with this situation.
520 $a Various clustering procedures have been developed for extracting the maximum amount of valid information from microarray data. Predating the genetic era, Cureton and D'Agostino created a clustering algorithm based on principal components and factor analysis concepts. We investigate its behavior on microarray data. It is compared to procedures frequently used in microarray analysis, such as hierarchical clustering, K-means, and self-organizing map. All algorithms are applied to both simulation study and the genes of <italic>Sacharomyces cerevisiae</italic> (budding yeast). The clustering results are evaluated using external and internal criteria. The external statistic is focused on the <italic>agreement</italic> between estimation and true labels while the internal statistic is on the <italic>distance</italic>, such as maximizing between clusters and minimizing within clusters. The Cureton and D'Agostino procedure exceeds the other procedures when judged by the internal criterion. It is, however, not as good on the external criterion. A recommendation for practical use is suggested which combines the Cureton and D'Agostino methods with the other methods to address both the internal and external criteria.
590 $a School code: 0017.
650 4 $a Biology, Biostatistics. $3 1018416
650 4 $a Biology, Molecular. $3 1017719
690 $a 0308
690 $a 0307
710 2 0 $a Boston University. $3 1017454
773 0 $t Dissertation Abstracts International $g 64-03B.
790 1 0 $a D'Agostino, Ralph B., Sr., $e advisor
790 $a 0017
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3084839