Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Sentraliti Keserantaraan Terarah× | Ketuaan Antara Pusat× | |
|---|---|---|
| Bidang | Analisis Rangkaian | Analisis Rangkaian |
| Keluarga | Machine learning | Machine learning |
| Tahun asal | 1977 | 1977 |
| Pengasas | Freeman, L. C. | Freeman, L. C. |
| Jenis≠ | Centrality measure (directed graph) | Centrality measure |
| Sumber perintis | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| Alias | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness |
| Berkaitan≠ | 5 | 6 |
| Ringkasan≠ | 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. | 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. |
| ScholarGateSet data ↗ |
|
|