{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T17:06:53Z","timestamp":1772471213879,"version":"3.50.1"},"reference-count":47,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T00:00:00Z","timestamp":1645142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002063"],"award-info":[{"award-number":["62002063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fujian Natural Science Funds","award":["2020J05112"],"award-info":[{"award-number":["2020J05112"]}]},{"name":"Funds of Fujian Provincial Department of Education","award":["JAT190026"],"award-info":[{"award-number":["JAT190026"]}]},{"DOI":"10.13039\/501100008859","name":"Fuzhou University","doi-asserted-by":"publisher","award":["510872\/GXRC-20016"],"award-info":[{"award-number":["510872\/GXRC-20016"]}],"id":[{"id":"10.13039\/501100008859","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Identifying influential nodes in complex networks has attracted the attention of many researchers in recent years. However, due to the high time complexity, methods based on global attributes have become unsuitable for large-scale complex networks. In addition, compared with methods considering only a single attribute, considering multiple attributes can enhance the performance of the method used. Therefore, this paper proposes a new multiple local attributes-weighted centrality (LWC) based on information entropy, combining degree and clustering coefficient; both one-step and two-step neighborhood information are considered for evaluating the influence of nodes and identifying influential nodes in complex networks. Firstly, the influence of a node in a complex network is divided into direct influence and indirect influence. The degree and clustering coefficient are selected as direct influence measures. Secondly, based on the two direct influence measures, we define two indirect influence measures: two-hop degree and two-hop clustering coefficient. Then, the information entropy is used to weight the above four influence measures, and the LWC of each node is obtained by calculating the weighted sum of these measures. Finally, all the nodes are ranked based on the value of the LWC, and the influential nodes can be identified. The proposed LWC method is applied to identify influential nodes in four real-world networks and is compared with five well-known methods. The experimental results demonstrate the good performance of the proposed method on discrimination capability and accuracy.<\/jats:p>","DOI":"10.3390\/e24020293","type":"journal-article","created":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T08:18:05Z","timestamp":1645431485000},"page":"293","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Identifying Influential Nodes in Complex Networks Based on Multiple Local Attributes and Information Entropy"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1801-0410","authenticated-orcid":false,"given":"Jinhua","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Economics and Management, Fuzhou University, Fuzhou 350108, China"}]},{"given":"Qishan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Fuzhou University, Fuzhou 350108, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5293-8701","authenticated-orcid":false,"given":"Ling","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Computer and Data Science, Fuzhou University, Fuzhou 350108, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6750-9640","authenticated-orcid":false,"given":"Jinxin","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Business, Hubei University, Wuhan 430062, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,2,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"102768","DOI":"10.1016\/j.jnca.2020.102768","article-title":"Influential nodes selection to enhance data dissemination in mobile social networks: A survey","volume":"169","author":"Tulu","year":"2020","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"113642","DOI":"10.1016\/j.eswa.2020.113642","article-title":"Influential nodes detection in dynamic social networks: A survey","volume":"159","author":"Hafiene","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Omar, Y.M., and Plapper, P. (2020). A Survey of Information Entropy Metrics for Complex Networks. Entropy, 22.","DOI":"10.3390\/e22121417"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality of a graph","volume":"31","author":"Sabidussi","year":"1966","journal-title":"Psychometrika"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"033112","DOI":"10.1063\/1.4916215","article-title":"A new closeness centrality measure via effective distance in complex networks","volume":"25","author":"Du","year":"2015","journal-title":"Chaos"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","article-title":"A measure of betweenness centrality based on random walks","volume":"27","author":"Newman","year":"2005","journal-title":"Soc. Netw."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/2517327.2442521","article-title":"Betweenness Centrality: Algorithms and Implementations","volume":"48","author":"Prountzos","year":"2013","journal-title":"ACM Sigplan Not."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Zhao, J., Yang, T.-H., Huang, Y., and Holme, P. (2011). Ranking Candidate Disease Genes from Gene Expression and Protein Interaction: A Katz-Centrality Based Approach. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0024306"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat. Phys."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"113681","DOI":"10.1016\/j.eswa.2020.113681","article-title":"A systematic survey on influential spreaders identification in complex networks with a focus on K-shell based techniques","volume":"161","author":"Maji","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.physleta.2013.02.039","article-title":"Ranking spreaders by decomposing complex networks","volume":"377","author":"Zeng","year":"2013","journal-title":"Phys. Lett. A"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3279","DOI":"10.1016\/j.physleta.2014.09.054","article-title":"Identifying the node spreading influence with largest k-core values","volume":"378","author":"Lin","year":"2014","journal-title":"Phys. Lett. A"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","article-title":"Identifying and ranking influential spreaders in complex networks by neighborhood coreness","volume":"395","author":"Bae","year":"2014","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.physa.2014.11.012","article-title":"Weighted k-shell decomposition for complex networks based on potential edge weights","volume":"420","author":"Wei","year":"2015","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.physa.2016.05.048","article-title":"Fast ranking influential nodes in complex networks using a k-shell iteration factor","volume":"461","author":"Wang","year":"2016","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1750014","DOI":"10.1142\/S0129183117500140","article-title":"Identifying the most influential spreaders in complex networks by an Extended Local K-Shell Sum","volume":"28","author":"Yang","year":"2017","journal-title":"Int. J. Mod. Phys. C"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.neucom.2017.04.064","article-title":"Ranking influential nodes in social networks based on node position and neighborhood","volume":"260","author":"Wang","year":"2017","journal-title":"Neurocomputing"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.eswa.2017.10.018","article-title":"A hierarchical approach for influential node ranking in complex social networks","volume":"93","author":"Zareie","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"6528431","DOI":"10.1155\/2019\/6528431","article-title":"Influential Node Identification in Command and Control Networks Based on Integral k-Shell","volume":"2019","author":"Wang","year":"2019","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"113092","DOI":"10.1016\/j.eswa.2019.113092","article-title":"Influential spreaders identification in complex networks with improved k-shell hybrid method","volume":"144","author":"Maji","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual Web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"L\u00fc, L., Zhang, Y.C., Yeung, C.H., and Zhou, T. (2011). Leaders in social networks, the Delicious case. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0021202"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","article-title":"Authoritative sources in a hyperlinked environment","volume":"46","author":"Kleinberg","year":"1999","journal-title":"J. ACM"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"10168","DOI":"10.1038\/ncomms10168","article-title":"The H-index of a network node and its relation to degree and coreness","volume":"7","author":"Zhou","year":"2016","journal-title":"Nat. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.physa.2018.09.064","article-title":"EHC: Extended H-index Centrality measure for identification of users\u2019 spreading influence in complex networks","volume":"514","author":"Zareie","year":"2019","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","article-title":"Identifying influential nodes in complex networks","volume":"391","author":"Chen","year":"2012","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1850118","DOI":"10.1142\/S0217979218501187","article-title":"Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient","volume":"32","author":"Li","year":"2018","journal-title":"Int. J. Mod. Phys. B"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Qiao, T., Shan, W., and Zhou, C. (2017). How to Identify the Most Powerful Node in Complex Networks? A Novel Entropy Centrality Approach. Entropy, 19.","DOI":"10.3390\/e19110614"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Qiao, T., Shan, W., Yu, G., and Liu, C. (2018). A Novel Entropy-Based Centrality Approach for Identifying Vital Nodes in Weighted Networks. Entropy, 20.","DOI":"10.3390\/e20040261"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Li, Y., Cai, W., Li, Y., and Du, X. (2020). Key Node Ranking in Complex Networks: A Novel Entropy and Mutual Information-Based Approach. Entropy, 22.","DOI":"10.3390\/e22010052"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"123659","DOI":"10.1016\/j.physa.2019.123659","article-title":"Sequential seeding strategy for social influence diffusion with improved entropy-based centrality","volume":"545","author":"Ni","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Guo, C., Yang, L., Chen, X., Chen, D., Gao, H., and Ma, J. (2020). Influential Nodes Identification in Complex Networks via Information Entropy. Entropy, 22.","DOI":"10.3390\/e22020242"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.ins.2016.08.023","article-title":"Social influence modeling using information theory in mobile social networks","volume":"379","author":"Peng","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"32904","DOI":"10.1109\/ACCESS.2020.2973241","article-title":"Identifying Key Nodes in Complex Networks Based on Global Structure","volume":"8","author":"Yang","year":"2020","journal-title":"IEEE Access"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1850363","DOI":"10.1142\/S0217979218503630","article-title":"Multi-attribute ranking method for identifying key nodes in complex networks based on GRA","volume":"32","author":"Yang","year":"2019","journal-title":"Int. J. Mod. Phys. B"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"121538","DOI":"10.1016\/j.physa.2019.121538","article-title":"Identifying node importance based on evidence theory in complex networks","volume":"529","author":"Mo","year":"2019","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.physa.2016.02.028","article-title":"Identify influential spreaders in complex networks, the role of neighborhood","volume":"452","author":"Liu","year":"2016","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.neucom.2019.06.030","article-title":"Identifying influential spreaders in large-scale networks based on evidence theory","volume":"359","author":"Liu","year":"2019","journal-title":"Neurocomputing"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"He, D., Xu, J., and Chen, X. (2016). Information-Theoretic-Entropy Based Weight Aggregation Method in Multiple-Attribute Group Decision-Making. Entropy, 18.","DOI":"10.3390\/e18060171"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Luo, R., Huang, S., Zhao, Y., and Song, Y. (2021). Threat Assessment Method of Low Altitude Slow Small (LSS) Targets Based on Information Entropy and AHP. Entropy, 23.","DOI":"10.3390\/e23101292"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"46773","DOI":"10.1109\/ACCESS.2020.2978142","article-title":"A Novel Model to Identify the Influential Nodes: Evidence Theory Centrality","volume":"8","author":"Zhao","year":"2020","journal-title":"IEEE Access"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"105580","DOI":"10.1016\/j.knosys.2020.105580","article-title":"Finding influential nodes in social networks based on neighborhood correlation coefficient","volume":"194","author":"Zareie","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"125848","DOI":"10.1016\/j.physa.2021.125848","article-title":"Information diffusion under public crisis in BA scale-free network based on SEIR model\u2014Taking COVID-19 as an example","volume":"571","author":"Zhang","year":"2021","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"115778","DOI":"10.1016\/j.eswa.2021.115778","article-title":"Identifying vital nodes from local and global perspectives in complex networks","volume":"186","author":"Ullah","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"8403738","DOI":"10.1155\/2021\/8403738","article-title":"Identification of Influential Nodes via Effective Distance-based Centrality Mechanism in Complex Networks","volume":"2021","author":"Ullah","year":"2021","journal-title":"Complexity"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/2\/293\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:22:25Z","timestamp":1760134945000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/2\/293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,18]]},"references-count":47,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,2]]}},"alternative-id":["e24020293"],"URL":"https:\/\/doi.org\/10.3390\/e24020293","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,18]]}}}