loading...
Mining Deterministic Biclusters in Gene Expression Data
Taichung, Taiwan, ROC May 19-May 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/BIBE.2004.1317355Fourth IEEE Symposium on Bioinformati ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Zonghong Zhang, National University of Singapore
Alvin Teo, National University of Singapore
Beng Chin Ooi, National University of Singapore
Kian-Lee Tan, National University of Singapore
A bicluster of a gene expression dataset captures the coherence of a subset of genes and a subset of conditions. Biclustering algorithms are used to discover biclusters whose subset of genes are co-regulated under subset of conditions. In this paper, we present a novel approach, called DBF (Deterministic Biclustering with Frequent pattern mining) to finding biclusters. Our scheme comprises two phases. In the first phase, we generate a set of good quality biclusters based on frequent pattern mining. In the second phase, the biclusters are further iteratively refined (enlarged) by adding more genes and/or conditions. We evaluated our scheme against FLOC and our results show that DBF can generate larger and better biclusters.
Citation:
Zonghong Zhang, Alvin Teo, Beng Chin Ooi, Kian-Lee Tan, "Mining Deterministic Biclusters in Gene Expression Data," bibe, pp.283, Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions