Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Eigenvektorscentralitet× | PageRank-centralitet× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1972 | 1999 |
| Upphovsperson≠ | Bonacich, P. | Page, Brin, Motwani & Winograd |
| Typ≠ | Centrality measure | Iterative link-based centrality algorithm |
| Ursprungskälla≠ | Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. 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 | eigenvector centrality, EC, Bonacich centrality, power centrality | Google PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliği |
| Närliggande≠ | 6 | 2 |
| Sammanfattning≠ | Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network. | 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. |
| ScholarGateDatamängd ↗ |
|
|