title: A novel harmony search-K means hybrid algorithm for clustering gene expression data.
abstract: 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 turn offers 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 several drawbacks. It is computationally expensive and generates locally optimal solutions based on the random choice of the initial centroids. Several methods have been proposed in the literature for improving the performance of the k-¬means algorithm. A meta-heuristic optimization algorithm named harmony search helps find out near-global optimal solutions by searching the entire solution space. Low clustering accuracy of the existing algorithms limits their use in many crucial applications of life sciences. In this 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 existing algorithms.
authors: Department of Computer Science and Engineering, National Institute of Technology Calicut, India- 673 601.
authors: Ka Abdul
authors: KA
authors: Nazeer
authors: Mp
authors: M
authors: Sebastian
authors: Sd Madhu
authors: SM
authors: Kumar
references: BMC Bioinformatics. 2006 Feb 16;7:73
references: 16483361
references: J Comput Biol. 1999 Fall-Winter;6(3-4):281-97
references: 10582567
references: Bioinformatics. 2006 Aug 15;22(16):1988-97
references: 16766561
references: Comput Biol Med. 2008 Mar;38(3):283-93
references: 18061589
references: Bioinformatics. 2002 Aug;18(8):1073-83
references: 12176830
references: BMC Bioinformatics. 2008 Nov 27;9:497
references: 19038021