Biclustering with Missing Data

Biclustering is a statistical learning technique that simultaneously partitions and clusters rows and columns of a data matrix. Since the solution space of biclustering is in infeasible to completely search with current computational mechanisms, this package uses a greedy heuristic. The algorithm featured in this package is, to the best our knowledge, the first biclustering algorithm to work on data with missing values. Li, J., Reisner, J., Pham, H., Olafsson, S., and Vardeman, S. (2019) Biclustering for Missing Data. Information Sciences, Submitted.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.1.0 by John Reisner, 20 days ago

Report a bug at

Browse source code at

Authors: John Reisner [cre, aut, cph] , Hieu Pham [ctb, cph] , Jing Li [ctb, cph]

Documentation:   PDF Manual  

MIT + file LICENSE license

Imports biclust, clues, doParallel, dplyr, foreach, magrittr, nycflights13

Depends on ggplot2, tidyr

Suggests knitr, rmarkdown, testthat

See at CRAN