A novel harmony search-K means hybrid algorithm for clustering gene expression data

Recent progress in bioinformatics research has led to the accumulation of huge quantities of biological data at various data sources.The DNA microarray technology makes it possible to simultaneously analyze large number of genes across different samples.Clustering of microarray data can reveal the hidden gene expression patterns from large quantities of expression data that in turnoffers tremendous possibilities in functional genomics, comparative genomics, disease diagnosis and drug development. The k-¬means clustering algorithm is widely used for many practical applications. But the original k-¬means algorithm has severaldrawbacks. It is computationally expensive and generates locally optimal solutions based on the random choice of the initialcentroids. Several methods have been proposed in the literature for improving the performance of the k-¬means algorithm. Ameta-heuristic optimization algorithm named harmony search helps find out near-global optimal solutions by searching the entiresolution space. Low clustering accuracy of the existing algorithms limits their use in many crucial applications of life sciences. Inthis paper we propose a novel Harmony Search-K means Hybrid (HSKH) algorithm for clustering the gene expression data.Experimental results show that the proposed algorithm produces clusters with better accuracy in comparison with the existingalgorithms.