ScholarGate
Assistent

Methoden vergleichen

Prüfen Sie die ausgewählten Methoden nebeneinander; abweichende Zeilen sind hervorgehoben.

Dynamische Community-Erkennung×Stochastic Block Model×
FachgebietNetzwerkanalyseNetzwerkanalyse
FamilieMachine learningProcess / pipeline
Entstehungsjahr2010 (key formalization); earlier work 2002–20091983
UrheberMucha, P. J. et al. (key formalization); earlier work by Girvan & Newman (2002)
TypGraph clustering / community discoveryProbabilistic generative graph model
Wegweisende QuelleMucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010). Community structure in time-dependent, multiscale, and multiplex networks. Science, 328(5980), 876–878. DOI ↗Holland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137. DOI ↗
AliasnamenDCD, temporal community detection, evolving community detection, dynamic graph clusteringSBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)
Verwandt57
ZusammenfassungDynamic community detection identifies groups of densely connected nodes in networks that evolve over time, tracking how communities form, merge, split, and dissolve across temporal snapshots. Developed to extend static modularity optimization to time-varying structures, it is widely used in social, biological, and communication network research.The Stochastic Block Model (SBM), introduced by Holland, Laskey and Leinhardt (1983), is a probabilistic generative model for graphs that assigns nodes to latent blocks and parametrically estimates the connection probabilities between blocks. It is the foundational approach for community detection, core-periphery identification, and hierarchical structure discovery in network analysis.
ScholarGateDatensatz
  1. v1
  2. 2 Quellen
  3. PUBLISHED
  1. v1
  2. 2 Quellen
  3. PUBLISHED

Zur Suche Folien herunterladen

ScholarGateMethoden vergleichen: Dynamic Community Detection · Stochastic Block Model. Abgerufen am 2026-06-17 von https://scholargate.app/de/compare