An Entropy-Based Self-Adaptive Node Importance Evaluation Method for Complex Networks. (25th April 2020)

• Record Type: Journal Article
• Authors: Sun, Qibo; Yang, Guoyu; Zhou, Ao
• Other Names: Yuan Yuan Guest Editor.
• Is Part Of: Complexity. Volume 2020(2020)
• Publication Date: 2020-04-25
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2020/4529429
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Identifying important nodes in complex networks is essential in disease transmission control, network attack protection, and valuable information detection. Many evaluation indicators, such as degree centrality, betweenness centrality, and closeness centrality, have been proposed to identify important nodes. Some researchers assign different weight to different indicator and combine them together to obtain the final evaluation results. However, the weight is usually subjectively assigned based on the researcher's experience, which may lead to inaccurate results. In this paper, we propose an entropy-based self-adaptive node importance evaluation method to evaluate node importance objectively. Firstly, based on complex network theory, we select four indicators to reflect different characteristics of the network structure. Secondly, we calculate the weights of different indicators based on information entropy theory. Finally, based on aforesaid steps, the node importance is obtained by weighted average method. The experimental results show that our method performs better than the existing methods.