A graph spectrum based geometric biclustering algorithm.
Biclustering is capable of performing simultaneous clustering on two dimensions of a data matrix and has many applications in pattern classification. For example, in microarray experiments, a subset of genes is co-expressed in a subset of conditions, and biclustering algorithms can be used to detect the coherent patterns in the data for further analysis of function. In this paper, we present a graph spectrum based geometric biclustering (GSGBC) algorithm. In the geometrical view, biclusters can be seen as different linear geometrical patterns in high dimensional spaces. Based on this, the modified Hough transform is used to find the Hough vector (HV) corresponding to sub-bicluster patterns in 2D spaces. A graph can be built regarding each HV as a node. The graph spectrum is utilized to identify the eigengroups in which the sub-biclusters are grouped naturally to produce larger biclusters. Through a comparative study, we find that the GSGBC achieves as good a result as GBC and outperforms other kinds of biclustering algorithms. Also, compared with the original geometrical biclustering algorithm, it reduces the computing time complexity significantly. We also show that biologically meaningful biclusters can be identified by our method from real microarray gene expression data.
Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong. zhiguwang2@student.cityu.edu.hk
Doris Z
DZ
Wang
Hong
H
Yan
D000465:Algorithms; D016000:Cluster Analysis; D030541:Databases, Genetic; D019277:Entropy; D006801:Humans; D058977:Molecular Sequence Annotation; D009369:Neoplasms / Q000235:genetics; D020411:Oligonucleotide Array Sequence Analysis; D015203:Reproducibility of Results; D012441:Saccharomyces cerevisiae / Q000235:genetics; D013997:Time Factors