방법 비교

	가중치 PageRank	가중 차수 중심성
분야	네트워크 분석	네트워크 분석
계열	Machine learning	Machine learning
기원 연도	2004	2004
창시자	Xing, W. & Ghorbani, A.	Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A.
유형	Centrality measure / ranking algorithm	Centrality measure for weighted networks
원전	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.	Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752.
별칭	WPR, weighted page rank, edge-weighted PageRank, strength-based PageRank	node strength, strength centrality, weighted node degree, WDC
관련	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.	Weighted degree centrality — also called node strength — extends the classic degree centrality measure to networks whose edges carry numeric weights. Instead of simply counting a node's connections, it sums the weights of all edges incident to that node, capturing both the volume and the intensity of a node's ties in a single, interpretable score.