The Structure Entropy-Based Node Importance Ranking Method for Graph Data
Due to its wide application across many disciplines, how to make an efficient ranking for nodes in graph data has become an urgent topic. It is well-known that most classical methods only consider the local structure information of nodes, but ignore the global structure information of graph data. In...
Main Authors: | Shihu Liu, Haiyan Gao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-06-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/25/6/941 |
Similar Items
-
The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data
by: Shihu Liu, et al.
Published: (2022-10-01) -
Node Importance Ranking of Complex Networks with Entropy Variation
by: Xinbo Ai
Published: (2017-06-01) -
Identifying Important Nodes in Complex Networks Based on Node Propagation Entropy
by: Yong Yu, et al.
Published: (2022-02-01) -
pygrank: A Python package for graph node ranking
by: Emmanouil Krasanakis, et al.
Published: (2022-12-01) -
Identification of Critical Nodes in Power Grid Based on Improved PageRank Algorithm and Power Flow Transfer Entropy
by: Jinhui Zeng, et al.
Published: (2023-12-01)