Abstract

Identifying influential nodes is a recognized challenge for the tremendous number of nodes in complex networks. Most of proposed methods detect the influential nodes based on their degree or topological location, which only consider the local or global information of the network causing inaccuracy. In this paper, we propose a k-orders entropy-based method to identify influential nodes. The influence of node is determined by its entropy with local and global information. The entropy reflecting local information is measured by the different order neighbors’ information of nodes while the entropy reflecting global information by the betweenness centrality. The experiments conducted on real-world networks demonstrate the proposed method is more accurate than other methods.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.