451. Rough Overlapping Biclustering of Gene Expression Data
- Author
-
Gang Li, Ruizhi Wang, Duoqian Miao, and Hongyun Zhang
- Subjects
Set (abstract data type) ,Biclustering ,Expression data ,Intersection (set theory) ,Iterative method ,Gene expression ,Rough set ,Data mining ,computer.software_genre ,Cluster analysis ,computer ,Mathematics - Abstract
A great number of biclustering algorithms have been proposed for analyzing gene expression data. Many of them assume to find exclusive biclusters whose subsets of genes are co-regulated under subsets of conditions without intersection. This is not consistent with a general understanding of biological processes that many genes participate in multiple different processes. Therefore nonexclusive biclustering algorithms are required. In this paper we present a novel approach (ROB) to find potentially overlapping biclusters in the framework of generalized rough sets. Our scheme mainly consists of two phases. First, we generate a set of highly coherent seeds (original biclusters) based on two-way rough k-means clustering. And then, the seeds are iteratively adjusted (enlarged or degenerated) by adding or removing genes and conditions based on a proposed criterion. We illustrate the method on yeast gene expression data. The experiments demonstrate the effectiveness of this approach.
- Published
- 2007
- Full Text
- View/download PDF