Biclustering is a statistical learning technique that simultaneously partitions and clusters rows and columns of a data matrix. Since biclustering is said to be NP-hard, 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.
|Author||John Reisner, Hieu Pham, Jing Li|
|Maintainer||John Reisner <[email protected]>|
|License||MIT + file LICENSE|
|Package repository||View on GitHub|
Install the latest version of this package by entering the following in R:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.