Some Bayesian biclustering methods: Modeling and inference

Statistical Analysis and Data Mining

article

Abhishek Chakraborty¹  Stephen B. Vardeman² 

[1] Department of Mathematics, Statistics, and Computer Science, Lawrence University;Department of Statistics and Department of Industrial and Manufacturing Systems Engineering, Iowa State University

关键词: Bayesian analysis;    biclustering;    MCMC;    missing entries;    Rand index;   

DOI  :  10.1002/sam.11584

学科分类：社会科学、人文和艺术（综合）

来源: John Wiley & Sons, Inc.

【 摘 要 】

Standard one-way clustering methods form homogeneous groups in a set of objects. Biclustering (or, two-way clustering) methods simultaneously cluster rows and columns of a rectangular data array in such a way that responses are homogeneous for all row-cluster by column-cluster cells. We propose a Bayes methodology for biclustering and corresponding MCMC algorithms. Our method not only identifies homogeneous biclusters, but also provides posterior probabilities that particular instances or features are clustered together. We further extend our proposal to address the biclustering problem under the commonly occurring situation of incomplete datasets. In addition to identifying homogeneous sets of rows and sets of columns, as in the complete data scenario, our approach also generates plausible predictions for missing/unobserved entries in the rectangular data array. Performances of our methodology are illustrated through simulation studies and applications to real datasets.

【 授权许可】

Unknown