Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Viktig stokastisk blockmodell× | Viktad gemenskapsdetektion× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2014 | 2004–2008 |
| Upphovsperson≠ | Aicher, C.; Jacobs, A. Z.; Clauset, A. | Newman, M. E. J.; Blondel et al. |
| Typ≠ | Generative probabilistic model | Graph clustering / community detection |
| Ursprungskälla≠ | Aicher, C., Jacobs, A. Z., & Clauset, A. (2014). Learning latent block structure in weighted networks. Journal of Complex Networks, 3(2), 221–248. DOI ↗ | Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10), P10008. DOI ↗ |
| Alias | W-SBM, weighted SBM, weighted block model, weighted community detection via SBM | weighted graph clustering, community detection on weighted networks, weighted modularity optimization, WCD |
| Närliggande | 6 | 6 |
| Sammanfattning≠ | The Weighted Stochastic Block Model (W-SBM) extends the classical stochastic block model to networks whose edges carry numerical weights. By positing that edge weights between node pairs arise from distributions that depend on the block memberships of those nodes, it simultaneously infers a partition of nodes into communities and a set of block-to-block weight parameters — recovering structure invisible to unweighted methods. | Weighted community detection identifies densely connected groups — communities — in networks where edges carry numeric strengths (weights). By incorporating edge weights into the modularity function, it reveals structure that binary adjacency alone would miss: two nodes connected by a strong tie are treated as more similar than two nodes linked by a weak one. The Louvain algorithm is the dominant practical implementation. |
| ScholarGateDatamängd ↗ |
|
|