ScholarGate
Βοηθός

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

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

Χρονική Ενδιάμεση Κεντρικότητα×Μετακεντρικότητα×
ΠεδίοΑνάλυση ΔικτύωνΑνάλυση Δικτύων
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης20121977
ΔημιουργόςKim, H. & Anderson, R.; Holme, P. & Saramäki, J.Freeman, L. C.
ΤύποςCentrality measure for temporal networksCentrality measure
Θεμελιώδης πηγήHolme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519(3), 97–125. DOI ↗Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗
Εναλλακτικές ονομασίεςTBC, time-varying betweenness centrality, dynamic betweenness centrality, time-respecting betweennessFreeman betweenness, BC, geodesic betweenness, shortest-path betweenness
Συναφείς66
ΣύνοψηTemporal Betweenness Centrality (TBC) extends classical betweenness centrality to time-stamped networks by counting how often a node lies on time-respecting shortest paths — paths that traverse edges in chronological order. It identifies nodes that act as temporal brokers, controlling information or resource flow as it evolves over time, rather than in a static snapshot.Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

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

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