|
|
|
| Identification Methods of Important Nodes Based on Information Entropy in Hypernetworks |
| TU Guiyu, PAN Wenlin, ZHANG Tianjun
|
| a. School of Mathematics and Computer Science; b. Institute of Software Engineering, Yunnan University for Nationalities, Kunming 650504, China |
|
|
|
|
Abstract In order to solve the problem of low resolution and lack of concrete and comprehensive recognition results of important nodes in hypernetworks, in this paper, combined with the degree of node, degree of transcendence, degree of adjacency and degree of adjacency, the compound information entropy is proposed to identify the important nodes of the hypernetwork. In this method, the influence coefficient is set, and the composite structure entropy of each node is obtained by analyzing the influence degree of degree of node, degree of adjacency, degree of node transcendence and degree of adjacency. Its advantage is that the influence of nodes and adjacent nodes is considered, and only the local attributes of nodes are used, resulting in lower complexity. The simulation experiments are carried out in the research cooperation hypernetwork and Kunming common bus line hypernetwork. Experimental results show that the proposed method can effectively identify the important nodes in the hypernetwork.
|
|
Received: 09 June 2023
Published: 27 April 2025
|
|
|
|
|
|
|
|
|
