手法を比較

	ネットワークにおける欠損および将来のエッジ推論	中心性分析
分野	ネットワーク分析	ネットワーク分析
系統	Process / pipeline	Process / pipeline
提唱年	2003	1979
提唱者	—	Linton C. Freeman
種類	Network inference task	Descriptive / exploratory network measure family
原典	Liben-Nowell, D. & Kleinberg, J. (2007). The Link-Prediction Problem for Social Networks. Journal of the American Society for Information Science and Technology, 58(7), 1019-1031.	Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239.
別名	Bağlantı Tahmini (Link Prediction), missing link prediction, future link prediction, edge prediction	Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality
関連	5	5
概要	Link prediction is a network-analysis task that estimates which edges are missing from an observed graph or which edges are likely to form in the future. Formalised by Liben-Nowell and Kleinberg (2003, 2007), it covers a spectrum of approaches — from simple structural similarity indices such as Common Neighbors, Jaccard coefficient, and Adamic-Adar, to matrix factorisation, and graph neural network (GNN) methods — and is evaluated with AUC and Average Precision to account for the heavily imbalanced ratio of real to non-existing edges.	Centrality analysis is a family of network-analytic measures, formalized by Freeman (1979), that quantifies the structural importance of individual nodes within a graph. Each centrality index captures a distinct mechanism of influence: degree centrality reflects direct connectivity, betweenness centrality identifies nodes that broker information flow, closeness centrality captures proximity to all others, and eigenvector centrality (along with PageRank) rewards connection to highly connected neighbors.