手法を比較

	近接中心性	Betweenness Centrality
分野	ネットワーク分析	ネットワーク分析
系統	Machine learning	Machine learning
提唱年	1950 (formalized 1979)	1977
提唱者	Bavelas, A.; formalized by Freeman, L. C.	Freeman, L. C.
種類	Node-level centrality index	Centrality measure
原典	Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.
別名	closeness, farness-based centrality, geodesic closeness, normalized closeness centrality	Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness
関連	6	6
概要	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.	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.