방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 다층 차수 중심성× | 중심성 척도× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2013–2014 | 1978 |
| 창시자≠ | Kivelä, M.; De Domenico, M. et al. | Freeman, L. C. |
| 유형≠ | Centrality measure for multilayer networks | Node-level centrality measure |
| 원전≠ | Kivelä, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014). Multilayer networks. Journal of Complex Networks, 2(3), 203–271. DOI ↗ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| 별칭 | multilayer degree, multiplex degree centrality, overlapping-layer degree centrality, MDC | node degree, degree score, DC, connectivity centrality |
| 관련 | 6 | 6 |
| 요약≠ | Multilayer degree centrality extends the classic degree centrality measure to networks composed of multiple layers — such as networks representing different types of social ties, communication channels, or relationship contexts simultaneously. It quantifies how many connections a node has across one or all layers, revealing nodes that are influential not just in a single context but across the entire multi-relational structure. | Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis. |
| ScholarGate데이터셋 ↗ |
|
|