Performs clustering on the nodes of an undirected binary dynamic network, by maximising the exact integrated complete likelihood. The greedy algorithm used is described in Rastelli, R. (2017) "Exact integrated completed likelihood maximisation in a stochastic block transition model for dynamic networks" <arXiv:1710.03551>.
| Version: | 1.0 |
| Depends: | R (≥ 2.10) |
| Imports: | Rcpp (≥ 0.12.10) |
| LinkingTo: | Rcpp, RcppArmadillo |
| Published: | 2017-10-18 |
| Author: | Riccardo Rastelli [aut, cre] |
| Maintainer: | Riccardo Rastelli <riccardo.rastelli at wu.ac.at> |
| License: | GPL-3 |
| NeedsCompilation: | yes |
| CRAN checks: | GreedySBTM results |
| Reference manual: | GreedySBTM.pdf |
| Package source: | GreedySBTM_1.0.tar.gz |
| Windows binaries: | r-devel: GreedySBTM_1.0.zip, r-release: GreedySBTM_1.0.zip, r-oldrel: GreedySBTM_1.0.zip |
| macOS binaries: | r-release: GreedySBTM_1.0.tgz, r-oldrel: GreedySBTM_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=GreedySBTM to link to this page.