ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Δυναμική Κεντρικότητα Βαθμού×Σταθμισμένη Κεντρικότητα Βαθμού×
ΠεδίοΑνάλυση ΔικτύωνΑνάλυση Δικτύων
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης20122004
ΔημιουργόςHolme, P. & Saramaki, J.; Kim, H. & Anderson, R.Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A.
ΤύποςCentrality measure (temporal extension)Centrality measure for weighted networks
Θεμελιώδης πηγήHolme, P. & Saramaki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. DOI ↗
Εναλλακτικές ονομασίεςtime-varying degree centrality, temporal degree centrality, evolving degree centrality, DDCnode strength, strength centrality, weighted node degree, WDC
Συναφείς56
ΣύνοψηDynamic degree centrality extends the classical degree centrality measure to networks that change over time. Rather than counting a node's connections in a single static snapshot, it tracks how many contacts each node maintains across successive time windows or contact events, producing a time-resolved importance profile for every actor in the network.Weighted degree centrality — also called node strength — extends the classic degree centrality measure to networks whose edges carry numeric weights. Instead of simply counting a node's connections, it sums the weights of all edges incident to that node, capturing both the volume and the intensity of a node's ties in a single, interpretable score.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Dynamic Degree Centrality · Weighted Degree Centrality. Ανακτήθηκε στις 2026-06-19 από https://scholargate.app/el/compare