Random walk-based link prediction algorithms have achieved desirable results for complex network mining, but in these algorithms, the transition probability of particles usually only considers node degrees, resulting in particles being able to randomly select adjacent nodes for random walks in an equal probability manner, to solve this problem, the asymmetric influence-based superposed random walk link prediction algorithm is proposed in this paper. This algorithm encourages particles to choose the next node at each step of the random walk process based on the asymmetric influence between nodes. To this end, we fully consider the topological information around each node and propose the asymmetric influence between nodes. Then, an adjustable parameter is applied to normalize the degree of nodes and the asymmetric influence between nodes into transition probability. Based on this, the proposed new transition probability is applied to superposed random walk process to measure the similarity between all nodes in the network. Empirical experiments are conducted on 16 real-world network datasets such as social network, ecology network, and animal network. The experimental results show that the proposed algorithm has high prediction accuracy in most network, compared with 10 benchmark indices.
Read full abstract