Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Спрямований PageRank× | Спрямований аналіз соціальних мереж× | |
|---|---|---|
| Галузь | Мережевий аналіз | Мережевий аналіз |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1998 | 1994 |
| Автор методу≠ | Brin, S. & Page, L. | Wasserman, S. & Faust, K. |
| Тип≠ | Iterative authority-scoring algorithm | Structural analysis of directed graphs |
| Основоположне джерело≠ | 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 ↗ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| Інші назви | PageRank, PR, Google PageRank, directed link analysis | directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis |
| Пов'язані | 5 | 5 |
| Підсумок≠ | 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. | 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Набір даних ↗ |
|
|