Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Χρονική Κεντρικότητα Βαθμού× | Κεντρικότητα Βαθμού× | |
|---|---|---|
| Πεδίο | Ανάλυση Δικτύων | Ανάλυση Δικτύων |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 2011–2012 | 1978 |
| Δημιουργός≠ | Holme, P.; Saramaki, J.; Kim, H.; Anderson, R. | Freeman, L. C. |
| Τύπος≠ | Centrality measure (temporal extension) | Node-level centrality measure |
| Θεμελιώδης πηγή≠ | Holme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| Εναλλακτικές ονομασίες | time-varying degree centrality, dynamic degree centrality, temporal node degree, TDC | node degree, degree score, DC, connectivity centrality |
| Συναφείς | 6 | 6 |
| Σύνοψη≠ | Temporal degree centrality extends the classic degree centrality to time-varying networks by counting how many distinct contacts a node accumulates over time. Rather than collapsing a dynamic network into a single static graph, it preserves the temporal order of edges, yielding a more faithful measure of a node's activity and reachability across the observation window. | 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Σύνολο δεδομένων ↗ |
|
|