Learn R Programming

GreedySBTM (version 1.0)

Greedy Stochastic Block Transition Models

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

Copy Link

Version

Install

install.packages('GreedySBTM')

Monthly Downloads

6

Version

1.0

License

GPL-3

Maintainer

Riccardo Rastelli

Last Published

October 18th, 2017

Functions in GreedySBTM (1.0)

CollapseLabels

CollapseLabels
GreedyICL

GreedyICL
SBTMProbs

SBTM parameter estimators
reality_mining_1392

Reality Mining dataset
GreedySBTM-package

GreedySBTM
ICLExact

ICLExact
GreedyInit

GreedyInit
GreedyMerge

GreedyMerge
reality_mining_84

Reality Mining small dataset