Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Directed Betweenness Centrality× | Directed PageRank× | |
|---|---|---|
| Область | Сетевой анализ | Сетевой анализ |
| Семейство | Machine learning | Machine learning |
| Год появления≠ | 1977 | 1998 |
| Автор метода≠ | Freeman, L. C. | Brin, S. & Page, L. |
| Тип≠ | Centrality measure (directed graph) | Iterative authority-scoring algorithm |
| Основополагающий источник≠ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ | Brin, S. & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Proceedings of the 7th International Conference on World Wide Web (WWW7), 107–117. Elsevier. link ↗ |
| Другие названия | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness | PageRank, PR, Google PageRank, directed link 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 PageRank is a link-based authority scoring algorithm that assigns importance scores to nodes in a directed graph by iteratively redistributing rank through outgoing edges. Introduced by Brin and Page in 1998 as the backbone of Google Search, it measures not just how many in-links a node has but how authoritative the nodes pointing to it are. |
| ScholarGateНабор данных ↗ |
|
|