By Topic

A rough set based novel biclustering algorithm for gene expression 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)
Emilyn, J.J. ; Dept. of IT, Sona Coll. of Technol., Salem, India ; Ramar, K.

Microarray technology has emerged as a boon to simultaneously monitor the expression levels of thousands of genes across collections of related samples. The main goal in the analysis of large and heterogeneous gene expression datasets is to identify groups of genes that get expressed in a set of experimental conditions. Several clustering techniques have been proposed for identifying gene signatures and to understand their role and many of them have been applied to gene expression data, but with partial success. This paper proposes to develop a novel biclustering technique (RBGED) that is based on rough set theory. This algorithm simultaneously clusters both the rows and columns of a data matrix. The advantage is that it overcomes the restriction of one object belonging to only one cluster. This algorithm is intelligent because it automatically determines the optimum number of clusters. A theoretical understanding of the proposed algorithm is analyzed and case studied with Rough Fuzzy k means algorithm.

Published in:

Electronics Computer Technology (ICECT), 2011 3rd International Conference on  (Volume:2 )

Date of Conference:

8-10 April 2011