Gene microarray data analysis using parallel point–symmetry–based clustering. (1st January 2015)

• Record Type: Journal Article
• Authors: Sarkar, Anasua; Maulik, Ujjwal
• Is Part Of: International journal of data mining and bioinformatics. Volume 11:Number 3(2015)
• Page Start: 277
• Page End: 300
• Publication Date: 2015-01-01
• Subjects: clustering algorithms -- cluster validity measures -- k–means clustering -- gene microarray data -- gene expression -- point–symmetry based distance -- parallel algorithms -- bioinformatics; Data mining -- Periodicals; Bioinformatics -- Periodicals; 006.312
• DOI: 10.1504/IJDMB.2015.067320
• Languages: English
• ISSNs: 1748-5673

Abstract

Identification of co–expressed genes is the central goal in microarray gene expression analysis. Point–symmetry–based clustering is an important unsupervised learning technique for recognising symmetrical convex– or non–convex–shaped clusters. To enable fast clustering of large microarray data, we propose a distributed time–efficient scalable approach for point–symmetry–based K–Means algorithm. A natural basis for analysing gene expression data using symmetry–based algorithm is to group together genes with similar symmetrical expression patterns. This new parallel implementation also satisfies linear speedup in timing without sacrificing the quality of clustering solution on large microarray data sets. The parallel point–symmetry–based K–Means algorithm is compared with another new parallel symmetry–based K–Means and existing parallel K–Means over eight artificial and benchmark microarray data sets, to demonstrate its superiority, in both timing and validity. The statistical analysis is also performed to establish the significance of this message–passing–interface based point–symmetry K–Means implementation. We also analysed the biological relevance of clustering solutions.