手法を比較

	加重近接中心性	近接中心性
分野	ネットワーク分析	ネットワーク分析
系統	Machine learning	Machine learning
提唱年	2010	1950 (formalized 1979)
提唱者	Opsahl, T.; Agneessens, F.; Skvoretz, J.	Bavelas, A.; formalized by Freeman, L. C.
種類	Centrality measure (network analysis)	Node-level centrality index
原典	Opsahl, T., Agneessens, F. & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251.	Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.
別名	weighted closeness, generalized closeness centrality, WCC, distance-weighted closeness	closeness, farness-based centrality, geodesic closeness, normalized closeness centrality
関連	6	6
概要	Weighted closeness centrality extends the classic closeness measure to networks where edges carry numerical weights — such as frequency, strength, or cost — by incorporating those weights into shortest-path distances. Nodes that can reach others quickly along strong or efficient connections receive higher scores, making it a richer indicator of information-spreading potential than its binary counterpart.	Closeness centrality measures how quickly a node can reach all others in a network by computing the inverse of its average shortest-path distance to every other node. First described by Bavelas (1950) and formally unified by Freeman (1979), it identifies nodes that can spread information or resources efficiently across the entire graph — not merely nodes with many direct contacts.