Rough-fuzzy c-means for clustering microarray gene expression data
PerMIn'12 Proceedings of the First Indo-Japan conference on Perception and Machine Intelligence
Soft clustering -- Fuzzy and rough approaches and their extensions and derivatives
International Journal of Approximate Reasoning
Rough intuitionistic fuzzy C-means algorithm and a comparative analysis
Proceedings of the 6th ACM India Computing Convention
An extension to Rough c-means clustering based on decision-theoretic Rough Sets model
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
Clustering is one of the important analysis in functional genomics that discovers groups of co-expressed genes from micro array data. In this paper, the application of rough-fuzzy c-means (RFCM)algorithm is presented to discover co-expressed gene clusters. One of the major issues of the RFCM based micro array data clustering is how to select initial prototypes of different clusters. To overcome this limitation, a method is proposed to select initial cluster centers. It enables the RFCM algorithm to converge to an optimum or near optimum solutions and helps to discover co-expressed gene clusters. A method is also introduced based on Dunn's cluster validity index to identify optimum values of different parameters of the initialization method and the RFCM algorithm. The effectiveness of the RFCM algorithm, along with a comparison with other related methods, is demonstrated on five yeast gene expression time-series data sets using Silhouette index, Davies-Bould in index, and gene ontology based analysis.