{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:52:44Z","timestamp":1781553164313,"version":"3.54.5"},"reference-count":44,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:00:00Z","timestamp":1777939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In complex networks, identifying key nodes has attracted significant attention from researchers in areas such as information diffusion, network attacks, and epidemic spreading. In recent years, most studies have focused on identifying influential nodes in unweighted and undirected networks. However, many existing methods are not directly applicable to weighted and directed complex networks, as they typically consider only the immediate neighbors of a node without accounting for the interactions and structural information among them. Furthermore, traditional centrality measures for node ranking are often limited to single-feature factors and suffer from issues such as poor scalability, unequal neighbor contributions, and sensitivity to network topology. Incorporating multidimensional factors and edge weights into node importance evaluation can significantly enhance the identification of key nodes in large-scale and heterogeneous networks. To address these limitations, this article introduces a Multidimensional Entropy-based Weighted Semi-Local (MEWSL) centrality for identifying key nodes in weighted complex networks. To better capture semi-local neighbor influence and improve scalability, MEWSL constructs weighted semi-local subgraphs for each node in a distributed manner. It integrates multiple factors\u2014such as the degree of neighboring nodes, the number of shortest paths, and the average shortest path\u2014to quantify node importance within weighted semi-local subgraphs. Information entropy is employed to assign weights to different contributing factors, and MEWSL computes the final node ranking by aggregating these factors through a weighted sum. The proposed metric considers not only the relationship between a node and its neighbors but also the interactions among neighboring nodes by incorporating edge weights. MEWSL is evaluated on real-world networks using the susceptible\u2013infected\u2013removed (SIR) model and Kendall\u2019s correlation, demonstrating more effective node ranking with lower computational complexity than existing methods.<\/jats:p>","DOI":"10.1093\/comnet\/cnag024","type":"journal-article","created":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T12:04:39Z","timestamp":1778760279000},"source":"Crossref","is-referenced-by-count":0,"title":["Entropy-based semi-local centrality for identifying key nodes in weighted complex networks"],"prefix":"10.1093","volume":"14","author":[{"given":"Yan","family":"Jin","sequence":"first","affiliation":[{"name":"Institute of Information Engineering, Shanxi Vocational University of Engineering Science and Technology , Jinzhong, Shanxi 030619,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoling","family":"Feng","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering, Shanxi Vocational University of Engineering Science and Technology , Jinzhong, Shanxi 030619,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7835-1923","authenticated-orcid":false,"given":"Dehua","family":"Kong","sequence":"additional","affiliation":[{"name":"School of Computer Science, Jingdezhen University , Jingdezhen, Jiangxi 333000,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2026,6,4]]},"reference":[{"key":"2026061514552932800_cnag024-B1","doi-asserted-by":"crossref","first-page":"bbad431","DOI":"10.1093\/bib\/bbad431","article-title":"Drug repositioning based on weighted local information augmented graph neural network","volume":"25","author":"Meng","year":"2024","journal-title":"Brief Bioinform"},{"key":"2026061514552932800_cnag024-B2","doi-asserted-by":"crossref","first-page":"126708","DOI":"10.1016\/j.physa.2021.126708","article-title":"Efficient algorithm for finding the influential nodes using local relative change of average shortest path","volume":"591","author":"Hajarathaiah","year":"2022","journal-title":"Phys A: Stat Mech Its Appl"},{"key":"2026061514552932800_cnag024-B3","doi-asserted-by":"crossref","first-page":"547","DOI":"10.3389\/fbioe.2020.00547","article-title":"NAIGO: an improved method to align PPI networks based on gene ontology and graphlets","volume":"8","author":"Zhu","year":"2020","journal-title":"Front Bioeng Biotechnol"},{"key":"2026061514552932800_cnag024-B4","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1002\/rnc.7725","article-title":"A unified adaptive event-triggered output feedback consensus for multi-agent systems with or without output constraints","volume":"35","author":"Huang","year":"2025","journal-title":"Intl J Robust Nonlinear"},{"key":"2026061514552932800_cnag024-B5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ins.2015.11.014","article-title":"Concentric network symmetry","volume":"333","author":"Silva","year":"2016","journal-title":"Inform Sci"},{"key":"2026061514552932800_cnag024-B6","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1140\/epjp\/s13360-025-07114-1","article-title":"Toward a security-aware and scalable semi-local centrality for weighted complex networks","volume":"140","author":"Zhang","year":"2025","journal-title":"Eur Phys J Plus"},{"key":"2026061514552932800_cnag024-B7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s11235-024-01240-4","article-title":"Identifying influential nodes in complex networks: a semi-local centrality measure based on augmented graph and average shortest path theory","volume":"88","author":"Pan","year":"2025","journal-title":"Telecommun Syst"},{"key":"2026061514552932800_cnag024-B8","doi-asserted-by":"crossref","first-page":"cnae015","DOI":"10.1093\/comnet\/cnae015","article-title":"Dynamic identification of important nodes in complex networks by considering local and global characteristics","volume":"12","author":"Cao","year":"2024","journal-title":"J Complex Netws"},{"key":"2026061514552932800_cnag024-B9","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":"L\u00fc","year":"2016","journal-title":"Nat Commun"},{"key":"2026061514552932800_cnag024-B10","doi-asserted-by":"crossref","first-page":"116986","DOI":"10.1016\/j.chaos.2025.116986","article-title":"Towards a scalable semi-local centrality for weighted complex networks using information entropy and shortest path analysis","volume":"200","author":"Gao","year":"2025","journal-title":"Chaos Solitons Fract"},{"key":"2026061514552932800_cnag024-B11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.3390\/e24020293","article-title":"Identifying influential nodes in complex networks based on multiple local attributes and information entropy","volume":"24","author":"Zhang","year":"2022","journal-title":"Entropy"},{"key":"2026061514552932800_cnag024-B12","doi-asserted-by":"crossref","first-page":"4471","DOI":"10.1109\/TKDE.2025.3566038","article-title":"Cost-sensitive neighborhood granularity selection for hierarchical classification","volume":"37","author":"Li","year":"2025","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2026061514552932800_cnag024-B13","doi-asserted-by":"crossref","first-page":"109420","DOI":"10.1016\/j.engappai.2024.109420","article-title":"Perturbation defense ultra high-speed weak target recognition","volume":"138","author":"Xue","year":"2024","journal-title":"Eng Appl Artif Intell"},{"key":"2026061514552932800_cnag024-B14","doi-asserted-by":"crossref","first-page":"2084","DOI":"10.1109\/TFUZZ.2025.3549791","article-title":"Hierarchical fuzzy topological system for high-dimensional data regression problems","volume":"33","author":"Yao","year":"2025","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"2026061514552932800_cnag024-B15","doi-asserted-by":"crossref","first-page":"4136","DOI":"10.1109\/TCYB.2025.3580666","article-title":"Event-triggered multiple leaders formation tracking for networked swarm system with resilience to noncooperative nodes","volume":"55","author":"Liu","year":"2025","journal-title":"IEEE Trans Cybern"},{"key":"2026061514552932800_cnag024-B16","doi-asserted-by":"crossref","first-page":"110291","DOI":"10.1016\/j.ress.2024.110291","article-title":"A study on the prediction of service reliability of wireless telecommunication system via distribution regression","volume":"250","author":"Li","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"key":"2026061514552932800_cnag024-B17","doi-asserted-by":"crossref","first-page":"129123","DOI":"10.1016\/j.neucom.2024.129123","article-title":"Adaptive opinion dynamics over community networks when agents cannot express opinions freely","volume":"618","author":"Peng","year":"2025","journal-title":"Neurocomputing"},{"key":"2026061514552932800_cnag024-B18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.physleta.2008.10.069","article-title":"Accessibility in complex networks","volume":"373","author":"Traven\u00e7olo","year":"2008","journal-title":"Phys Lett A"},{"key":"2026061514552932800_cnag024-B19","doi-asserted-by":"crossref","first-page":"118175","DOI":"10.1016\/j.chaos.2026.118175","article-title":"A gravity-inspired hierarchical approach considering time spreading for key node identification in complex networks","volume":"208","author":"Wu","year":"2026","journal-title":"Chaos Solitons Fractals"},{"key":"2026061514552932800_cnag024-B20","doi-asserted-by":"crossref","first-page":"9741824","DOI":"10.1155\/2017\/9741824","article-title":"Mining important nodes in directed weighted complex networks","volume":"2017","author":"Yang","year":"2017","journal-title":"Discrete Dyn Nat Soc"},{"key":"2026061514552932800_cnag024-B21","article-title":"Towards a hierarchical approach and scalable semi-local centrality for key node identification in weighted complex networks","author":"Kong","year":"2026","journal-title":"Sci Rep"},{"key":"2026061514552932800_cnag024-B22","doi-asserted-by":"crossref","first-page":"110177","DOI":"10.1016\/j.engappai.2025.110177","article-title":"A novel semi-local centrality to identify influential nodes in complex networks by integrating multidimensional factors","volume":"145","author":"Zhang","year":"2025","journal-title":"Eng Appl Artif Intell"},{"key":"2026061514552932800_cnag024-B23","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.physa.2014.02.032","article-title":"Ranking the spreading ability of nodes in complex networks based on local structure","volume":"403","author":"Gao","year":"2014","journal-title":"Phys A: Stat Mech Its Appl"},{"key":"2026061514552932800_cnag024-B24","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","article-title":"Identifying influential spreaders in complex networks based on gravity formula","volume":"451","author":"Ma","year":"2016","journal-title":"Phys A: Stat Mech Its Appl"},{"key":"2026061514552932800_cnag024-B25","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1007\/s11424-021-0111-7","article-title":"Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths","volume":"34","author":"Luan","year":"2021","journal-title":"J Syst Sci Complex"},{"key":"2026061514552932800_cnag024-B26","doi-asserted-by":"crossref","first-page":"2865","DOI":"10.1109\/TCYB.2025.3558941","article-title":"Correlation information enhanced graph anomaly detection via hypergraph transformation","volume":"55","author":"Huang","year":"2025","journal-title":"IEEE Trans Cybern"},{"key":"2026061514552932800_cnag024-B27","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J Math Sociol"},{"key":"2026061514552932800_cnag024-B28","doi-asserted-by":"crossref","first-page":"cnae021","DOI":"10.1093\/comnet\/cnae021","article-title":"A new important nodes identification method in multi-layer heterogeneous combat network with meta-path centrality","volume":"12","author":"Sun","year":"2024","journal-title":"J Complex Netw"},{"key":"2026061514552932800_cnag024-B29","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"key":"2026061514552932800_cnag024-B30","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality index of a graph","volume":"31","author":"Sabidussi","year":"1966","journal-title":"Psychometrika"},{"key":"2026061514552932800_cnag024-B31","first-page":"26","author":"Rochat","year":"2009"},{"key":"2026061514552932800_cnag024-B32","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.socnet.2007.04.002","article-title":"Some unique properties of eigenvector centrality","volume":"29","author":"Bonacich","year":"2007","journal-title":"Soc Networks"},{"key":"2026061514552932800_cnag024-B33","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.physa.2019.01.136","article-title":"A novel measure of identifying influential nodes in complex networks","volume":"523","author":"Lv","year":"2019","journal-title":"Phys A: Stat Mech Its Appl"},{"key":"2026061514552932800_cnag024-B34","doi-asserted-by":"crossref","first-page":"e1010942","DOI":"10.1371\/journal.pgen.1010942","article-title":"Inferring gene regulatory network from single-cell transcriptomes with graph autoencoder model","volume":"19","author":"Wang","year":"2023","journal-title":"PLoS Genet"},{"key":"2026061514552932800_cnag024-B35","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10462-024-10725-2","article-title":"A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood","volume":"57","author":"Xiao","year":"2024","journal-title":"Artif Intell Rev"},{"key":"2026061514552932800_cnag024-B36","doi-asserted-by":"crossref","first-page":"6256","DOI":"10.1109\/TAES.2024.3408139","article-title":"ISAR Weak Feature enhancement with perturbation defense using hybrid clustering oversegmentation","volume":"60","author":"Xue","year":"2024","journal-title":"IEEE Trans Aerosp Electron Syst"},{"key":"2026061514552932800_cnag024-B37","first-page":"9","article-title":"Research on the approximation algorithms for the betweenness property computation on complex social networks","volume":"30","author":"Tang","year":"2008","journal-title":"Computer Eng Sci"},{"key":"2026061514552932800_cnag024-B38","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s13222-017-0261-x","article-title":"Efficient batched distance, closeness and betweenness centrality computation in unweighted and weighted graphs","volume":"17","author":"Then","year":"2017","journal-title":"Datenbank Spektrum"},{"key":"2026061514552932800_cnag024-B39","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1186\/s40537-025-01159-w","article-title":"Identifying influential nodes in weighted complex networks by considering the importance of shortest paths","volume":"12","author":"Wang","year":"2025","journal-title":"J Big Data"},{"key":"2026061514552932800_cnag024-B40","doi-asserted-by":"crossref","first-page":"100112","DOI":"10.1016\/j.jcmds.2025.100112","article-title":"Directional node strength entropy centrality: ranking influential nodes in complex networks","volume":"14","author":"Maji","year":"2025","journal-title":"J Comput Math Data Sci"},{"key":"2026061514552932800_cnag024-B41","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.physa.2007.06.022","article-title":"From unweighted to weighted networks with local information","volume":"385","author":"Sun","year":"2007","journal-title":"Phys A: Stat Mech Its Appl"},{"key":"2026061514552932800_cnag024-B42","doi-asserted-by":"crossref","first-page":"115843","DOI":"10.1016\/j.chaos.2024.115843","article-title":"Development of a multidimensional centrality metric for ranking nodes in complex networks","volume":"191","author":"Meng","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"2026061514552932800_cnag024-B43","doi-asserted-by":"crossref","first-page":"754","DOI":"10.3390\/e25050754","article-title":"Identifying influential nodes in complex networks based on information entropy and relationship strength","volume":"25","author":"Xi","year":"2023","journal-title":"Entropy"},{"key":"2026061514552932800_cnag024-B44","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1109\/TKDE.2024.3523107","article-title":"Nowhere to hide: fraud detection from multi-relation graphs via disentangled homophily and heterophily identification","volume":"37","author":"Fu","year":"2024","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/14\/3\/cnag024\/68530079\/cnag024.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/14\/3\/cnag024\/68530079\/cnag024.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T18:55:40Z","timestamp":1781549740000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnag024\/8708314"}},"subtitle":[],"editor":[{"family":"Prof. Francisco Rodrigues","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2026,5,5]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5,5]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnag024","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,6]]},"published":{"date-parts":[[2026,5,5]]},"article-number":"cnag024"}}