A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood
KAUST Grant NumberKUS-CI-016-04
Permanent link to this recordhttp://hdl.handle.net/10754/597220
MetadataShow full item record
AbstractWe propose a new biclustering method for binary data matrices using the maximum penalized Bernoulli likelihood estimation. Our method applies a multi-layer model defined on the logits of the success probabilities, where each layer represents a simple bicluster structure and the combination of multiple layers is able to reveal complicated, multiple biclusters. The method allows for non-pure biclusters, and can simultaneously identify the 1-prevalent blocks and 0-prevalent blocks. A computationally efficient algorithm is developed and guidelines are provided for specifying the tuning parameters, including initial values of model parameters, the number of layers, and the penalty parameters. Missing-data imputation can be handled in the EM framework. The method is tested using synthetic and real datasets and shows good performance. © 2013 Springer Science+Business Media New York.
CitationLee S, Huang JZ (2013) A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood. Stat Comput 24: 429–441. Available: http://dx.doi.org/10.1007/s11222-013-9379-3.
SponsorsThe authors would like to thank the editor, the associate editor, and two reviewers for helpful comments. Dr. Lan Zhou carefully read the paper and gave many useful suggestions for improving the writing. Lee’s work was supported by Basic Science Research Program through the National Research Foundation (NRF) of Korea (2011-0011608). Huang’s work was partially supported by NCI (CA57030), NSF (DMS-0907170, DMS-1007618, DMS-1208952), and King Abdullah University of Science and Technology (KUS-CI-016-04).
JournalStatistics and Computing