So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Độ trung tâm gần (Closeness Centrality)× | Độ trung tâm bậc (Degree Centrality)× | |
|---|---|---|
| Lĩnh vực | Phân tích mạng lưới | Phân tích mạng lưới |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 1950 (formalized 1979) | 1978 |
| Người khởi xướng≠ | Bavelas, A.; formalized by Freeman, L. C. | Freeman, L. C. |
| Loại≠ | Node-level centrality index | Node-level centrality measure |
| Công trình gốc≠ | Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| Tên gọi khác | closeness, farness-based centrality, geodesic closeness, normalized closeness centrality | node degree, degree score, DC, connectivity centrality |
| Liên quan | 6 | 6 |
| Tóm tắt≠ | Closeness centrality measures how quickly a node can reach all others in a network by computing the inverse of its average shortest-path distance to every other node. First described by Bavelas (1950) and formally unified by Freeman (1979), it identifies nodes that can spread information or resources efficiently across the entire graph — not merely nodes with many direct contacts. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|