首页> 外文会议>2011 IEEE Congress on Evolutionary Computation >Multi-objective evolutionary algorithm for biclustering in microarrays data
【24h】

Multi-objective evolutionary algorithm for biclustering in microarrays data

机译:微阵列数据二聚类的多目标进化算法

获取原文

摘要

Microarrays are a powerful tool in studying genes expressions under several conditions. The obtained data need to be analyzed using data mining methods. Biclustering is a data mining method which consists in simultaneous clustering of rows and columns in a data matrix. Using biclustering, we can extract genes that have similar behavior (co-express) under specific conditions. These genes may share identical biological functions. The aim in analyzing gene expression data is the extraction of maximal number of genes and conditions that present similar behavior. The two objectives to be optimized (size and similarity) are conflicting. Therefore, multi-objective optimization is suitable for biclustering. In our work, we combine a well-known multi-objective genetic algorithm (NSGA-II) with a heuristic to solve the biclutering problem. Due to the huge size of the datasets, we use a string of integers as a solution representation where integers represent the indexes of the rows and the columns. Experimental results on real data set show that our approach can find significant biclusters of high quality.
机译:微阵列是研究几种条件下基因表达的有力工具。获得的数据需要使用数据挖掘方法进行分析。 Biclustering是一种数据挖掘方法,其中包括对数据矩阵中的行和列进行同时聚类。使用双簇分析,我们可以提取在特定条件下具有相似行为(共表达)的基因。这些基因可能具有相同的生物学功能。分析基因表达数据的目的是提取表现出相似行为的最大数目的基因和条件。要优化的两个目标(大小和相似性)是矛盾的。因此,多目标优化适用于双聚类。在我们的工作中,我们将著名的多目标遗传算法(NSGA-II)与启发式算法相结合,解决了二分法问题。由于数据集的巨大容量,我们使用整数字符串作为解决方案表示形式,其中整数表示行和列的索引。在真实数据集上的实验结果表明,我们的方法可以找到高质量的重要双峰。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号