Affiliations: [a] Department of Computer Science, City University of Science and Information Technology, Pakistan | [b] College of Technological Innovation, Zayed University, Abu Dhabi | [c] Center for Excellence in Information Technology, Institute of Management Sciences, Pakistan | [d] REMIT, IJP, Universidade Portucalense Porto, Portugal IEETA, Universidade de Aveiro, Aveiro, Portugal
Correspondence:
[*]
Corresponding author: Fernando Moreira, REMIT, IJP, Universidade Portucalense Porto, Portugal IEETA, Universidade de Aveiro, Aveiro, Portugal. E-mail: fmoreira@uportu.pt.
Abstract: Link prediction is one of the most essential and crucial tasks in complex network research since it seeks to forecast missing links in a network based on current ones. This problem has applications in a variety of scientific disciplines, including social network research, recommendation systems, and biological networks. In previous work, link prediction has been solved through different methods such as path, social theory, topology, and similarity-based. The main issue is that path-based methods ignore topological features, while structure-based methods also fail to combine the path and structured-based features. As a result, a new technique based on the shortest path and topological features’ has been developed. The method uses both local and global similarity indices to measure the similarity. Extensive experiments on real-world datasets from a variety of domains are utilized to empirically test and compare the proposed framework to many state-of-the-art prediction techniques. Over 100 iterations, the collected data showed that the proposed method improved on the other methods in terms of accuracy. SI and AA, among the existing state-of-the-art algorithms, fared best with an AUC value of 82%, while the proposed method has an AUC value of 84%.
Keywords: Link prediction, complex networks, global features, local features
