เปรียบเทียบวิธี
ดูวิธีที่เลือกเทียบกันแบบเคียงข้าง แถวที่ต่างกันจะถูกเน้นไว้
| Directed Betweenness Centrality× | การวิเคราะห์เครือข่ายสังคมแบบมีทิศทาง× | |
|---|---|---|
| สาขาวิชา | การวิเคราะห์เครือข่าย | การวิเคราะห์เครือข่าย |
| ตระกูล | Machine learning | Machine learning |
| ปีกำเนิด≠ | 1977 | 1994 |
| ผู้ริเริ่ม≠ | Freeman, L. C. | Wasserman, S. & Faust, K. |
| ประเภท≠ | Centrality measure (directed graph) | Structural analysis of directed graphs |
| แหล่งต้นตำรับ≠ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| ชื่อเรียกอื่น | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness | directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis |
| ที่เกี่ยวข้อง | 5 | 5 |
| สรุป≠ | 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. | Directed Social Network Analysis (directed SNA) studies networks in which every tie has an explicit direction — from a sender to a receiver — rather than treating relationships as symmetric. It extends the classical SNA toolkit with in-degree, out-degree, reciprocity, and asymmetric path measures, making it the appropriate framework wherever relationship direction carries substantive meaning, such as citation flows, advice-seeking, follower graphs, or information cascades. |
| ScholarGateชุดข้อมูล ↗ |
|
|