Marco Corneli
ABSTRACT
The stochastic block model (SBM) [1] describes interactions between nodes of a network following a probabilistic approach. Nodes belong to hidden clusters and the probabilities of interactions only depend on these clusters. Interactions of time varying intensity are not taken into account. By partitioning the whole time horizon, in which interactions are observed, we develop a non stationary extension of the SBM, allowing us to simultaneously cluster the nodes of a network and the fixed time intervals in which interactions take place. The number of clusters as well as memberships to clusters are finally obtained through the maximization of the complete-data integrated likelihood relying on a greedy search approach. Experiments are carried out in order to assess the proposed methodology.
- P. Holland, K. Laskey, and S. Leinhardt, "Stochastic blockmodels: first steps," Social Networks, vol. 5, pp. 109--137, 1983.Google Scholar
- C. Biernacki, G. Celeux, and G. Govaert, "Assessing a mixture model for clustering with the integrated completed likelihood," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 22, no. 7, pp. 719-- 725, 2000. Google ScholarDigital Library
- E. Côme and P. Latouche, "Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood," Statistical Modelling, 2015, to appear.Google Scholar
- L. Isella, J. Stehl, A. Barrat, C. Cattuto, J. Pinton, and W. Van den Broeck, "What's in a crowd? analysis of face-to-face behavioral networks," Journal of Theoretical Biology, vol. 271, no. 1, pp. 166--180, 2011.Google ScholarCross Ref
- Modelling time evolving interactions in networks through a non stationary extension of stochastic block models
Recommendations
Bipartite stochastic block models with tiny clusters
NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing SystemsWe study the problem of finding clusters in random bipartite graphs. We present a simple two-step algorithm which provably finds even tiny clusters of size O(nε), where n is the number of vertices in the graph and ε > 0. Previous algorithms were only ...
Block clustering with collapsed latent block models
We introduce a Bayesian extension of the latent block model for model-based block clustering of data matrices. Our approach considers a block model where block parameters may be integrated out. The result is a posterior defined over the number of ...
Improved Bayesian inference for the stochastic block model with application to large networks
An efficient MCMC algorithm is presented to cluster the nodes of a network such that nodes with similar role in the network are clustered together. This is known as block-modeling or block-clustering. The model is the stochastic blockmodel (SBM) with ...
Comments