Machine learningNetwork science
有向特征向量中心性
有向特征向量中心性将经典的特征向量中心性扩展到有向图，通过根据指向它的节点（入向）或它指向的节点（出向）的中心性来为每个节点评分。一个节点获得高分不仅是因为它有很多连接，更是因为它连接到了其他高度中心化的节点，从而捕捉了引文网络、社会层级和信息流中的不对称影响。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI: 10.1086/228631 ↗
- Eigenvector centrality. Wikipedia. link ↗
如何引用本页
ScholarGate. (2026, June 3). Directed Eigenvector Centrality (Asymmetric Influence Scoring on Directed Graphs). ScholarGate. https://scholargate.app/zh/network-analysis/directed-eigenvector-centrality
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 有向介数中心性网络分析↔ compare
- 有向紧密度中心性网络分析↔ compare
- 定向PageRank网络分析↔ compare
- 定向社交网络分析网络分析↔ compare
- 特征向量中心性网络分析↔ compare