방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 가중 다중망 분석× | 가중치 커뮤니티 탐지× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2014 | 2004–2008 |
| 창시자≠ | Battiston, F.; Kivela, M. et al. | Newman, M. E. J.; Blondel et al. |
| 유형≠ | Network analysis framework | Graph clustering / community detection |
| 원전≠ | Battiston, F., Nicosia, V., & Latora, V. (2014). Structural measures for multiplex networks. Physical Review E, 89(3), 032804. 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 ↗ |
| 별칭 | WMNA, weighted multilayer network analysis, weighted multi-relational network analysis, multiplex weighted graph analysis | weighted graph clustering, community detection on weighted networks, weighted modularity optimization, WCD |
| 관련≠ | 5 | 6 |
| 요약≠ | Weighted multiplex network analysis studies systems in which the same set of actors are connected through multiple types of relationships simultaneously, and each relationship carries a quantitative strength or frequency. By capturing both the variety and the intensity of ties across layers, it reveals patterns invisible to single-layer or unweighted network approaches. | 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. |
| ScholarGate데이터셋 ↗ |
|
|