เปรียบเทียบวิธี
ดูวิธีที่เลือกเทียบกันแบบเคียงข้าง แถวที่ต่างกันจะถูกเน้นไว้
| Directed Betweenness Centrality× | ค่าความเป็นจุดศูนย์กลางระหว่างจุด (Betweenness Centrality)× | |
|---|---|---|
| สาขาวิชา | การวิเคราะห์เครือข่าย | การวิเคราะห์เครือข่าย |
| ตระกูล | Machine learning | Machine learning |
| ปีกำเนิด | 1977 | 1977 |
| ผู้ริเริ่ม | Freeman, L. C. | Freeman, L. C. |
| ประเภท≠ | Centrality measure (directed graph) | Centrality measure |
| แหล่งต้นตำรับ | 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 ↗ |
| ชื่อเรียกอื่น | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness |
| ที่เกี่ยวข้อง≠ | 5 | 6 |
| สรุป≠ | 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. |
| ScholarGateชุดข้อมูล ↗ |
|
|