विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| टेम्पोरल बिटवीननेस सेंट्रैलिटी (Temporal Betweenness Centrality)× | निर्देशित मध्यस्थता केंद्रीयता× | |
|---|---|---|
| क्षेत्र | नेटवर्क विश्लेषण | नेटवर्क विश्लेषण |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2012 | 1977 |
| प्रवर्तक≠ | Kim, H. & Anderson, R.; Holme, P. & Saramäki, J. | Freeman, L. C. |
| प्रकार≠ | Centrality measure for temporal networks | Centrality measure (directed graph) |
| मौलिक स्रोत≠ | 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 betweenness | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness |
| संबंधित≠ | 6 | 5 |
| सारांश≠ | 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. | Directed Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies. |
| ScholarGateडेटासेट ↗ |
|
|