Identifying Influential Nodes of Complex Networks Based on Trust-Value

Algorithms

Yayun Wang¹  Bin Wang¹  Jinfang Sheng¹  Jiafu Zhu¹  Zheng’ang Hou¹ 

[1] School of Computer Science and Engineering, Central South University, Changsha 410083, China;

关键词: influential nodes;    complex network;    PageRank;    rtust-value;   

DOI  :  10.3390/a13110280

来源: DOAJ

【 摘 要 】

The real world contains many kinds of complex network. Using influence nodes in complex networks can promote or inhibit the spread of information. Identifying influential nodes has become a hot topic around the world. Most of the existing algorithms used for influential node identification are based on the structure of the network such as the degree of the nodes. However, the attribute information of nodes also affects the ranking of nodes’ influence. In this paper, we consider both the attribute information between nodes and the structure of networks. Therefore, the similarity ratio, based on attribute information, and the degree ratio, based on structure derived from trust-value, are proposed. The trust–PageRank (TPR) algorithm is proposed to identify influential nodes in complex networks. Finally, several real networks from different fields are selected for experiments. Compared with some existing algorithms, the results suggest that TPR more rationally and effectively identifies the influential nodes in networks.

【 授权许可】

Unknown