AbdelAziz Amr Mohamed, Soliman Taysir, Ghany Kareem Kamal A, Sewisy Adel
Faculty of Computers and Artificial Intelligence, Beni-Suef University, Egypt.
Faculty of Computers and Information, Assiut University, Egypt.
PeerJ Comput Sci. 2021 Mar 25;7:e416. doi: 10.7717/peerj-cs.416. eCollection 2021.
A microarray is a revolutionary tool that generates vast volumes of data that describe the expression profiles of genes under investigation that can be qualified as Big Data. Hadoop and Spark are efficient frameworks, developed to store and analyze Big Data. Analyzing microarray data helps researchers to identify correlated genes. Clustering has been successfully applied to analyze microarray data by grouping genes with similar expression profiles into clusters. The complex nature of microarray data obligated clustering methods to employ multiple evaluation functions to ensure obtaining solutions with high quality. This transformed the clustering problem into a Multi-Objective Problem (MOP). A new and efficient hybrid Multi-Objective Whale Optimization Algorithm with Tabu Search (MOWOATS) was proposed to solve MOPs. In this article, MOWOATS is proposed to analyze massive microarray datasets. Three evaluation functions have been developed to ensure an effective assessment of solutions. MOWOATS has been adapted to run in parallel using Spark over Hadoop computing clusters. The quality of the generated solutions was evaluated based on different indices, such as Silhouette and Davies-Bouldin indices. The obtained clusters were very similar to the original classes. Regarding the scalability, the running time was inversely proportional to the number of computing nodes.
微阵列是一种革命性的工具,它能生成大量描述所研究基因表达谱的数据,这些数据堪称大数据。Hadoop和Spark是为存储和分析大数据而开发的高效框架。分析微阵列数据有助于研究人员识别相关基因。聚类已成功应用于微阵列数据的分析,它通过将具有相似表达谱的基因分组到簇中来实现。微阵列数据的复杂性使得聚类方法必须采用多个评估函数,以确保获得高质量的解决方案。这将聚类问题转化为了一个多目标问题(MOP)。为了解决多目标问题,提出了一种新的高效混合多目标鲸鱼优化算法与禁忌搜索算法(MOWOATS)。在本文中,提出使用MOWOATS来分析海量微阵列数据集。开发了三个评估函数,以确保对解决方案进行有效评估。MOWOATS已被调整为在Hadoop计算集群上使用Spark并行运行。根据不同指标(如轮廓系数和戴维斯-布尔丁指数)对生成的解决方案的质量进行评估。所获得的簇与原始类别非常相似。在可扩展性方面,运行时间与计算节点数量成反比。