| Summary: | Identifying the most influential spreaders in a weighted complex network is vital for optimizing utilization of the network structure and promoting the information propagation. Most existing algorithms focus on node centrality, which consider more connectivity than clustering. In this paper, a novel algorithm based on clustering degree algorithm (CDA) is proposed to identify the most influential spreaders in a weighted network. First, the weighted degree of a node is defined according to the node degree and strength. Then, based on the node weighted degree, the clustering degree of a node is calculated in respect to the network topological structure. Finally, the propagation capability of a node is achieved by accounting the clustering degree of the node and the contribution from its neighbors. In order to evaluate the performance of the proposed CDA algorithm, the susceptible-infected-recovered model is adopted to simulate the propagation process in real-world networks. The experiment results have showed that CDA is the most effective algorithm in terms of Kendall's tau coefficient and with the highest accuracy in influential spreader identification compared with other algorithms such as weighted degree centrality, weighted closeness centrality, evidential centrality, and evidential semilocal centrality.
|
|---|
