By Topic

Hierarchical clustering of gene expression data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Feng Luo ; Dept. of Comput. Sci., Texas Univ., Richardson, TX, USA ; Kun Tang ; L. Khan

Rapid development of biological technologies generates a huge amount of data, which provides a processing and global view of the gene expression levels across different conditions and over multiple stages. Analyzation and interpretation of these massive data is a challenging task. One of the most important steps is to extract useful and rational fundamental patterns of gene expression inherent in these huge data. Clustering technology is one of the useful and popular methods to obtain these patterns. In this paper we propose a new hierarchical clustering algorithm to obtain gene expression patterns. This algorithm constructs a hierarchy from top to bottom based on a self-organizing tree. It dynamically finds the number of clusters at each level. We compare our algorithm with the traditional hierarchical agglomerative clustering (HAC) algorithm. We apply our algorithm to an existing 112 rat central nervous system gene expression data. We observe that our algorithm extracts patterns with different levels of abstraction. Furthermore, our approach is useful on recognizing features in complex gene expression data.

Published in:

Bioinformatics and Bioengineering, 2003. Proceedings. Third IEEE Symposium on

Date of Conference:

10-12 March 2003