Maximizing Influence Propagation in Networks by User-Relational Iterative Ranking Algorithm

The issue of maximizing the influence is a hot topic in the research of social network. Many researchers have studied from the perspective of the structure of the network such as the LeaderRank algorithm. However, the algorithm lacks semantic interpretability and explanations for user behavior. Therefore, we propose a novel URI (user-relational iterative) rank to address the above issues. The URI rank is divided into two parts to obtain the values of user influence. The first part is the forwarding probability based on the user relationship. We introduce the relationship between users to the user transition probability and use the random forest to quantify the value of the forwarding probability. The second part is the random transition probability based on the ground node. We optimize the weight assigning of the random transition probability by combining static decentralization and dynamic decentralization. Thus, we more accurately represent the user's random transfer behavior. The experiments performed on the Sina Micro-Blog Dataset show that our algorithm outperforms the existing algorithms.