方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 多层社区检测× | 社群检测× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族≠ | Machine learning | Process / pipeline |
| 起源年份≠ | 2010–2014 | 2002–2019 (algorithm family) |
| 提出者≠ | Mucha, P. J. et al.; Kivela, M. et al. | Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008) |
| 类型≠ | Community detection algorithm for multilayer networks | Graph-partitioning / clustering algorithm family |
| 开创性文献≠ | Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014). Multilayer networks. Journal of Complex Networks, 2(3), 203–271. DOI ↗ | Blondel, V.D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. (2008). Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics, 2008(10), P10008. DOI ↗ |
| 别名≠ | multilayer clustering, multiplex community detection, cross-layer community detection, MCD | graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden) |
| 相关 | 5 | 5 |
| 摘要≠ | Multilayer community detection identifies groups of nodes that are densely connected across multiple types of relationships simultaneously. By coupling layers of a network — such as friendship, advice, and collaboration ties — it finds communities that are coherent not just within one relation type but across all of them, revealing structure that single-layer analysis would miss. | Community detection is a family of graph-partitioning algorithms that discover densely connected sub-groups — communities — within a network. First formalised through the modularity measure by Girvan and Newman (2002), the field advanced rapidly with the Louvain method (Blondel et al., 2008), the Leiden refinement (Traag et al., 2019), and the information-theoretic Infomap approach. All variants answer the same question: which nodes cluster together more tightly among themselves than with the rest of the network? |
| ScholarGate数据集 ↗ |
|
|