Affiliation:
1. Algorithms and Complexity Theory Lab, Department of Computer Science and Engineering, SRM University-Andhra Pradesh, Amaravati 522502, India
2. Department of Computing, Sheffield Hallam University, Sheffield S1 2NU, UK
Abstract
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.
Reference41 articles.
1. Statistical mechanics of complex networks;Albert;Rev. Mod. Phys.,2002
2. Analysis and applications of complex social networks;Musial;Complexity,2017
3. Clustering and preferential attachment in growing networks;Newman;Phys. Rev. E,2001
4. Liben-Nowell, D., and Kleinberg, J. (2003, January 3–8). The link prediction problem for social networks. Proceedings of the Twelfth International Conference on Information and Knowledge Management, New Orleans, LA, USA.
5. Centrality in social networks: Conceptual clarification;Freeman;Social Network: Critical Concepts in Sociology,2002
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献