방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 가중 근접 중심성× | 가중치 사회 연결망 분석 (Weighted Social Network Analysis)× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2010 | 2004–2010 |
| 창시자≠ | Opsahl, T.; Agneessens, F.; Skvoretz, J. | Barrat, A.; Opsahl, T. et al. |
| 유형≠ | Centrality measure (network analysis) | Network analysis framework |
| 원전≠ | Opsahl, T., Agneessens, F. & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. 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 closeness, generalized closeness centrality, WCC, distance-weighted closeness | Weighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysis |
| 관련 | 6 | 6 |
| 요약≠ | Weighted closeness centrality extends the classic closeness measure to networks where edges carry numerical weights — such as frequency, strength, or cost — by incorporating those weights into shortest-path distances. Nodes that can reach others quickly along strong or efficient connections receive higher scores, making it a richer indicator of information-spreading potential than its binary counterpart. | 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데이터셋 ↗ |
|
|