GreedySBTM (1.0)

0 users

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" .

Maintainer: Riccardo Rastelli
Author(s): Riccardo Rastelli [aut, cre]

License: GPL-3

Uses: Rcpp

Released almost 2 years ago.



  (0 votes)


  (0 votes)

Log in to vote.


No one has written a review of GreedySBTM yet. Want to be the first? Write one now.

Related packages:(20 best matches, based on common tags.)

Search for GreedySBTM on google, google scholar, r-help, r-devel.

Visit GreedySBTM on R Graphical Manual.