방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 가중 다중망 분석× | 가중치 고유벡터 중심성× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2014 | 1987 (binary); 2010 (weighted generalization) |
| 창시자≠ | Battiston, F.; Kivela, M. et al. | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) |
| 유형≠ | Network analysis framework | Spectral centrality measure |
| 원전≠ | Battiston, F., Nicosia, V., & Latora, V. (2014). Structural measures for multiplex networks. Physical Review E, 89(3), 032804. DOI ↗ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ |
| 별칭 | WMNA, weighted multilayer network analysis, weighted multi-relational network analysis, multiplex weighted graph analysis | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige |
| 관련≠ | 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 eigenvector centrality extends the classic eigenvector centrality measure to graphs where edges carry numerical weights, scoring each node proportionally to the sum of its neighbors' scores multiplied by the connecting edge weights. Nodes score highly not just by having many connections but by being strongly linked to other influential nodes, making the measure sensitive to both tie strength and network position simultaneously. |
| ScholarGate데이터셋 ↗ |
|
|