Skip to content

Biclustering via Latent Block Model Adapted to Overdispersed Count Data

License

Notifications You must be signed in to change notification settings

julieaubert/cobiclust

Folders and files

NameName
Last commit message
Last commit date
Sep 4, 2020
Sep 4, 2020
Sep 5, 2020
Sep 5, 2020
Sep 5, 2020
Sep 4, 2020
Sep 4, 2020
Sep 4, 2020
Sep 5, 2020
Sep 4, 2020
Sep 5, 2020
Sep 4, 2020
Apr 17, 2020
Oct 9, 2017
Apr 17, 2020
Sep 4, 2020
Sep 4, 2020
Sep 5, 2020
Sep 5, 2020
Sep 5, 2020
Oct 9, 2017
Sep 4, 2020
Sep 5, 2020

Repository files navigation

cobiclust

Lifecycle: maturing R build status

The goal of cobiclust is to perform a biclustering of over-dispersed count data such as those produced by amplicon-based sequencing for example.

Installation

You can install the released version of cobiclust from CRAN with:

install.packages("cobiclust")

And the development version from GitHub with:

# install.packages("devtools")
devtools::install_github("julieaubert/cobiclust")

Example

This is a basic example which shows you how to perform a biclustering on simulated data:

library(cobiclust)
## basic example code
# npc <- c(50, 40) # nodes per class
# KG <- c(2, 3) # classes
# nm <- npc * KG # nodes
# Z <- diag( KG[1]) \%x\% matrix(1, npc[1], 1)
# W <- diag(KG[2]) \%x\% matrix(1, npc[2], 1)
# L <- 70 * matrix( runif( KG[1] * KG[2]), KG[1], KG[2])
# M_in_expectation <- Z \%*\% L \%*\% t(W)
# size <- 50
# M<-matrix(
#  rnbinom(
#    n = length(as.vector(M_in_expectation)),
#    mu = as.vector(M_in_expectation), size = size)
#  , nm[1], nm[2])
# rownames(M) <- paste("OTU", 1:nrow(M), sep = "_")
# colnames(M) <- paste("S", 1:ncol(M), sep = "_")
# res <- cobiclust(M, K = 2, G = 3, nu_j = rep(1,120), a = 1/size, cvg_lim = 1e-5)

About

Biclustering via Latent Block Model Adapted to Overdispersed Count Data

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages