摘要
定义了一种基于滑动匹配的相似度,并在此基础上提出一种能够自适应确定聚类数目的全局K-均值算法,解决了现有共调控基因聚类方法无法考虑到基因的正反、延时、部分时间和差异表达全部4种共调控关系的问题.将提出的算法应用于微阵列数据中,并将实验结果与CLUSTER 3.0算法进行了比较,验证了算法的可行性和有效性.
This paper presents a new method of similarity measurement, on the basis of which an global K-means algorithm is presented that is self-adaptive to the determination of the number of cluster, so as to solve the problem that the existing methods of co-regulated gene clustering can take into account all the four co-regulating relationships, that is, reverse, asynchronous, part-time, and differences in the expression. The present algorithm has been applied to the microarray data, and the compare experimental results with CLUSTER 3.0 prove that the algorithm is efficient.
出处
《吉林大学学报(理学版)》
CAS
CSCD
北大核心
2009年第2期292-298,共7页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:604330206067309960773095)
国家高技术研究发展计划863项目基金(批准号:2007AA04Z114)
吉林大学"985工程"项目基金
欧盟项目TH/AsiaLink/010(批准号:111084)
教育部"符号计算与知识工程"重点实验室项目基金(批准号:93K-17)
关键词
共调控基因
聚类
全局K-均值
相似度度量
co-regulating gene
clustering
global K-means
similarity measurement