Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Betweenness Centrality× | PageRank-sentralitet× | |
|---|---|---|
| Fagfelt | Nettverksanalyse | Nettverksanalyse |
| Familie | Machine learning | Machine learning |
| Opprinnelsesår≠ | 1977 | 1999 |
| Opphavsperson≠ | Freeman, L. C. | Page, Brin, Motwani & Winograd |
| Type≠ | Centrality measure | Iterative link-based centrality algorithm |
| Opprinnelig kilde≠ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ | Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab Technical Report. link ↗ |
| Alias | Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness | Google PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliği |
| Relaterte≠ | 6 | 2 |
| Sammendrag≠ | 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. | PageRank is a link-based centrality algorithm that assigns an importance score to each node in a directed graph by measuring how many high-quality nodes point to it. Introduced by Larry Page, Sergey Brin, Rajeev Motwani, and Terry Winograd at Stanford University in 1999, it became the mathematical foundation of the Google search engine and remains one of the most influential algorithms in network science and information retrieval. |
| ScholarGateDatasett ↗ |
|
|