Link prediction in complex networks via fusing node centrality and local similarity indices

๐Ÿ“… 2026-09-08
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
่ฎบๆ–‡ๆๅ‡บ้€š่ฟ‡่žๅˆ่Š‚็‚นไธญๅฟƒๆ€งๅ’Œๅฑ€้ƒจ็›ธไผผๆ€งๆŒ‡ๆ•ฐๆฅ่งฃๅ†ณๅคๆ‚็ฝ‘็ปœไธญ้“พๆŽฅ้ข„ๆต‹็š„้—ฎ้ข˜๏ผŒ็‰นๅˆซๆ˜ฏๅœจ็จ€็–็ฝ‘็ปœไธญ็š„้ข„ๆต‹่ƒฝๅŠ›ๅ—้™้—ฎ้ข˜ใ€‚
๐Ÿ“ Abstract
Local similarity indices are widely used in link prediction on complex networks owing to their low computational cost; however, in sparse networks they assign a zero score to every node pair lacking common neighbors, which severely limits their predictive power. A natural remedy is to fuse node centrality indices with local similarity indices: the former provide global importance for the node pair, while the latter capture fine-grained local topology, and the two can be combined into complementary scores within a unified framework. This paper uses PageRank and DomiRank as two representative centrality measures and constructs a centrality--local-similarity fusion framework. The PageRank-based fusion proposed by Charikhi is first generalized to seven classical local similarity indices, and the universality of its improvement is systematically verified on nine real-world network datasets. Furthermore, the DomiRank centrality is introduced to build the DR-MD series of fused indices under a unified weighting coefficient, which overcomes the drawback that the PageRank-based fusion requires index-by-index weight tuning. Results of five-fold cross-validation together with Wilcoxon signed-rank tests show that, under the unified experimental protocol, all DR-MD indices consistently outperform the corresponding local baselines and their PR-MD counterparts on all nine datasets ($p=0.002$), and that the improvements remain robust against perturbations of $ฯƒ$ and the weighting coefficients within the near-critical parameter plateau; in particular, DR-RA achieves an average AUC of 0.7084, surpassing global methods such as Katz and RWR as well as several advanced similarity indices. The framework is inherently extensible, and its fusion paradigm can be straightforwardly generalized to couple other node centrality indices with local similarity indices.
Problem

Research questions and friction points this paper is trying to address.

link prediction
node centrality
local similarity
sparse networks
Innovation

Methods, ideas, or system contributions that make the work stand out.

node centrality
local similarity indices
fusion framework
DomiRank
robustness
๐Ÿ”Ž Similar Papers
No similar papers found.
Yingying Zhang
Yingying Zhang
East China Normal University
Subgroup AnalysisQuantile RegressionTensor LearningReinforcement Learning
C
Chengye Zhao
School of Science, China Jiliang University, Hangzhou 310018, China