• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2008, Vol. 30 ›› Issue (12): 128-130.

• 论文 • 上一篇    下一篇

三维微阵列数据的多目标进化聚类

刘军万[1,2] 李舟军[1,3] 陈义明[1,4]   

  • 出版日期:2008-12-01 发布日期:2010-05-19

  • Online:2008-12-01 Published:2010-05-19

摘要:

聚类技术广泛应用于微阵列数据分析中。在基因-样本-时间GST微阵列数据矩阵中,挖掘三雏聚类成为当前的热门研究课题。3D聚类过程经常需要对多个相互冲突的目标进行优化,而且进化算法以其强大的探寻能力成为高维搜索空间中非常有效的搜索方法。本文基于多目标进化计算方法提出一个新的3D聚类算法MOE-TC,以挖掘GST数据中的3D聚类。现实微阵列数据上的实验验证结果充分说明了本文算法的有效性。

关键词: 三维微阵列 三维聚类 多目标进化 双聚类 数据挖掘

Abstract:

The clustering technique is widely used in microarray data analysis, and mining three-dimensional(3D) clusters in gene-sample-time(simply GST) mic roarray data is emerging as a hot research topic in this area. During the mining of 3D clusters, several objectives have to be optimized simultaneously, and often these objectives are in conflict with each other. Moreover, with great exploration power, evolutionary computation is made as an effective se arch approach in the search space of huge dimensionality. Based on MOEA(Multi-Objective Evolutionary Algorithm), this paper proposes a new 3D cluster    algorithm, MOE-TC(Multi-Objective Evolutionary TriClustering), tO mine 3D clusters in 3D mieroarray data. Experimental results in real microarray dat  ta confirm the validity of the proposed technique.

Key words: 3D microarray, triclustering, multi-objective evolutionary, biclustering, data