By Topic

Parallel Point Symmetry Based Clustering for Gene Microarray Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sarkar, A. ; Inf. Technol. Dept., Govt. Coll. of Eng. & Leather Technol., Kolkata ; Maulik, U.

Point symmetry-based clustering is an important unsupervised learning tool for recognizing symmetrical convex or non-convex shaped clusters, even in the microarray datasets. To enable fast clustering of this large data, in this article, a distributed space and time-efficient scalable parallel approach for point symmetry-based K-means algorithm has been proposed. A natural basis for analyzing gene expression data using this symmetry-based algorithm, is to group together genes with similar symmetrical patterns of expression. This new parallel implementation satisfies the quadratic reduction in timing, as well as the space and communication overhead reduction without sacrificing the quality of clustering solution. The parallel point symmetry based K-means algorithm is compared with another newly implemented parallel symmetry-based K-means and existing parallel K-means over four artificial, real-life and benchmark microarray datasets, to demonstrate its superiority,both in timing and validity.

Published in:

Advances in Pattern Recognition, 2009. ICAPR '09. Seventh International Conference on

Date of Conference:

4-6 Feb. 2009