首页> 外文期刊>International Journal of Engineering and Technology >Microarray Gene Expression Data Mining using High End Clustering Algorithm based on Attraction-Repulsion Technique
【24h】

Microarray Gene Expression Data Mining using High End Clustering Algorithm based on Attraction-Repulsion Technique

机译:基于吸引力-排斥技术的高端聚类算法芯片基因表达数据挖掘

获取原文
       

摘要

Microarray Gene expression data analysis is one of the key domains in the modern cellular and molecular biology system design and analysis; shortly we called it computational simulation of genome-wide expression from DNA hybridization. We present here a high end clustering algorithm basically a technique following the inspiration led by natural attraction and the repulsion processes. It groups the similarly expressed genes in same clusters, co-expressed and differently expressed ones in different clusters. Most importantly, it takes into account of the outliers in an efficient manner by not allowing them to interfere with the similarly expressed gene clusters on the fly. In the first clustering process, it calculates the distances of all the genes in a proximity range set in prior, henceforth attracting all the least distant genes from the seed gene. Varying the proximity range in the subsequent run, repulse the maximally distant genes from the same cluster, thereby achieving a near to perfect cluster formation at the end. We include cluster validity testing using Hubert?s statistics technique, which shows a very optimal clusters validity result.
机译:芯片基因表达数据分析是现代细胞和分子生物学系统设计和分析的关键领域之一。不久,我们将其称为通过DNA杂交对全基因组表达进行计算的模拟。我们在这里介绍一种高端聚类算法,该算法基本上是一种遵循自然吸引和排斥过程所启发的技术。它将相似表达的基因分组在同一簇中,共表达,将不同表达的基因分组在不同簇中。最重要的是,它以有效的方式考虑了离群值,方法是不允许它们异常地干扰相似表达的基因簇。在第一个聚类过程中,它计算所有基因在预先设置的邻近范围内的距离,此后从种子基因吸引所有距离最小的基因。在随后的运行中改变邻近范围,从同一簇排斥最大距离的基因,从而最终达到接近完美的簇形成。我们包括使用Hubert统计技术进行的聚类有效性测试,该测试显示了非常理想的聚类有效性结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号