An Efficient Algorithm for Mining Coherent Patterns from Heterogeneous Microarrays

  • Authors:
  • Xiang Zhang;Wei Wang

  • Affiliations:
  • University of North Carolina at Chapel Hill, USA;University of North Carolina at Chapel Hill, USA

  • Venue:
  • SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

DNA microarray techniques present a novel way for geneticists to monitor interactions among tens of thousands of genes simultaneously, and have become standard lab routines in gene discovery, disease diagnosis, and drug design. There has been extensive research on coherent subspace clustering of gene expressions measured under consistent experimental settings. This implies that all experiments are run using the same batch of microarray chips with similar characteristics of noise. Algorithms developed under this assumption may not be applicable for analyzing data collected from heterogeneous settings, where the set of genes being monitored may be different and expression levels may be not directly comparable even for the same gene. In this paper, we propose a model, F-cluster, for mining subspace coherent patterns from heterogeneous gene expression data, which is shown effective for revealing truthful patterns and reducing spurious ones. We also develop an efficient and scalable hybrid approach that combines gene-pair based and sample-pair based pruning to generate F-clusters from multiple gene expression matrices simultaneously. The experimental results demonstrate that our model can discover significant clusters that may not be identified by previous models.