Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| Bayesiläinen yhteisöntunnistus× | Stochastic Block Model× | |
|---|---|---|
| Tieteenala | Verkostoanalyysi | Verkostoanalyysi |
| Menetelmäperhe≠ | Machine learning | Process / pipeline |
| Syntyvuosi≠ | 2001–2014 | 1983 |
| Kehittäjä≠ | Nowicki, K. & Snijders, T. A. B. (formal Bayesian framing); extended by Peixoto, T. P. | — |
| Tyyppi≠ | Probabilistic generative model / inference | Probabilistic generative graph model |
| Alkuperäislähde≠ | Peixoto, T. P. (2014). Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Physical Review E, 89(1), 012804. DOI ↗ | Holland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137. DOI ↗ |
| Rinnakkaisnimet | Bayesian graph clustering, probabilistic community detection, Bayesian stochastic block model community detection, Bayesian network partitioning | SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM) |
| Liittyvät≠ | 5 | 7 |
| Tiivistelmä≠ | Bayesian community detection infers latent group structure in networks by treating community membership as unobserved variables and using Bayesian inference — typically via Markov chain Monte Carlo or variational methods — to compute a posterior distribution over all plausible partitions. Unlike modularity optimisation, it selects the number of communities from data and provides principled uncertainty estimates for every node assignment. | 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. |
| ScholarGateAineisto ↗ |
|
|