Nothing
GreedySBTM: Greedy Stochastic Block Transition Models
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>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Riccardo Rastelli [aut, cre] |
| Maintainer | Riccardo Rastelli <riccardo.rastelli@wu.ac.at> |
| License | GPL-3 |
| Version | 1.0 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the GreedySBTM package in your browser
Any scripts or data that you put into this service are public.
