首页> 外文会议>IEEE International Conference on Bioinformatics Biomedicine >Microarray Time-Series Data Clustering Using Rough-Fuzzy C-Means Algorithm
【24h】

Microarray Time-Series Data Clustering Using Rough-Fuzzy C-Means Algorithm

机译:使用粗糙模糊C-means算法的微阵列时间序列数据聚类

获取原文

摘要

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.
机译:聚类是从微阵数据中发现共同表达基因组的功能基因组的重要分析之一。本文介绍了粗糙模糊C型(RFCM)算法的应用以发现共表达的基因簇。基于RFCM的微阵列数据聚类的主要问题之一是如何选择不同群集的初始原型。为了克服这种限制,提出了一种方法来选择初始集群中心。它使RFCM算法能够收敛到最佳或近最佳解决方案,并有助于发现共同表达的基因簇。还基于DUNN的集群有效性索引引入了一种方法,以识别初始化方法和RFCM算法的不同参数的最佳值。 RFCM算法的有效性以及与其他相关方法的比较,在使用剪影指数,Davies-Bould基于基于基于基于基于索引和基因本体的分析的五个酵母基因表达时间序列数据集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号