手法を比較

	重み付きPageRank	固有ベクトル中心性
分野	ネットワーク分析	ネットワーク分析
系統	Machine learning	Machine learning
提唱年	2004	1972
提唱者	Xing, W. & Ghorbani, A.	Bonacich, P.
種類	Centrality measure / ranking algorithm	Centrality measure
原典	Xing, W., & Ghorbani, A. (2004). Weighted PageRank algorithm. Proceedings of the Second Annual Conference on Communication Networks and Services Research (CNSR '04), pp. 305–314. IEEE.	Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120.
別名	WPR, weighted page rank, edge-weighted PageRank, strength-based PageRank	eigenvector centrality, EC, Bonacich centrality, power centrality
関連	6	6
概要	Weighted PageRank extends the classic PageRank algorithm to networks where edges carry different strengths or frequencies, distributing importance proportionally to both incoming and outgoing edge weights rather than treating all links equally. This makes it substantially more informative than binary PageRank in any network where connection strength matters.	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.