Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| k-Core Decomposition× | PageRank-centralitet× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj≠ | Process / pipeline | Machine learning |
| Ursprungsår≠ | 1983 | 1999 |
| Upphovsperson≠ | Stephen B. Seidman | Page, Brin, Motwani & Winograd |
| Typ≠ | Graph pruning and hierarchical decomposition | Iterative link-based centrality algorithm |
| Ursprungskälla≠ | Seidman, S. B. (1983). Network structure and minimum degree. Social Networks, 5(3), 269–287. 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 | Core Decomposition, Coreness Decomposition, Shell Decomposition, Çekirdek Ayrıştırma | Google PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliği |
| Närliggande≠ | 3 | 2 |
| Sammanfattning≠ | k-Core Decomposition is a graph-theoretic method that partitions the vertices of a network into a nested sequence of subgraphs called k-cores. A k-core is the maximal subgraph in which every vertex has at least k neighbors within that subgraph. Introduced by Stephen B. Seidman in 1983, the method assigns each vertex a coreness number that captures its structural centrality relative to the local connectivity of the graph. | 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 ↗ |
|
|