Clustering in networks with the collapsed Stochastic Block Model

Details Clustering in networks with the collapsed Stochastic Block Model Clustering in networks with the collapsed Stochastic Block Model

2012-03-14

arxiv.org/abs/1203.3083v2

Statistics

Computation

Scientific paper

We present an efficient MCMC algorithm to cluster the nodes of a network such that nodes with similar role in the network are clustered together. This is known as block-modelling or block-clustering. We extend the stochastic blockmodel (SBM) of Nowicki & Snijders (2001), by exploiting parameter collapsing to integrate out block parameters. The resulting model defines a posterior over the number of clusters and cluster memberships. Sampling from this model is simpler than from the original SBM as transdimensional MCMC can be avoided. Moreover, our extensions allow the number of clusters to be directly estimated, rather than given as an input parameter. The algorithm is based on the allocation sampler of Nobile & Fearnside (2007). We use synthetic and real data to test the speed and accuracy of our model and algorithm, including the ability to estimate the number of clusters. The algorithm can scale to networks with up to ten thousand nodes.

Affiliated with

Also associated with

No associations

Rating

Clustering in networks with the collapsed Stochastic Block Model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering in networks with the collapsed Stochastic Block Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering in networks with the collapsed Stochastic Block Model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-715752