Порівняння методів

	Центральний аналіз	Прогнозування зв'язків
Галузь	Мережевий аналіз	Мережевий аналіз
Родина	Process / pipeline	Process / pipeline
Рік появи	1979	2003
Автор методу	Linton C. Freeman	—
Тип	Descriptive / exploratory network measure family	Network inference task
Основоположне джерело	Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239.	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.
Інші назви	Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality	Bağlantı Tahmini (Link Prediction), missing link prediction, future link prediction, edge prediction
Пов'язані	5	5
Підсумок	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.	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.