Abstract
Identifying influential nodes in real networks is significant in studying and analyzing the structural as well as functional aspects of networks. VoteRank is a simple and effective algorithm to identify high-spreading nodes. The accuracy and monotonicity of the VoteRank algorithm are poor as the network topology fails to be taken into account.Given the nodes' attributes and neighborhood structure, this paper put forward an algorithm based on the Edge Weighted VoteRank (EWV) for identifying influential nodes in the network. The proposed algorithm draws inspiration from human voting behavior and expresses the attractiveness of nodes to their first-order neighborhood using the weights of connecting edges. Similarity between nodes is introduced into the voting process, further enhancing the accuracy of the method. Additionally, this EWV algorithm addresses the problem of influential node clustering by reducing the voting ability of nodes in the second-order neighborhood of the most influential nodes. The validity of the presented algorithm is verified through experiments conducted on 12 different real networks of various sizes and structures, directly comparing it with 7 competing algorithms.Empirical results indicate a superiority of the presented algorithm over the remaining seven competing algorithms with respect to node differentiation ability, effectiveness, and ranked list accuracy.