Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-05T04:00:52.075Z Has data issue: false hasContentIssue false
  • English
  • Français

Choosing the number of groups in a latent stochastic blockmodel for dynamic networks

Published online by Cambridge University Press:  15 November 2018

RICCARDO RASTELLI Open the ORCID record for RICCARDO RASTELLI [Opens in a new window] ,
PIERRE LATOUCHE  and
NIAL FRIEL
RICCARDO RASTELLI
Affiliation:
School of Mathematics and Statistics, University College Dublin, Dublin, Ireland (e-mail: [email protected])
PIERRE LATOUCHE
Affiliation:
Laboratoire MAP5, UMR CNRS 8145, Université Paris Descartes & Sorbonne Paris Cité, Paris, France (e-mail: [email protected])
NIAL FRIEL
Affiliation:
School of Mathematics and Statistics and Insight: Centre for Data Analytics, University College Dublin, Dublin, Ireland (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Latent stochastic blockmodels are flexible statistical models that are widely used in social network analysis. In recent years, efforts have been made to extend these models to temporal dynamic networks, whereby the connections between nodes are observed at a number of different times. In this paper, we propose a new Bayesian framework to characterize the construction of connections. We rely on a Markovian property to describe the evolution of nodes' cluster memberships over time. We recast the problem of clustering the nodes of the network into a model-based context, showing that the integrated completed likelihood can be evaluated analytically for a number of likelihood models. Then, we propose a scalable greedy algorithm to maximize this quantity, thereby estimating both the optimal partition and the ideal number of groups in a single inferential framework. Finally, we propose applications of our methodology to both real and artificial datasets.

Keywords

stochastic blockmodelsdynamic networksgreedy optimizationBayesian inferenceintegrated completed likelihood
Type
Research Article
Information
Network Science , Volume 6 , Issue 4 , December 2018 , pp. 469 - 493
Copyright
Copyright © Cambridge University Press 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Airoldi, E. M., Blei, D. M., Fienberg, S. E., & Xing, E. P. (2008). Mixed membership stochastic blockmodels. Journal of Machine Learning Research, 9 (Sep), 1981–2014.Google Scholar
Bertoletti, M., Friel, N., & Rastelli, R. (2015). Choosing the number of clusters in a finite mixture model using an exact integrated completed likelihood criterion. Metron, 73 (2), 177–199.Google Scholar
Besag, J. (1986). On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society. Series B (Methodological), 48 (3), 259–302.Google Scholar
Biernacki, C., Celeux, G., & Govaert, G. (2000). Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (7), 719–725.Google Scholar
Côme, E., & Latouche, P. (2015). Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood. Statistical Modelling, 15 (6), 564–589.Google Scholar
Corneli, M., Latouche, P., & Rossi, F. (2016). Exact ICL maximization in a non-stationary temporal extension of the stochastic block model for dynamic networks. Neurocomputing, 192, 81–91.Google Scholar
Corneli, M., Latouche, P., & Rossi, F. (2017). Multiple change points detection and clustering in dynamic network. In press.Google Scholar
Daudin, J. J., Picard, F., & Robin, S. (2008). A mixture model for random graphs. Statistics and Computing, 18 (2), 173–183.Google Scholar
Farajtabar, M., Wang, Y., Rodriguez, M. G., Li, S., Zha, H., & Song, L. (2015). Coevolve: A joint point process model for information diffusion and network co-evolution. In Advances in neural information processing systems. NIPS, pp. 1954–1962.Google Scholar
Friel, N., Rastelli, R., Wyse, J., & Raftery, A. E. (2016). Interlocking directorates in irish companies using a latent space model for bipartite networks. Proceedings of the National Academy of Sciences, 113 (24), 6629–6634.Google Scholar
Guigourès, R., Boullé, M., & Rossi, F. (2015). Discovering patterns in time-varying graphs: A triclustering approach. Advances in Data Analysis and Classification, 1–28. Retrieved from https://link.springer.com/article/10.1007/s11634-015-0218-6.Google Scholar
Ho, Q., Song, L., & Xing, E. P. (2011). Evolving cluster mixed-membership blockmodel for time-evolving networks. Proceedings of the International Conference on Artificial Intelligence and Statistics, 15, 342–350.Google Scholar
Hoff, P. D., Raftery, A. E., & Handcock, M. S. (2002). Latent space approaches to social network analysis. Journal of the American Statistical Association, 97 (460), 1090–1098.Google Scholar
Ishiguro, K., Iwata, T., Ueda, N., & Tenenbaum, J. B. (2010). Dynamic infinite relational model for time-varying relational data analysis. In Advances in neural information processing systems. NIPS, 919–927.Google Scholar
Kim, M., & Leskovec, J. (2013). Nonparametric multi-group membership model for dynamic networks. In Advances in neural information processing systems (25). NIPS, pp. 1385–1393.Google Scholar
Matias, C., & Miele, V. (2017). Statistical clustering of temporal networks through a dynamic stochastic block model. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 79 (4), 1119–1141.Google Scholar
Matias, C., Rebafka, T., & Villers, F. (2018). A semiparametric extension of the stochastic block model for longitudinal networks. Biometrika, 105 (3), 665–680.Google Scholar
McDaid, A. F., Murphy, T. B., Friel, N., & Hurley, N. J. (2013). Improved bayesian inference for the stochastic block model with application to large networks. Computational Statistics & Data Analysis, 60, 12–31.Google Scholar
Newman, M. E. J. (2004). Fast algorithm for detecting community structure in networks. Physical Review E, 69 (6), 066133.Google Scholar
Nobile, A., & Fearnside, A. T. (2007). Bayesian finite mixtures with an unknown number of components: the allocation sampler. Statistics and Computing, 17 (2), 147–162.Google Scholar
Nowicki, K., & Snijders, T. A. B. (2001). Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96 (455), 1077–1087.Google Scholar
Randriamanamihaga, A. N., Côme, E., Oukhellou, L., & Govaert, G. (2014). Clustering the velib dynamic origin/destination flows using a family of poisson mixture models. Neurocomputing, 141, 124–138.Google Scholar
Sarkar, P., & Moore, A. W. (2005). Dynamic social network analysis using latent space models. Sigkdd Explorations: Special Edition on Link Mining, 7, 31–40.Google Scholar
Strehl, A., & Ghosh, J. (2003). Cluster ensembles – A knowledge reuse framework for combining multiple partitions. The Journal of Machine Learning Research, 3 (Dec), 583–617.Google Scholar
Tran, L., Farajtabar, M., Song, L., & Zha, H. (2015). Netcodec: Community detection from individual activities. In Proceedings of the 2015 SIAM international conference on data mining. SIAM, pp. 91–99.Google Scholar
Transport for London. (2016). Retrieved from http://cycling.data.tfl.gov.uk/.Google Scholar
Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17 (4), 395–416.Google Scholar
Wang, Y. J., & Wong, G. Y. (1987). Stochastic blockmodels for directed graphs. Journal of the American Statistical Association, 82 (397), 8–19.Google Scholar
Wyse, J., Friel, N., & Latouche, P. (2017). Inferring structure in bipartite networks using the latent blockmodel and exact icl. Network Science, 5 (1), 45–69.Google Scholar
Xing, E. P., Fu, W., & Song, L. (2010). A state-space mixed membership blockmodel for dynamic network tomography. Annals of Applied Statistics, 4 (2), 535–566.Google Scholar
Xu, K. (2015). Stochastic block transition models for dynamic networks. In Artificial intelligence and statistics. AISTATS, pp. 1079–1087.Google Scholar
Xu, K. S., & Hero, A. O. (2014). Dynamic stochastic blockmodels for time-evolving social networks. IEEE Journal of Selected Topics in Signal Processing, 8 (4), 552–562.Google Scholar
Yang, T., Chi, Y., Zhu, S., Gong, Y., & Jin, R. (2011). Detecting communities and their evolutions in dynamic social networks – A Bayesian approach. Machine Learning, 82 (2), 157–189.Google Scholar
Zhou, K., Zha, H., & Song, L. (2013). Learning social infectivity in sparse low-rank networks using multi-dimensional hawkes processes. In Artificial intelligence and statistics. AISTATS, pp. 641–649.Google Scholar