Volume 21, No. 1, 2024
Evaluation Of The Efficiency Of Clustering Using Ik-Means And Imap-Reduce Approach For Microarray Data
Araja Raja Gopal , Dr.M.H.M.Krishna Prasad
Abstract
Clustering algorithms are part of algorithms of unsupervised-learning that are commonly used in different fields. Two major impacts on the data clustering algorithm have been the rapid developments and creation of electronic data. This includes the view of how the big data is stored as well as how it is processed. A cluster has a high level of resemblance to the same cluster and a low level of resemblance to other clusters. Clustering algorithms are commonly used in all fields, such as retail, banking, development, etc.. Even though different methodologies are proposed with different scenarios, but none of the existing methodologies are proven to be a better approaches. Here, in our work we have adopted an improved Map-Reduce programming model to combine the Canopy clustering and K-means clustering algorithms to process the Microarray data with the available commodity hardware with an aim to achieve better performance. The results obtained from different scenarios shown that the proposed method was capable of improving computational speed significantly by increasing the nodes as required. In this research, this paper explored the efficiency by evaluating and implementing the proposed Improved k-means with Improved Map Reduce algorithm which runs on Hadoop Frame work using Microarray dataset along with different datasets.
Pages: 103-126
Keywords: Map-Reduce, K-Means, Improved K-Means, Canopy Clustering, Hadoop, Parallel Computing, Distributed Computing.