TY - JOUR
T1 - A probabilistic relaxation labeling framework for reducing the noise effect in geometric biclustering of gene expression data
AU - Zhao, Hongya
AU - Chan, Kwok Leung
AU - Cheng, Lee-Ming
AU - Yan, Hong
PY - 2009/11
Y1 - 2009/11
N2 - Biclustering is an important method in DNA microarray analysis which can be applied when only a subset of genes is co-expressed in a subset of conditions. Unlike standard clustering analyses, biclustering methodology can perform simultaneous classification on two dimensions of genes and conditions in a microarray data matrix. However, the performance of biclustering algorithms is affected by the inherent noise in data, types of biclusters and computational complexity. In this paper, we present a geometric biclustering method based on the Hough transform and the relaxation labeling technique. Unlike many existing biclustering algorithms, we first consider the biclustering patterns through geometric 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 algorithm, the Hough transform is employed for hyperplane detection in sub-spaces to reduce the computational complexity. Then sub-biclusters are combined into larger ones under the probabilistic relaxation labeling framework. Our simulation studies demonstrate the robustness of the algorithm against noise and outliers. In addition, our method is able to extract biologically meaningful biclusters from real microarray gene expression data. © 2009 Elsevier Ltd. All rights reserved.
AB - Biclustering is an important method in DNA microarray analysis which can be applied when only a subset of genes is co-expressed in a subset of conditions. Unlike standard clustering analyses, biclustering methodology can perform simultaneous classification on two dimensions of genes and conditions in a microarray data matrix. However, the performance of biclustering algorithms is affected by the inherent noise in data, types of biclusters and computational complexity. In this paper, we present a geometric biclustering method based on the Hough transform and the relaxation labeling technique. Unlike many existing biclustering algorithms, we first consider the biclustering patterns through geometric 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 algorithm, the Hough transform is employed for hyperplane detection in sub-spaces to reduce the computational complexity. Then sub-biclusters are combined into larger ones under the probabilistic relaxation labeling framework. Our simulation studies demonstrate the robustness of the algorithm against noise and outliers. In addition, our method is able to extract biologically meaningful biclusters from real microarray gene expression data. © 2009 Elsevier Ltd. All rights reserved.
KW - Biclustering
KW - Clustering
KW - Gene expression data analysis
KW - Hough transform
KW - Probabilistic relaxation labeling
UR - http://www.scopus.com/inward/record.url?scp=67649389394&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-67649389394&origin=recordpage
U2 - 10.1016/j.patcog.2009.03.016
DO - 10.1016/j.patcog.2009.03.016
M3 - RGC 21 - Publication in refereed journal
SN - 0031-3203
VL - 42
SP - 2578
EP - 2588
JO - Pattern Recognition
JF - Pattern Recognition
IS - 11
ER -