قارن الطرق
راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.
| اكتشاف المجتمعات الديناميكي× | نموذج الكتل العشوائية (Stochastic Block Model× | |
|---|---|---|
| المجال | تحليل الشبكات | تحليل الشبكات |
| العائلة≠ | Machine learning | Process / pipeline |
| سنة النشأة≠ | 2010 (key formalization); earlier work 2002–2009 | 1983 |
| صاحب الطريقة≠ | Mucha, P. J. et al. (key formalization); earlier work by Girvan & Newman (2002) | — |
| النوع≠ | Graph clustering / community discovery | Probabilistic generative graph model |
| المصدر التأسيسي≠ | Mucha, 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 ↗ |
| الأسماء البديلة | DCD, temporal community detection, evolving community detection, dynamic graph clustering | SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM) |
| ذات صلة≠ | 5 | 7 |
| الملخص≠ | Dynamic 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. |
| ScholarGateمجموعة البيانات ↗ |
|
|