GreedySBTM-package: Greedy Stochastic Block Transition Models
In GreedySBTM: Greedy Stochastic Block Transition Models
Description
Author(s)
References
Description
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>.
Author(s)
Riccardo Rastelli
Mantainer: Riccardo Rastelli <riccardo.rastelli@wu.ac.at>
References
Rastelli, R. (2017) "Exact integrated completed likelihood maximisation in a stochastic block transition model for dynamic networks", https://arxiv.org/abs/1710.03551
GreedySBTM documentation built on May 2, 2019, 12:40 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Author(s) References
Description
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>.
Author(s)
Riccardo Rastelli
Mantainer: Riccardo Rastelli <riccardo.rastelli@wu.ac.at>
References
Rastelli, R. (2017) "Exact integrated completed likelihood maximisation in a stochastic block transition model for dynamic networks", https://arxiv.org/abs/1710.03551
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.