{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:46:27Z","timestamp":1761396387695,"version":"build-2065373602"},"reference-count":46,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T00:00:00Z","timestamp":1665792000000},"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":["61966039"],"award-info":[{"award-number":["61966039"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Due to their wide application in many disciplines, how to make an efficient ranking for nodes, especially for nodes in graph data, has aroused lots of attention. To overcome the shortcoming that most traditional ranking methods only consider the mutual influence between nodes but ignore the influence of edges, this paper proposes a self-information weighting-based method to rank all nodes in graph data. In the first place, the graph data are weighted by regarding the self-information of edges in terms of node degree. On this base, the information entropy of nodes is constructed to measure the importance of each node and in which case all nodes can be ranked. To verify the effectiveness of this proposed ranking method, we compare it with six existing methods on nine real-world datasets. The experimental results show that our method performs well on all of these nine datasets, especially for datasets with more nodes.<\/jats:p>","DOI":"10.3390\/e24101471","type":"journal-article","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:04:55Z","timestamp":1665965095000},"page":"1471","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4442-5057","authenticated-orcid":false,"given":"Shihu","family":"Liu","sequence":"first","affiliation":[{"name":"School of Mathematics and Computer Sciences, Yunnan Minzu University, Kunming 650504, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyan","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Sciences, Yunnan Minzu University, Kunming 650504, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s11431-020-1683-2","article-title":"A survey on network node ranking algorithms: Representative methods, extensions, and applications","volume":"64","author":"Liu","year":"2021","journal-title":"Sci. China Technol. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"026116","DOI":"10.1103\/PhysRevE.85.026116","article-title":"Absence of influential spreaders in rumor dynamics","volume":"85","author":"Moreno","year":"2012","journal-title":"Phys. Rev. E"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.comcom.2021.10.041","article-title":"Fast controlling of rumors with limited cost in social networks","volume":"182","author":"Yao","year":"2022","journal-title":"Comput. Commun."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1103\/RevModPhys.87.925","article-title":"Epidemic processes in complex networks","volume":"87","author":"Castellano","year":"2015","journal-title":"Rev. Mod. Phys."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"036603","DOI":"10.1088\/1361-6633\/aa5398","article-title":"Unification of theoretical approaches for epidemic spreading on complex networks","volume":"80","author":"Wang","year":"2017","journal-title":"Rep. Prog. Phys."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"033113","DOI":"10.1063\/1.4890612","article-title":"Efficient allocation of heterogeneous response times in information spreading process","volume":"24","author":"Cui","year":"2014","journal-title":"Chaos Interdiscip. J. Nonlinear Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1038\/s41567-020-0810-3","article-title":"Phase transitions in information spreading on structured populations","volume":"16","author":"Davis","year":"2020","journal-title":"Nat. Phys."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.ins.2019.10.003","article-title":"Identification of influencers in complex networks by local information dimensionality","volume":"512","author":"Wen","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_9","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":"ref_10","doi-asserted-by":"crossref","first-page":"088903","DOI":"10.1088\/1674-1056\/ab969f","article-title":"Influential nodes identification in complex networks based on global and local information","volume":"29","author":"Yang","year":"2020","journal-title":"Chin. Phys. B"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"115061","DOI":"10.1016\/j.eswa.2021.115061","article-title":"Identifying and ranking super spreaders in real world complex networks without influence overlap","volume":"179","author":"Maji","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"109220","DOI":"10.1016\/j.knosys.2022.109220","article-title":"Learning to rank complex network node based on the self-supervised graph convolution model","volume":"251","author":"Liu","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"ref_13","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_14","doi-asserted-by":"crossref","first-page":"2150251","DOI":"10.1142\/S0217979221502519","article-title":"A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition","volume":"35","author":"Lu","year":"2021","journal-title":"Int. J. Mod. Phys. B"},{"key":"ref_15","first-page":"1","article-title":"Identifying a set of influential spreaders in complex networks","volume":"6","author":"Zhang","year":"2016","journal-title":"Sci. Rep."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"033131","DOI":"10.1063\/1.4818544","article-title":"Eigenvector centrality of nodes in multiplex networks","volume":"23","author":"Sola","year":"2013","journal-title":"Chaos Interdiscip. J. Nonlinear Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.physa.2015.03.042","article-title":"Using global diversity and local topology features to identify influential network spreaders","volume":"433","author":"Fu","year":"2015","journal-title":"Phys. Stat. Mech. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.3389\/fpsyg.2017.01683","article-title":"The influence of closeness centrality on lexical processing","volume":"8","author":"Goldstein","year":"2017","journal-title":"Front. Psychol."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"105717","DOI":"10.1016\/j.knosys.2020.105717","article-title":"Vital spreaders identification in complex networks with multi-local dimension","volume":"195","author":"Wen","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"11150","DOI":"10.1073\/pnas.0701175104","article-title":"A model of Internet topology using k-shell decomposition","volume":"104","author":"Carmi","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Zhu, D., Wang, H., Wang, R., Duan, J., and Bai, J. (2022). Identification of Key Nodes in a Power Grid Based on Modified PageRank Algorithm. Energies, 15.","DOI":"10.3390\/en15030797"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"124137","DOI":"10.1016\/j.physa.2020.124137","article-title":"Label propagation algorithm based on node importance","volume":"551","author":"Wang","year":"2020","journal-title":"Phys. Stat. Mech. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1850216","DOI":"10.1142\/S0217984918502160","article-title":"A dynamic weighted TOPSIS method for identifying influential nodes in complex networks","volume":"32","author":"Yang","year":"2018","journal-title":"Mod. Phys. Lett. B"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.ijar.2020.04.008","article-title":"Entropy and monotonicity in artificial intelligence","volume":"124","author":"Marsala","year":"2020","journal-title":"Int. J. Approx. Reason."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"065201","DOI":"10.1088\/0031-8949\/88\/06\/065201","article-title":"Identifying node importance based on information entropy in complex networks","volume":"88","author":"Fan","year":"2013","journal-title":"Phys. Scr."},{"key":"ref_26","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_27","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_28","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":"ref_29","doi-asserted-by":"crossref","unstructured":"Ai, X. (2017). Node importance ranking of complex networks with entropy variation. Entropy, 19.","DOI":"10.3390\/e19070303"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Chen, X., Zhou, J., Liao, Z., Liu, S., and Zhang, Y. (2020). A novel method to rank influential nodes in complex networks based on tsallis entropy. Entropy, 22.","DOI":"10.3390\/e22080848"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.chaos.2017.08.010","article-title":"A new method to identify influential nodes based on relative entropy","volume":"104","author":"Fei","year":"2017","journal-title":"Chaos Solitons Fractals"},{"key":"ref_32","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_33","doi-asserted-by":"crossref","first-page":"3981","DOI":"10.1007\/s10586-018-2580-6","article-title":"Importance-based entropy measures of complex networks robustness to attacks","volume":"22","author":"Jiang","year":"2019","journal-title":"Clust. Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.21629\/JSEE.2016.06.10","article-title":"Integrated evaluation approach for node importance of complex networks based on relative entropy","volume":"27","author":"Chen","year":"2016","journal-title":"J. Syst. Eng. Electron."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Li, J., Yin, C., Wang, H., Wang, J., and Zhao, N. (2022). Mining Algorithm of Relatively Important Nodes Based on Edge Importance Greedy Strategy. Appl. Sci., 12.","DOI":"10.3390\/app12126099"},{"key":"ref_36","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":"ref_37","doi-asserted-by":"crossref","first-page":"2150620","DOI":"10.1142\/S021798492150620X","article-title":"Critical nodes identification in complex networks via similarity coefficient","volume":"36","author":"Lu","year":"2022","journal-title":"Mod. Phys. Lett. B"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"124229","DOI":"10.1016\/j.physa.2020.124229","article-title":"Identifying influential spreaders in complex networks based on improved k-shell method","volume":"554","author":"Wang","year":"2020","journal-title":"Phys. Stat. Mech. Appl."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1016\/j.ins.2022.07.030","article-title":"Link prediction algorithm based on the initial information contribution of nodes","volume":"608","author":"Liu","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Gray, R.M. (2011). Entropy and Information Theory, Springer Science.","DOI":"10.1007\/978-1-4419-7970-4"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0167-2681(02)00056-2","article-title":"Modularity in technology and organization","volume":"49","author":"Langlois","year":"2002","journal-title":"J. Econ. Behav. Organ."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"117452","DOI":"10.1016\/j.eswa.2022.117452","article-title":"The role of influential nodes and their influence domain in community detection: An approximate method for maximizing modularity","volume":"202","author":"Boroujeni","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.envsoft.2015.01.004","article-title":"A simple and efficient method for global sensitivity analysis based on cumulative distribution functions","volume":"67","author":"Pianosi","year":"2015","journal-title":"Environ. Model. Softw."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"132540","DOI":"10.1016\/j.physd.2020.132540","article-title":"Accurate closed-form solution of the SIR epidemic model","volume":"408","author":"Barlow","year":"2020","journal-title":"Phys. Nonlinear Phenom."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.apm.2020.08.057","article-title":"Analytical features of the SIR model and their applications to COVID-19","volume":"90","author":"Kudryashov","year":"2021","journal-title":"Appl. Math. Model."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Sheng, J., Zhu, J., Wang, Y., Wang, B., and Hou, Z. (2020). Identifying influential nodes of complex networks based on trust-value. Algorithms, 13.","DOI":"10.3390\/a13110280"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/10\/1471\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:54:42Z","timestamp":1760144082000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/10\/1471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,15]]},"references-count":46,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["e24101471"],"URL":"https:\/\/doi.org\/10.3390\/e24101471","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,10,15]]}}}