Skip to main content
Erschienen in: Advances in Data Analysis and Classification 1/2023

27.02.2022 | Regular Article

Poisson degree corrected dynamic stochastic block model

verfasst von: Paul Riverain, Simon Fossier, Mohamed Nadif

Erschienen in: Advances in Data Analysis and Classification | Ausgabe 1/2023

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Stochastic Block Model (SBM) provides a statistical tool for modeling and clustering network data. In this paper, we propose an extension of this model for discrete-time dynamic networks that takes into account the variability in node degrees, allowing us to model a broader class of networks. We develop a probabilistic model that generates temporal graphs with a dynamic cluster structure and time-dependent degree corrections for each node. Thanks to these degree corrections, the nodes can have variable in- and out-degrees, allowing us to model complex cluster structures as well as interactions that decrease or increase over time. We compare the proposed model to a model without degree correction and highlight its advantages in the case of inhomogenous degree distributions in the clusters and in the recovery of unstable cluster dynamics. We propose an inference procedure based on Variational Expectation-Maximization (VEM) that also provides the means to estimate the time-dependent degree corrections. Extensive experiments on simulated and real datasets confirm the benefits of our approach and show the effectiveness of the proposed algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Fußnoten
1
We could not compare pdc-dsbm directly to the authors’ algorithm because their R package dynsbm V0.7 only implements Bernoulli, Multinomial and Gaussian distributions, so we had to re-implement it for Poisson distributions.
 
2
More noise needs to be added for \(M_+\) since margins greater than one spread the classes apart.
 
Literatur
Zurück zum Zitat Abbe E (2017) Community detection and stochastic block models: recent developments. J Mach Learn Res 18(1):6446–6531MathSciNet Abbe E (2017) Community detection and stochastic block models: recent developments. J Mach Learn Res 18(1):6446–6531MathSciNet
Zurück zum Zitat Ailem M, Role F, Nadif M (2017) Model-based co-clustering for the effective handling of sparse data. Pattern Recognit 72:108–122CrossRef Ailem M, Role F, Nadif M (2017) Model-based co-clustering for the effective handling of sparse data. Pattern Recognit 72:108–122CrossRef
Zurück zum Zitat Ailem M, Role F, Nadif M (2017) Sparse poisson latent block model for document clustering. IEEE Trans Knowl Data Eng 29(7):1563–1576CrossRef Ailem M, Role F, Nadif M (2017) Sparse poisson latent block model for document clustering. IEEE Trans Knowl Data Eng 29(7):1563–1576CrossRef
Zurück zum Zitat Airoldi E, Blei D, Fienberg S, Xing E (2008) Mixed membership stochastic blockmodels. J Mach Learn Res 9:1981–2014MATH Airoldi E, Blei D, Fienberg S, Xing E (2008) Mixed membership stochastic blockmodels. J Mach Learn Res 9:1981–2014MATH
Zurück zum Zitat Banerjee A, Dhillon I, Ghosh J, Merugu S, Modha DS (2007) A generalized maximum entropy approach to bregman co-clustering and matrix approximation. J Mach Learn Res 8(67):1919–1986MathSciNetMATH Banerjee A, Dhillon I, Ghosh J, Merugu S, Modha DS (2007) A generalized maximum entropy approach to bregman co-clustering and matrix approximation. J Mach Learn Res 8(67):1919–1986MathSciNetMATH
Zurück zum Zitat Bartolucci F, Pandolfi S (2020) An exact algorithm for time-dependent variational inference for the dynamic stochastic block model. Pattern Recognit Lett 138:362–369CrossRef Bartolucci F, Pandolfi S (2020) An exact algorithm for time-dependent variational inference for the dynamic stochastic block model. Pattern Recognit Lett 138:362–369CrossRef
Zurück zum Zitat Benzecri J-P (1973) L’analyse des données, tome 2: l’analyse des correspondances. Dunod, ParisMATH Benzecri J-P (1973) L’analyse des données, tome 2: l’analyse des correspondances. Dunod, ParisMATH
Zurück zum Zitat Biernacki C, Celeux G, Govaert G (2000) Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Trans Pattern Anal Mach Intell 22(7):719–725CrossRef Biernacki C, Celeux G, Govaert G (2000) Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Trans Pattern Anal Mach Intell 22(7):719–725CrossRef
Zurück zum Zitat Bock H-H (2020) Co-clustering for object by variable data matrices. In: Imaizumi T, Nakayama A, Yokoyama S (eds) Advanced studies in behaviormetrics and data science: essays in Honor of Akinori Okada. Springer Singapore, Singapore, pp 3–17CrossRef Bock H-H (2020) Co-clustering for object by variable data matrices. In: Imaizumi T, Nakayama A, Yokoyama S (eds) Advanced studies in behaviormetrics and data science: essays in Honor of Akinori Okada. Springer Singapore, Singapore, pp 3–17CrossRef
Zurück zum Zitat Chi Y, Song X, Zhou D, Hino K, Tseng BL (2007) Evolutionary spectral clustering by incorporating temporal smoothness. In: KDD. Association for Computing Machinery, pp 153–162 Chi Y, Song X, Zhou D, Hino K, Tseng BL (2007) Evolutionary spectral clustering by incorporating temporal smoothness. In: KDD. Association for Computing Machinery, pp 153–162
Zurück zum Zitat 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–91CrossRef 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–91CrossRef
Zurück zum Zitat Corneli M, Latouche P, Rossi F (2018) Multiple change points detection and clustering in dynamic networks. Stat Comput 28(5):989–1007MathSciNetCrossRefMATH Corneli M, Latouche P, Rossi F (2018) Multiple change points detection and clustering in dynamic networks. Stat Comput 28(5):989–1007MathSciNetCrossRefMATH
Zurück zum Zitat Fu W, Song L, Xing EP (2009) Dynamic mixed membership blockmodel for evolving networks. In: ICML, pp 329–336 Fu W, Song L, Xing EP (2009) Dynamic mixed membership blockmodel for evolving networks. In: ICML, pp 329–336
Zurück zum Zitat Ghahramani Z, Jordan MI (1997) Factorial hidden Markov models. Mach Learn 29(2–3):245–273CrossRefMATH Ghahramani Z, Jordan MI (1997) Factorial hidden Markov models. Mach Learn 29(2–3):245–273CrossRefMATH
Zurück zum Zitat Govaert G, Nadif M (2005) An EM algorithm for the block mixture model. IEEE Trans Pattern Anal Mach Intell 27(4) Govaert G, Nadif M (2005) An EM algorithm for the block mixture model. IEEE Trans Pattern Anal Mach Intell 27(4)
Zurück zum Zitat Govaert G, Nadif M (2013) Co-clustering: models, algorithms and applications. Wiley, HobokenCrossRefMATH Govaert G, Nadif M (2013) Co-clustering: models, algorithms and applications. Wiley, HobokenCrossRefMATH
Zurück zum Zitat Govaert G, Nadif M (2018) Mutual information, phi-squared and model-based co-clustering for contingency tables. Adv Data Anal Classif 12(3):455–488MathSciNetCrossRefMATH Govaert G, Nadif M (2018) Mutual information, phi-squared and model-based co-clustering for contingency tables. Adv Data Anal Classif 12(3):455–488MathSciNetCrossRefMATH
Zurück zum Zitat Greenacre M (2007) Correspondence analysis in practice. Chapman & Hall/CRC, Boca RatonCrossRefMATH Greenacre M (2007) Correspondence analysis in practice. Chapman & Hall/CRC, Boca RatonCrossRefMATH
Zurück zum Zitat Hubert L, Arabie P (1985) Comparing partitions. J Classif Hubert L, Arabie P (1985) Comparing partitions. J Classif
Zurück zum Zitat Karrer B, Newman ME (2011) Stochastic blockmodels and community structure in networks. Phys Rev E Stat Nonlinear Soft Matter Phys 83(1) Karrer B, Newman ME (2011) Stochastic blockmodels and community structure in networks. Phys Rev E Stat Nonlinear Soft Matter Phys 83(1)
Zurück zum Zitat Lin Y-R, Chi Y, Zhu S, Sundaram H, Tseng BL (2009) Analyzing communities and their evolutions in dynamic social networks. ACM Trans Knowl Discovery Data 3(2):1–31CrossRef Lin Y-R, Chi Y, Zhu S, Sundaram H, Tseng BL (2009) Analyzing communities and their evolutions in dynamic social networks. ACM Trans Knowl Discovery Data 3(2):1–31CrossRef
Zurück zum Zitat Liu S, Wang S, Krishnan R (2014) Persistent community detection in dynamic social networks. In: Tseng VS, Ho TB, Zhou Z-H, Chen ALP, Kao H-Y (eds) Advances in knowledge discovery and data mining. Springer, Berlin, pp 78–89CrossRef Liu S, Wang S, Krishnan R (2014) Persistent community detection in dynamic social networks. In: Tseng VS, Ho TB, Zhou Z-H, Chen ALP, Kao H-Y (eds) Advances in knowledge discovery and data mining. Springer, Berlin, pp 78–89CrossRef
Zurück zum Zitat Mariadassou M, Robin S, Vacher C (2010) Uncovering latent structure in valued graphs: a variational approach. Ann Appl Stat 4(2):715–742MathSciNetCrossRefMATH Mariadassou M, Robin S, Vacher C (2010) Uncovering latent structure in valued graphs: a variational approach. Ann Appl Stat 4(2):715–742MathSciNetCrossRefMATH
Zurück zum Zitat Matias C, Miele V (2017) Statistical clustering of temporal networks through a dynamic stochastic block model. J R Stat Soc Ser B Stat Methodol 79(4):1119–1141MathSciNetCrossRefMATH Matias C, Miele V (2017) Statistical clustering of temporal networks through a dynamic stochastic block model. J R Stat Soc Ser B Stat Methodol 79(4):1119–1141MathSciNetCrossRefMATH
Zurück zum Zitat Matias C, Rebafka T, Villers F (2018) A semiparametric extension of the stochastic block model for longitudinal networks. Biometrika 105(3):665–680MathSciNetCrossRefMATH Matias C, Rebafka T, Villers F (2018) A semiparametric extension of the stochastic block model for longitudinal networks. Biometrika 105(3):665–680MathSciNetCrossRefMATH
Zurück zum Zitat Meng X-L, Rubin DB (1993) Maximum likelihood estimation via the ECM algorithm: a general framework. Biometrika 80(2):267–278MathSciNetCrossRefMATH Meng X-L, Rubin DB (1993) Maximum likelihood estimation via the ECM algorithm: a general framework. Biometrika 80(2):267–278MathSciNetCrossRefMATH
Zurück zum Zitat Neal RM, Hinton GE (1998) A view of the EM algorithm that justifies incremental, sparse, and other variants. Learning in graphical models. Springer, Berlin, pp 355–368CrossRef Neal RM, Hinton GE (1998) A view of the EM algorithm that justifies incremental, sparse, and other variants. Learning in graphical models. Springer, Berlin, pp 355–368CrossRef
Zurück zum Zitat Qiao M, Yu J, Bian W, Li Q, Tao D (2017) Improving stochastic block models by incorporating power-law degree characteristic. In: IJCAI international joint conference on artificial intelligence, pp 2620–2626 Qiao M, Yu J, Bian W, Li Q, Tao D (2017) Improving stochastic block models by incorporating power-law degree characteristic. In: IJCAI international joint conference on artificial intelligence, pp 2620–2626
Zurück zum Zitat Rastelli R, Latouche P, Friel N (2018) Choosing the number of groups in a latent stochastic blockmodel for dynamic networks. Netw Sci 6(4):469–493CrossRef Rastelli R, Latouche P, Friel N (2018) Choosing the number of groups in a latent stochastic blockmodel for dynamic networks. Netw Sci 6(4):469–493CrossRef
Zurück zum Zitat Razaee Z, Amini A, Li JJ (2019) Matched bipartite block model with covariates. J Mach Learn Res 20:1–44MathSciNetMATH Razaee Z, Amini A, Li JJ (2019) Matched bipartite block model with covariates. J Mach Learn Res 20:1–44MathSciNetMATH
Zurück zum Zitat Sewell DK, Chen Y (2016) Latent space models for dynamic networks with weighted edges. Soc Netw 44:105–116CrossRef Sewell DK, Chen Y (2016) Latent space models for dynamic networks with weighted edges. Soc Netw 44:105–116CrossRef
Zurück zum Zitat Snijders T, Nowicki K (1997) Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J Classif 14:75–100MathSciNetCrossRefMATH Snijders T, Nowicki K (1997) Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J Classif 14:75–100MathSciNetCrossRefMATH
Zurück zum Zitat Xu KS, Hero AO (2014) Dynamic stochastic blockmodels for time-evolving social networks. IEEE J Sel Top Signal Process 8(4):552–562CrossRef Xu KS, Hero AO (2014) Dynamic stochastic blockmodels for time-evolving social networks. IEEE J Sel Top Signal Process 8(4):552–562CrossRef
Zurück zum Zitat Yang T, Chi Y, Zhu S, Gong Y, Jin R (2011) Detecting communities and their evolutions in dynamic social networks—a Bayesian approach. Mach Learn 82(2):157–189MathSciNetCrossRefMATH Yang T, Chi Y, Zhu S, Gong Y, Jin R (2011) Detecting communities and their evolutions in dynamic social networks—a Bayesian approach. Mach Learn 82(2):157–189MathSciNetCrossRefMATH
Metadaten
Titel
Poisson degree corrected dynamic stochastic block model
verfasst von
Paul Riverain
Simon Fossier
Mohamed Nadif
Publikationsdatum
27.02.2022
Verlag
Springer Berlin Heidelberg
Erschienen in
Advances in Data Analysis and Classification / Ausgabe 1/2023
Print ISSN: 1862-5347
Elektronische ISSN: 1862-5355
DOI
https://doi.org/10.1007/s11634-022-00492-9

Weitere Artikel der Ausgabe 1/2023

Advances in Data Analysis and Classification 1/2023 Zur Ausgabe

Premium Partner