方法证据记录
Eigenvector Centrality
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.
源记录
引文逐字复制自方法源记录。这些引文不代表任何层级的验证。
Eigenvector Centrality (Bonacich Power Centrality)
分类方法记录 · ml-model / network-analysis
- Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. · DOI 10.1080/0022250X.1972.9989806
- Eigenvector centrality. Wikipedia. · URL
精选声明
声明已持久化到证据分类账中，每个声明都有自己的评估。
尚无精选声明
当分类账中没有声明时，此视图不会自行创建声明评估。
相关方法
从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。