手法を比較

	近接中心性	次数中心性
分野	ネットワーク分析	ネットワーク分析
系統	Machine learning	Machine learning
提唱年	1950 (formalized 1979)	1978
提唱者	Bavelas, A.; formalized by Freeman, L. C.	Freeman, L. C.
種類	Node-level centrality index	Node-level centrality measure
原典	Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.	Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.
別名	closeness, farness-based centrality, geodesic closeness, normalized closeness centrality	node degree, degree score, DC, connectivity centrality
関連	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.	Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis.