방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 네트워크 확산 분석× | 고유벡터 중심성× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1927 (epidemic roots); network formalization 1990s–2000s | 1972 |
| 창시자≠ | Kermack, W. O. & McKendrick, A. G. | Bonacich, P. |
| 유형≠ | Simulation / analytical model | Centrality measure |
| 원전≠ | Kermack, W. O. & McKendrick, A. G. (1927). A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London A, 115(772), 700–721. DOI ↗ | Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. DOI ↗ |
| 별칭 | diffusion on networks, information diffusion, contagion spreading model, network propagation model | eigenvector centrality, EC, Bonacich centrality, power centrality |
| 관련≠ | 5 | 6 |
| 요약≠ | Network diffusion analysis models how information, diseases, behaviors, or innovations spread across a graph of nodes and edges. Drawing on classical epidemic theory (SI, SIR, SIS) and modern network science, it tracks which nodes become infected, how quickly, and whether the spread reaches a global cascade or dies out locally. | 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. |
| ScholarGate데이터셋 ↗ |
|
|