Partition the vertices of a directed network with typed edges into clusters describing the connection patterns of subgraphs given as inputs.
The inference is performed using a variational Bayes EM algorithm and the estimation of the number of clusters is obtained through a variational approximation of the marginal log likelihood.
Arguments
Details
Package:
Rambo
Type:
Package
Version:
1.0
Date:
2013-06-18
License:
GPL (>=2.0)
References
Yacine Jernite, Pierre Latouche, Charles Bouveyron, Patrick Rivera, Laurent Jegou
and Stephane Lamasse(2012), The Random Subgraph Model for the Analysis of an Ecclesiastical Network in Merovingian Gaul, http://arxiv.org/abs/1212.5497