TY - JOUR
T1 - Mining functional biclusters of DNA microarray gene expression data
AU - Zhao, Hongya
AU - Huang, Qing-Hua
AU - Chan, Kwok Leung
AU - Cheng, Lee-Ming
AU - Yan, Hong
PY - 2008
Y1 - 2008
N2 - A subset of genes sharing compatible expression patterns under a subset of conditions can be found from DNA microarray data using biclustering algorithms. In this paper, we present a novel geometrical biclustering algorithm in combination with gene ontology annotations to identify the gene functional biclusters. Unlike many existing biclustering algorithms, we first consider the biclustering patterns through geometrical interpretation. Such a perspective makes it possible to unify the formulation of different types of biclusters as hyperplanes in spatial space and facilitates the use of a generic plane finding algorithm for bicluster detection. In our bottom-up biclustering algorithm, the well-known Hough transform is first employed in pair-column spaces to reduce the computation complexity and then the resulting patterns are merged step by step into large-size biclusters incorporated with gene functional modules. The algorithm integrates the numerical characteristics in a gene expression matrix and the gene functions in the biological activities. Our experiments on real data show that the new algorithm outperforms most existing methods for mining gene functional biclusters. © 2008 IEEE.
AB - A subset of genes sharing compatible expression patterns under a subset of conditions can be found from DNA microarray data using biclustering algorithms. In this paper, we present a novel geometrical biclustering algorithm in combination with gene ontology annotations to identify the gene functional biclusters. Unlike many existing biclustering algorithms, we first consider the biclustering patterns through geometrical interpretation. Such a perspective makes it possible to unify the formulation of different types of biclusters as hyperplanes in spatial space and facilitates the use of a generic plane finding algorithm for bicluster detection. In our bottom-up biclustering algorithm, the well-known Hough transform is first employed in pair-column spaces to reduce the computation complexity and then the resulting patterns are merged step by step into large-size biclusters incorporated with gene functional modules. The algorithm integrates the numerical characteristics in a gene expression matrix and the gene functions in the biological activities. Our experiments on real data show that the new algorithm outperforms most existing methods for mining gene functional biclusters. © 2008 IEEE.
KW - Biclustering
KW - Gene functional module
KW - Gene ontology (GO)
KW - Hough transform
KW - Pair-column space
UR - http://www.scopus.com/inward/record.url?scp=69949161599&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-69949161599&origin=recordpage
U2 - 10.1109/ICSMC.2008.4811539
DO - 10.1109/ICSMC.2008.4811539
M3 - RGC 22 - Publication in policy or professional journal
SN - 1062-922X
SP - 1737
EP - 1742
JO - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
JF - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
M1 - 4811539
T2 - 2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008
Y2 - 12 October 2008 through 15 October 2008
ER -