방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 중심성 분석× | PageRank 중심성× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열≠ | Process / pipeline | Machine learning |
| 기원 연도≠ | 1979 | 1999 |
| 창시자≠ | Linton C. Freeman | Page, Brin, Motwani & Winograd |
| 유형≠ | Descriptive / exploratory network measure family | Iterative link-based centrality algorithm |
| 원전≠ | Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗ | Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab Technical Report. link ↗ |
| 별칭 | Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality | Google PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliği |
| 관련≠ | 5 | 2 |
| 요약≠ | Centrality analysis is a family of network-analytic measures, formalized by Freeman (1979), that quantifies the structural importance of individual nodes within a graph. Each centrality index captures a distinct mechanism of influence: degree centrality reflects direct connectivity, betweenness centrality identifies nodes that broker information flow, closeness centrality captures proximity to all others, and eigenvector centrality (along with PageRank) rewards connection to highly connected neighbors. | 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. |
| ScholarGate데이터셋 ↗ |
|
|