방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이지안 커뮤니티 탐지× | 시간적 커뮤니티 탐지× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2001–2014 | 2010 |
| 창시자≠ | Nowicki, K. & Snijders, T. A. B. (formal Bayesian framing); extended by Peixoto, T. P. | Mucha, P. J. et al. |
| 유형≠ | Probabilistic generative model / inference | Network clustering algorithm |
| 원전≠ | Peixoto, T. P. (2014). Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Physical Review E, 89(1), 012804. DOI ↗ | 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 ↗ |
| 별칭 | Bayesian graph clustering, probabilistic community detection, Bayesian stochastic block model community detection, Bayesian network partitioning | dynamic community detection, time-varying community detection, evolutionary community detection, longitudinal community detection |
| 관련≠ | 5 | 6 |
| 요약≠ | 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. | Temporal community detection identifies cohesive groups (communities) in networks whose structure changes over time. By treating each time snapshot as a network layer and coupling consecutive layers, it reveals how communities form, merge, split, grow, or dissolve — turning a sequence of static snapshots into a continuous narrative of group evolution. |
| ScholarGate데이터셋 ↗ |
|
|