arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1307.3549cs.CEcs.LG
收藏

基因表达数据聚类算法的性能分析

Performance Analysis of Clustering Algorithms for Gene Expression Data

Periyar University(佩里亚尔大学)

T. Chandrasekhar, K. Thangavel, E. Elayaraja

摘要:

微阵列技术是一种可以同时监测数千个基因到各种实验条件的过程。它用于鉴定特定细胞或组织中的共表达基因,这些基因被积极地用于制造蛋白质,这种方法被用于分析基因表达,这是生物信息学研究的一个重要任务。基因表达数据的聚类分析已被证明是鉴定共表达基因、生物学相关基因分组和样品的有用工具。本文分析了ISODATA- AGMFI中自动生成合并因子的K均值算法,在ISODATA的基础上对基因芯片数据集进行分组。AGMFI是为合并和溢出因子生成初始值,最大合并时间,而不是像ISODATA那样选择有效值。每个聚类的初始种子通常是顺序或随机选择的。发现最终簇的质量受这些初始种子的影响。对于现实生活中的问题,不能预测合适的聚类数。为了克服上述缺点,目前的研究集中在开发聚类算法,而不给初始的聚类数。

英文摘要:

Microarray technology is a process that allows thousands of genes simultaneously monitor to various experimental conditions. It is used to identify the co-expressed genes in specific cells or tissues that are actively used to make proteins, This method is used to analysis the gene expression, an important task in bioinformatics research. Cluster analysis of gene expression data has proved to be a useful tool for identifying co-expressed genes, biologically relevant groupings of genes and samples. In this paper we analysed K-Means with Automatic Generations of Merge Factor for ISODATA- AGMFI, to group the microarray data sets on the basic of ISODATA. AGMFI is to generate initial values for merge and Spilt factor, maximum merge times instead of selecting efficient values as in ISODATA. The initial seeds for each cluster were normally chosen either sequentially or randomly. The quality of the final clusters was found to be influenced by these initial seeds. For the real life problems, the suitable number of clusters cannot be predicted. To overcome the above drawback the current research focused on developing the clustering algorithms without giving the initial number of clusters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑