{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:16:26Z","timestamp":1775229386953,"version":"3.50.1"},"reference-count":47,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["ZR2020MF044"],"award-info":[{"award-number":["ZR2020MF044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71772107"],"award-info":[{"award-number":["71772107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,13]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Identifying influential nodes is a fundamental and open issue in analysis of the complex networks. The measurement of the spreading capabilities of nodes is an attractive challenge in this field. Node centrality is one of the most popular methods used to identify the influential nodes, which includes the degree centrality (DC), betweenness centrality (BC) and closeness centrality (CC). The DC is an efficient method but not effective. The BC and CC are effective but not efficient. They have high computational complexity. To balance the effectiveness and efficiency, this paper proposes the neighborhood entropy centrality to rank the influential nodes. The proposed method uses the notion of entropy to improve the DC. For evaluating the performance, the susceptible-infected-recovered model is used to simulate the information spreading process of messages on nine real-world networks. The experimental results reveal the accuracy and efficiency of the proposed method.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab034","type":"journal-article","created":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T20:11:12Z","timestamp":1616098272000},"page":"1465-1476","source":"Crossref","is-referenced-by-count":13,"title":["Identifying Influential Nodes in Complex Networks Based on Neighborhood Entropy Centrality"],"prefix":"10.1093","volume":"64","author":[{"given":"Liqing","family":"Qiu","sequence":"first","affiliation":[{"name":"Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, No. 579, Qianwangang Road, Huangdao District, Qingdao 266590, Shandong Province, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, No. 579, Qianwangang Road, Huangdao District, Qingdao 266590, Shandong Province, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangbo","family":"Tian","sequence":"additional","affiliation":[{"name":"Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, No. 579, Qianwangang Road, Huangdao District, Qingdao 266590, Shandong Province, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shandong Province Key Laboratory of Wisdom Mine Information Technology, College of Computer Science and Engineering, Shandong University of Science and Technology, No. 579, Qianwangang Road, Huangdao District, Qingdao 266590, Shandong Province, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"2021101410085097900_ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","article-title":"Vital nodes identification in complex networks","volume":"650","author":"L\u00fc","year":"2016","journal-title":"Phys. Rep."},{"key":"2021101410085097900_ref2","doi-asserted-by":"crossref","first-page":"1750243","DOI":"10.1142\/S0217984917502438","article-title":"A new method to identify influential nodes based on combining of existing centrality measures","volume":"31","author":"Fei","year":"2017","journal-title":"Mod. Phys. Lett. B."},{"key":"2021101410085097900_ref3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.cnsns.2016.11.008","article-title":"A new measure of identifying influential nodes: Efficiency centrality","volume":"47","author":"Wang","year":"2017","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"2021101410085097900_ref4","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1016\/j.physa.2009.10.034","article-title":"A study of the spreading scheme for viral marketing based on a complex network model","volume":"389","author":"Yang","year":"2010","journal-title":"Physica A"},{"key":"2021101410085097900_ref5","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":"2021101410085097900_ref6","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1016\/j.physleta.2017.01.043","article-title":"Identifying multiple influential spreaders by a heuristic clustering algorithm","volume":"381","author":"Bao","year":"2017","journal-title":"Phys. Lett. A."},{"key":"2021101410085097900_ref7","doi-asserted-by":"crossref","first-page":"e77455","DOI":"10.1371\/journal.pone.0077455","article-title":"Identifying influential nodes in large-scale directed networks: The role of clustering","volume":"8","author":"Chen","year":"2013","journal-title":"PLoS One"},{"key":"2021101410085097900_ref8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.knosys.2013.01.017","article-title":"Identifying influential nodes in complex networks with community structure","volume":"42","author":"Zhang","year":"2013","journal-title":"Knowledge-Based Syst."},{"key":"2021101410085097900_ref9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.plrev.2015.07.006","article-title":"Coupled disease\u2013behavior dynamics on complex networks: A review","volume":"15","author":"Wang","year":"2015","journal-title":"Phys. Life Rev."},{"key":"2021101410085097900_ref10","doi-asserted-by":"crossref","first-page":"58002","DOI":"10.1209\/0295-5075\/103\/58002","article-title":"Analysis of stability of community structure across multiple hierarchical levels","volume":"103","author":"Li","year":"2013","journal-title":"EPL (Europhys. Lett.)."},{"key":"2021101410085097900_ref11","doi-asserted-by":"crossref","first-page":"19307","DOI":"10.1038\/srep19307","article-title":"Locating influential nodes in complex networks","volume":"6","author":"Malliaros","year":"2016","journal-title":"Sci. Rep."},{"key":"2021101410085097900_ref12","doi-asserted-by":"crossref","first-page":"18001","DOI":"10.1209\/0295-5075\/118\/18001","article-title":"Promoting information spreading by using contact memory","volume":"118","author":"Gao","year":"2017","journal-title":"EPL"},{"key":"2021101410085097900_ref13","doi-asserted-by":"crossref","first-page":"033120","DOI":"10.1063\/1.5055069","article-title":"Identifying influential spreaders in complex networks by propagation probability dynamics","volume":"29","author":"Chen","year":"2019","journal-title":"Chaos"},{"key":"2021101410085097900_ref14","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1177\/0165551516644171","article-title":"Identification of multi-spreader users in social networks for viral marketing","volume":"43","author":"Sheikhahmadi","year":"2017","journal-title":"J. Inf. Sci."},{"key":"2021101410085097900_ref15","doi-asserted-by":"crossref","first-page":"68006","DOI":"10.1209\/0295-5075\/104\/68006","article-title":"Path diversity improves the identification of influential spreaders","volume":"104","author":"Chen","year":"2014","journal-title":"EPL (Europhys. Lett.)"},{"key":"2021101410085097900_ref16","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":"Social Networks."},{"key":"2021101410085097900_ref17","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":"Social Networks."},{"key":"2021101410085097900_ref18","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":"2021101410085097900_ref19","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":"Physica A"},{"key":"2021101410085097900_ref20","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":"2021101410085097900_ref21","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. Stat. Mech. Appl."},{"key":"2021101410085097900_ref22","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":"Physica A"},{"key":"2021101410085097900_ref23","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":"Physica A"},{"key":"2021101410085097900_ref24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature"},{"key":"2021101410085097900_ref25","doi-asserted-by":"crossref","DOI":"10.1038\/srep05547","article-title":"Searching for superspreaders of information in real-world social media","volume":"4","author":"Pei","year":"2014","journal-title":"Sci. Rep."},{"key":"2021101410085097900_ref26","first-page":"306","article-title":"The mathematical theory of communication. 1963","volume":"14","author":"Shannon","year":"1997","journal-title":"M.D. Comput."},{"key":"2021101410085097900_ref27","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/j.1538-7305.1951.tb01366.x","article-title":"Prediction and entropy of printed English","volume":"30","author":"Shannon","year":"1951","journal-title":"Bell Syst. Tech. J."},{"key":"2021101410085097900_ref28","doi-asserted-by":"crossref","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","article-title":"Epidemic spreading in scale-free networks","volume":"86","author":"Pastor-Satorras","year":"2001","journal-title":"Phys. Rev. Lett."},{"key":"2021101410085097900_ref29","doi-asserted-by":"crossref","first-page":"016128","DOI":"10.1103\/PhysRevE.66.016128","article-title":"Spread of epidemic disease on networks","volume":"66","author":"Newman","year":"2002","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"2021101410085097900_ref30","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"},{"key":"2021101410085097900_ref31","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF02476438","article-title":"Structural parameters of communication networks","volume":"15","author":"Shimbel","year":"1953","journal-title":"Bull. Math. Biophys."},{"key":"2021101410085097900_ref32","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":"2021101410085097900_ref33","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":"Physica A"},{"key":"2021101410085097900_ref34","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":"2021101410085097900_ref35","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":"Physica A"},{"key":"2021101410085097900_ref36","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":"2017","journal-title":"Expert Syst. Appl."},{"key":"2021101410085097900_ref37","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.chaos.2017.09.010","article-title":"Influential nodes ranking in complex networks: An entropy-based approach","volume":"104","author":"Zareie","year":"2017","journal-title":"Chaos Solitons Fractals"},{"key":"2021101410085097900_ref38","doi-asserted-by":"crossref","first-page":"242","DOI":"10.3390\/e22020242","article-title":"Influential nodes identification in complex networks via information entropy","volume":"22","author":"Guo","year":"2020","journal-title":"Entropy"},{"key":"2021101410085097900_ref39","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. Modern Phys. B"},{"key":"2021101410085097900_ref40","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.future.2018.11.023","article-title":"Influential node ranking in social networks based on neighborhood diversity","volume":"94","author":"Zareie","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"2021101410085097900_ref41","article-title":"Authoritative sources in a hyperlinked environment","author":"Kleinberg","year":"1998","journal-title":"Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"2021101410085097900_ref42","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0034-4877(71)90002-4","article-title":"Weighted entropy","volume":"3","author":"Guia\u015fu","year":"1971","journal-title":"Rep. Math. Phys."},{"key":"2021101410085097900_ref43","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","article-title":"A new measure of rank correlation","volume":"30","author":"Kendall","year":"1938","journal-title":"Biometrika"},{"key":"2021101410085097900_ref44","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1093\/biomet\/33.3.239","article-title":"The treatment of ties in ranking problems","volume":"33","author":"Kendall","year":"1945","journal-title":"Biometrika"},{"key":"2021101410085097900_ref45","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1080\/01621459.1966.10480879","article-title":"A computer method for calculating Kendall\u2019s tau with ungrouped data","volume":"61","author":"Knight","year":"1966","journal-title":"Publ. Am. Stat. Assoc."},{"key":"2021101410085097900_ref46","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","article-title":"Maximizing the spread of influence ranking in social networks","volume":"278","author":"Zhu","year":"2014","journal-title":"Inform. Sci."},{"key":"2021101410085097900_ref47","doi-asserted-by":"crossref","first-page":"2171","DOI":"10.1038\/srep02171","article-title":"Global efficiency of local immunization on complex networks","volume":"3","author":"H\u00e9bert-Dufresne","year":"2013","journal-title":"Sci. Rep."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/10\/1465\/40634997\/bxab034.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/10\/1465\/40634997\/bxab034.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T11:45:33Z","timestamp":1698061533000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/64\/10\/1465\/6284270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":47,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2021,6,15]]},"published-print":{"date-parts":[[2021,10,13]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab034","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2021,10]]},"published":{"date-parts":[[2021,6,15]]}}}