Identification of Important Nodes Based on Entropy and Neighborhood Relations in Complex Network
Authors: 
Jieyong Zhang, Wei LiangAuthors Info & Claims
Pages 332 - 338
Abstract
With the rapid development of information technology, human society has entered a highly interconnected era. Therefore, analyzing the importance of each node in the network helps to gain a deeper understanding of network characteristics, and ranking the importance of nodes is a commonly used analysis method. This article quantifies the importance of nodes in networks by proposing the concept of binomial entropy, measures the mutual influence between nodes through neighborhood similarity, and introduces van der Waals forces to abstract the interaction relationship between nodes. Therefore, a key node identification method based on binomial entropy and van der Waals forces between neighboring nodes is proposed. Through comparative analysis, it is found that the new algorithm proposed in this article can more accurately identify key nodes in complex networks compared to other similar methods, which can provide useful reference and reference for the construction and development of networks.
References
[1]
Shi Fuli. Research on modeling, analysis and reconstruction method of military communication network based on hypernetwork [D]. Changsha: National University of Defense Technology, 2013.
[2]
LI J C, JIANG J, YANG K W, Research on functional robustness of heterogeneous combat networks [J]. IEEE Systems Journal, 2019, 13(2):1487-1495. https://kns.cnki.net/kcms2/article
[3]
Y.J. Zhang, J.H. Ye, Y.L. Sun A military conceptual model for maritime air defense operations based on IDEF0 and UML [J]. Command Control and Simulation, 2015, 37(06):57-61.
[4]
Qian Rong, Xu Xuefei Introduction of an adversarial attack algorithm for degree centrality selection of attack nodes [J/OL]. Computer Engineering and Applications.:1-10 2023-09-07]. http://kns.cnki.net/kcms/detail/11.2127. TP.20230817.1423.014.html
[5]
Freeman L C. A set of Measures of centrality based on betweenness [J]. Sociometry, 1977, 40: 35-41. https://kns.cnki.net/kcms2/article.
[6]
Bonacich P F. Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 1972,2(1):113-120.https://kns.cnki.net/kcms2/article.
[7]
Zou L, Li Chenpu, Liu K Degree joint information entropy for network important node identification[J]. Fujian Computer, 2023,39(05):30-34. 2023.05.006.
[8]
Lin X, Wu YQ, Feng W Nodal degree and neighborhood similarity label propagation algorithm[J]. Journal of Ningde Normal College (Natural Science Edition), 2023, 35(03):254-259.
[9]
Cheng-Yuan Guo, Hong-Chang Chen, Geng-Run Wang A node importance ranking algorithm based on iterative K-shell and improved information entropy [J]. Journal of Information Engineering University, 2022, 23(05):556-562.
[10]
GONG Zhihao, JIANG Yuan, Dai Jiyang. A Van der Waals force-based algorithm for node importance assessment [J]. Journal of Nanchang University of Aeronautics and Astronautics (Natural Science Edition), 2023, 37(02):1-9.
[11]
HAN Zhongming, CHEN Yan, LI Mengqi, An effective influence metric model for complex network nodes based on triangular structure [J]. Journal of Physics, 2016, 65(16):168901.
[12]
LI M, LIU R R, LU L, Percolation on complex networks: Theory and application [J]. Physics reports, 2021, 907:1-68. https://kns.cnki.net/kcms2/article.
[13]
Junfang Zhu, Duanbing Chen, Tao Zhou, A Review of Relatively Important Node Mining Methods in Network Science[J]. Journal of University of Electronic Science and Technology, 2019, 48(4): 595-603.
[14]
Chen Qian. Research on node importance ranking method based on network entropy [D]. Jiangsu University, 2021. cnki.gjsuu. 2021.000886.
[15]
Ding Y. Properties of binomial distribution entropy[J]. Software, 2012,33(02):144-146+149. 2012.02.049.
[16]
Ruan Yirun, Lao Songyang, Wang Junde An algorithm for complex network node importance assessment based on domain similarity[J]. Journal of Physics, 2017, 66(03):371-379.
[17]
Ren Xiaolong, Lv Linyuan. A review of network important node ranking methods[J]. Science Bulletin,2014,59(13):1175-1197.www.scichina.com.
[18]
Wu Zonglei, Di Zengru, Fan Ying. Progress in the study of structure and function of multilayer networks[J]. Journal of University of Electronic Science and Technology, 2021, 50(01):106-120.
[19]
LI Guoying, CHENG Baisong, ZHANG Peng, A review on the robustness of interdependent networks[J]. Journal of University of Electronic Science and Technology, 2013, 42(1): 23-28. 2013.01.006.
Index Terms
- Identification of Important Nodes Based on Entropy and Neighborhood Relations in Complex Network
Recommendations
Temporal Neighborhood Change Centrality for Important Node Identification in Temporal Networks
Neural Information ProcessingAbstractIn the field of complex networks, identifying important nodes is of great importance both in theoretical and practical applications. Compared with the important node identification of the static network, the important node identification of the ...
Rough relations, neighborhood relations, and granular computing
RSKT'11: Proceedings of the 6th international conference on Rough sets and knowledge technologyBased on formal relationships in Pansystems, this paper discusses the notion of indistinguishability relations among some order pairs in a binary relation and introduces rough relations. A rough relation is a generalization of a rough set from a new ...
Key nodes identification in complex networks based on subnetwork feature extraction
AbstractThe problem of detecting key nodes in a network (i.e. nodes with the greatest ability to spread an infection) has been studied extensively in the past. Some approaches to key node detection compute node centrality, but there is no ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
December 2023
435 pages
ISBN:9798400716430
DOI:10.1145/3654446
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 May 2024
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
SPCNC 2023
SPCNC 2023: The 2nd International Conference on Signal Processing, Computer Networks and Communications
December 8 - 10, 2023
Xiamen, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 12Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)2
Reflects downloads up to 14 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format