Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Спрямований PageRank× | Виявлення спрямованих спільнот× | |
|---|---|---|
| Галузь | Мережевий аналіз | Мережевий аналіз |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1998 | 2008 |
| Автор методу≠ | Brin, S. & Page, L. | Leicht, E. A. & Newman, M. E. J.; Rosvall, M. & Bergstrom, C. T. |
| Тип≠ | Iterative authority-scoring algorithm | Graph partitioning / modularity optimization |
| Основоположне джерело≠ | 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 ↗ | Leicht, E. A. & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703. DOI ↗ |
| Інші назви | PageRank, PR, Google PageRank, directed link analysis | directed graph clustering, community detection in digraphs, directed modularity optimization, directed network partitioning |
| Пов'язані≠ | 5 | 6 |
| Підсумок≠ | 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 community detection identifies densely interconnected groups of nodes in a directed network, accounting for the asymmetry of edges (e.g., A follows B does not imply B follows A). Adapting modularity or flow-based criteria to directed graphs reveals clusters that undirected methods systematically miss, making it essential for citation networks, follower graphs, and biological regulatory pathways. |
| ScholarGateНабір даних ↗ |
|
|