By Topic

A Center Closeness Algorithm for the Analyses 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
$31 $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

5 Author(s)
Huakun Wang ; Sch. of Math. Sci., Heilongjiang Univ., Harbin, China ; Lixin Feng ; Zhou Ying ; Zhang Xu
more authors

Clustering is an important computational tool for identifying gene sets with similar profiles. Various clustering methods have been proposed for the analyses of gene expression data, among them, k-means is a widely used method because of its simplicity and computational speed which allows it to run on large datasets. Nevertheless, k-means need to determine the cluster number prior to clustering, which greatly influences the clustering results. This paper proposed a novel center closeness clustering algorithm that can automatically determine the cluster number based on the distances of data points. We used this proposed algorithm to cluster two gene expression data and compared the clustering results with those obtained by k-means. The cluster validity indices showed that our algorithm is obviously superior to k-means.

Published in:

Bioinformatics and Biomedical Engineering, (iCBBE) 2011 5th International Conference on

Date of Conference:

10-12 May 2011