An ensemble of algorithms that enable the clustering of networks and data matrices (such as counts, categorical or continuous) with different type of generative models. Model selection and clustering is performed in combination by optimizing the Integrated Classification Likelihood (which is equivalent to minimizing the description length). Several models are available such as: Stochastic Block Model, degree corrected Stochastic Block Model, Mixtures of Multinomial, Latent Block Model. The optimization is performed thanks to a combination of greedy local search and a genetic algorithm (see <arXiv:2002:11577> for more details).
Package details |
|
---|---|
Author | Etienne Côme [aut, cre], Nicolas Jouvin [aut] |
Maintainer | Etienne Côme <etienne.come@univ-eiffel.fr> |
License | GPL |
Version | 0.6.1 |
URL | https://comeetie.github.io/greed/ https://github.com/comeetie/greed |
Package repository | View on CRAN |
Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.