Link Prediction in Complex Networks Using Average Centrality-Based Similarity Score

被引:1
|
作者
Nandini, Y. V. [1 ]
Lakshmi, T. Jaya [1 ,2 ]
Enduri, Murali Krishna [1 ]
Sharma, Hemlata [2 ]
机构
[1] SRM Univ Andhra Pradesh, Dept Comp Sci & Engn, Algorithms & Complex Theory Lab, Amaravati 522502, India
[2] Sheffield Hallam Univ, Dept Comp, Sheffield S1 2NU, England
关键词
complex networks; link prediction measures; centrality measures; NEIGHBORS;
D O I
10.3390/e26060433
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Link prediction plays a crucial role in identifying future connections within complex networks, facilitating the analysis of network evolution across various domains such as biological networks, social networks, recommender systems, and more. Researchers have proposed various centrality measures, such as degree, clustering coefficient, betweenness, and closeness centralities, to compute similarity scores for predicting links in these networks. These centrality measures leverage both the local and global information of nodes within the network. In this study, we present a novel approach to link prediction using similarity score by utilizing average centrality measures based on local and global centralities, namely Similarity based on Average Degree (SACD), Similarity based on Average Betweenness (SACB), Similarity based on Average Closeness (SACC), and Similarity based on Average Clustering Coefficient (SACCC). Our approach involved determining centrality scores for each node, calculating the average centrality for the entire graph, and deriving similarity scores through common neighbors. We then applied centrality scores to these common neighbors and identified nodes with above average centrality. To evaluate our approach, we compared proposed measures with existing local similarity-based link prediction measures, including common neighbors, the Jaccard coefficient, Adamic-Adar, resource allocation, preferential attachment, as well as recent measures like common neighbor and the Centrality-based Parameterized Algorithm (CCPA), and keyword network link prediction (KNLP). We conducted experiments on four real-world datasets. The proposed similarity scores based on average centralities demonstrate significant improvements. We observed an average enhancement of 24% in terms of Area Under the Receiver Operating Characteristic (AUROC) compared to existing local similarity measures, and a 31% improvement over recent measures. Furthermore, we witnessed an average improvement of 49% and 51% in the Area Under Precision-Recall (AUPR) compared to existing and recent measures. Our comprehensive experiments highlight the superior performance of the proposed method.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] Self-similarity of complex networks under centrality-based node removal strategy
    陈单
    蔡德福
    苏厚胜
    [J]. Chinese Physics B, 2023, (09) : 688 - 694
  • [2] Self-similarity of complex networks under centrality-based node removal strategy
    Chen, Dan
    Cai, Defu
    Su, Housheng
    [J]. CHINESE PHYSICS B, 2023, 32 (09)
  • [3] Centrality-based epidemic control in complex social networks
    Doostmohammadian, Mohammadreza
    Rabiee, Hamid R.
    Khan, Usman A.
    [J]. SOCIAL NETWORK ANALYSIS AND MINING, 2020, 10 (01)
  • [4] Centrality-based epidemic control in complex social networks
    Mohammadreza Doostmohammadian
    Hamid R. Rabiee
    Usman A. Khan
    [J]. Social Network Analysis and Mining, 2020, 10
  • [5] Complex networks after centrality-based attacks and defense
    Zafar, Maham
    Kifayat, Kashif
    Gul, Ammara
    Tahir, Usman
    Abu Ghazalah, Sarah
    [J]. COMPLEX & INTELLIGENT SYSTEMS, 2024, 10 (03) : 3907 - 3923
  • [6] A Link Prediction Model using Similarity and Centrality based Features
    Ankita
    Singh, Nanhay
    [J]. PROCEEDINGS OF THE 2019 6TH INTERNATIONAL CONFERENCE ON COMPUTING FOR SUSTAINABLE GLOBAL DEVELOPMENT (INDIACOM), 2019, : 415 - 417
  • [7] Centrality-based identification of important edges in complex networks
    Broehl, Timo
    Lehnertz, Klaus
    [J]. CHAOS, 2019, 29 (03)
  • [8] Betweenness centrality-based community adaptive network representation for link prediction
    Zhou, Mingqiang
    Jin, Haijiang
    Wu, Quanwang
    Xie, Hong
    Han, Qizhi
    [J]. APPLIED INTELLIGENCE, 2022, 52 (04) : 3545 - 3558
  • [9] Betweenness centrality-based community adaptive network representation for link prediction
    Mingqiang Zhou
    Haijiang Jin
    Quanwang Wu
    Hong Xie
    Qizhi Han
    [J]. Applied Intelligence, 2022, 52 : 3545 - 3558
  • [10] Centrality-based and similarity-based neighborhood extension in graph neural networks
    Zohrabi, Mohammadjavad
    Saravani, Saeed
    Chehreghani, Mostafa Haghir
    [J]. JOURNAL OF SUPERCOMPUTING, 2024, 80 (16): : 24638 - 24663