A fuzzy clustering algorithm for analysis of gene expression profiles

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Advancement of DNA microarray technology has made it possible to get a great deal of biological information by a single experiment. Clustering algorithm is to group genes and reveal their functions or analyze unknown genes, which is categorized into hard and fuzzy clustering. For analyzing DNA microarray, fuzzy clustering can be better since genes can have several genetic information. In this paper, we present the GG (Gath-Geva) algorithm, which is one fuzzy clustering method, for clustering gene expression data. The GG algorithm is an improved version of the fuzzy c-means and GK (Gustafson-Kessel) algorithms and is appropriate for clustering gene expression data that have high dimension and ambiguous distribution. We have clustered serum and yeast data by the GG algorithm and compared it with the fuzzy c-means and GK algorithms. Through these experiments, we confirm that the GG algorithm is better for clustering gene expression data than other two algorithms. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Park, H. S., Yoo, S. H., & Cho, S. B. (2004). A fuzzy clustering algorithm for analysis of gene expression profiles. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3157, pp. 967–968). Springer Verlag. https://doi.org/10.1007/978-3-540-28633-2_117

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free