Σύγκριση μεθόδων

	Σταθμισμένο PageRank	Μετακεντρικότητα
Πεδίο	Ανάλυση Δικτύων	Ανάλυση Δικτύων
Οικογένεια	Machine learning	Machine learning
Έτος προέλευσης	2004	1977
Δημιουργός	Xing, W. & Ghorbani, A.	Freeman, L. C.
Τύπος	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.	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.
Εναλλακτικές ονομασίες	WPR, weighted page rank, edge-weighted PageRank, strength-based PageRank	Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness
Συναφείς	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.	Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes.