Comparative Study of three Clustering Algorithms for Microarray Data

Abstract

High throughput genomic data analysis is becoming an increasingly integral part of biomedical research. The information derived from gene expression analysis helps in diagnosing the treatment modality given to the patient. However, the amount of data is humongous and becomes complex to examine manually. Unsupervised machine learning algorithms perform complex tasks on an unlabelled data by clustering to comprehend the underlying structure and behaviour of the pattern. Clustering microarray data, examines the differential expressed genes found by grouping the genes based on the similarity of the expression values. In this study, we propose to elucidate the best clustering algorithm for gene expression data on various clinical conditions. The proposed study was carried on three gene expression datasets of Severe acute respiratory syndrome, Amyotrophic lateral sclerosis and Parkinson’s disease. Differentially expressed genes were found at three p-values 0.01, 0.05, 0.001 and the most significant number of genes were retrieved at p-value 0.05. We experimented the differential expressed genes on three clustering algorithms, namely Hierarchical clustering, k-means clustering and fuzzy clustering of the three diseases. The performance of the three clustering algorithms was evaluated using the internal validity index, wherein Hierarchical clustering was found to be best for gene expression data.