Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor
Shibao Li, Junwei Huang, Jianhang Liu, Tingpei Huang, Haihua Chen
Abstract
Complex networks have found many applications in various fields. An important problem in theories of complex networks is to find factors that aid link prediction, which is needed for network reconstruction and to study network evolution mechanisms. Though current similarity-based algorithms study factors of common neighbors and local paths connecting a target node pair, they ignore factor information on paths between a node and its neighbors. Therefore, this paper first supposes that paths between nodes and neighbors provide basic similarity features. Accordingly, we propose a so-called relative-path-based method. This method utilizes factor information on paths between nodes and neighbors, besides paths between node pairs, in similarity calculation for link prediction. Furthermore, we solve the problem of determining the parameters in our algorithm as well as in other algorithms after a series of discoveries and validations. Experimental results on six disparate real networks demonstrate that the relative-path-based method can obtain greater prediction accuracy than other methods, as well as performance robustness.