Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Насочена централност по посредничество× | Между-възелна централност× | |
|---|---|---|
| Област | Мрежови анализ | Мрежови анализ |
| Семейство | 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Набор от данни ↗ |
|
|