방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 가중 모듈성 분석× | 가중치 사회 연결망 분석 (Weighted Social Network Analysis)× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2004 | 2004–2010 |
| 창시자≠ | Newman, M. E. J. | Barrat, A.; Opsahl, T. et al. |
| 유형≠ | Community structure optimization on weighted graphs | Network analysis framework |
| 원전≠ | Newman, M. E. J. (2004). Analysis of weighted networks. Physical Review E, 70(5), 056131. DOI ↗ | Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. DOI ↗ |
| 별칭 | weighted modularity, weighted Q optimization, weighted network community detection, strength-based modularity | Weighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysis |
| 관련≠ | 5 | 6 |
| 요약≠ | Weighted modularity analysis extends the classical Newman-Girvan modularity measure to networks where edges carry numeric strengths (frequencies, intensities, costs). By replacing binary adjacency with tie weights, it finds community partitions that reflect how densely interconnected subgroups are relative to what is expected under a weighted null model, yielding more nuanced groupings than unweighted approaches on data where edge strength varies meaningfully. | Weighted Social Network Analysis extends classical SNA by assigning numeric values — weights — to ties between actors, capturing tie strength, interaction frequency, or resource flow. Rather than treating all connections as equal, it reveals who holds privileged positions by virtue of the intensity, not merely the existence, of their relationships. |
| ScholarGate데이터셋 ↗ |
|
|