{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T14:58:54Z","timestamp":1773413934096,"version":"3.50.1"},"reference-count":32,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T00:00:00Z","timestamp":1723248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100011477","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["314"],"award-info":[{"award-number":["314"]}],"id":[{"id":"10.13039\/501100011477","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011477","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2024-SKL-005"],"award-info":[{"award-number":["2024-SKL-005"]}],"id":[{"id":"10.13039\/501100011477","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011477","name":"State Key Laboratory Program","doi-asserted-by":"publisher","award":["314"],"award-info":[{"award-number":["314"]}],"id":[{"id":"10.13039\/501100011477","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011477","name":"State Key Laboratory Program","doi-asserted-by":"publisher","award":["2024-SKL-005"],"award-info":[{"award-number":["2024-SKL-005"]}],"id":[{"id":"10.13039\/501100011477","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The accurate assessment of node influence is of vital significance for enhancing system stability. Given the structural redundancy problem triggered by the network topology deviation when an empirical network is copied, as well as the dynamic characteristics of the empirical network itself, it is difficult for traditional static assessment methods to effectively capture the dynamic evolution of node influence. Therefore, we propose a heuristic-based spatiotemporal feature node influence assessment model (HEIST). First, the zero-model method is applied to optimize the network-copying process and reduce the noise interference caused by network structure redundancy. Second, the copied network is divided into subnets, and feature modeling is performed to enhance the node influence differentiation. Third, node influence is quantified based on the spatiotemporal depth-perception module, which has a built-in local and global two-layer structure. At the local level, a graph convolutional neural network (GCN) is used to improve the spatial perception of node influence; it fuses the feature changes of the nodes in the subnetwork variation, combining this method with a long- and short-term memory network (LSTM) to enhance its ability to capture the depth evolution of node influence and improve the robustness of the assessment. Finally, a heuristic assessment algorithm is used to jointly optimize the influence strength of the nodes at different stages and quantify the node influence via a nonlinear optimization function. The experiments show that the Kendall coefficients exceed 90% in multiple datasets, proving that the model has good generalization performance in empirical networks.<\/jats:p>","DOI":"10.3390\/e26080676","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T11:23:46Z","timestamp":1723461826000},"page":"676","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Evaluation Model for Node Influence Based on Heuristic Spatiotemporal Features"],"prefix":"10.3390","volume":"26","author":[{"given":"Sheng","family":"Jin","sequence":"first","affiliation":[{"name":"School of Computer Science, Qinghai Normal University, Xining 810016, China"},{"name":"Qinghai Provincial Key Laboratory of Tibetan Information Processing and Machine Translation, Qinghai Normal University, Xining 810008, China"},{"name":"Key Laboratory of Tibetan Information Processing of Ministry of Education, Qinghai Normal University, Xining 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhi","family":"Xiao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Qinghai Normal University, Xining 810016, China"},{"name":"Qinghai Provincial Key Laboratory of Tibetan Information Processing and Machine Translation, Qinghai Normal University, Xining 810008, China"},{"name":"Key Laboratory of Tibetan Information Processing of Ministry of Education, Qinghai Normal University, Xining 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxin","family":"Han","sequence":"additional","affiliation":[{"name":"School of Computer Science, Qinghai Normal University, Xining 810016, China"},{"name":"Qinghai Provincial Key Laboratory of Tibetan Information Processing and Machine Translation, Qinghai Normal University, Xining 810008, China"},{"name":"Key Laboratory of Tibetan Information Processing of Ministry of Education, Qinghai Normal University, Xining 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Qinghai Normal University, Xining 810016, China"},{"name":"Qinghai Provincial Key Laboratory of Tibetan Information Processing and Machine Translation, Qinghai Normal University, Xining 810008, China"},{"name":"Key Laboratory of Tibetan Information Processing of Ministry of Education, Qinghai Normal University, Xining 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,8,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1016\/j.compeleceng.2018.03.012","article-title":"Overlapping community detection using superior seed set selection in social networks","volume":"70","author":"Belfin","year":"2018","journal-title":"Comput. Electr. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"104689","DOI":"10.1016\/j.micpro.2022.104689","article-title":"Dynamic node influence tracking based influence maximization on dynamic social networks","volume":"95","author":"Chandran","year":"2022","journal-title":"Microprocess. Microsyst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"104635","DOI":"10.1016\/j.tust.2022.104635","article-title":"Route choice and parallel routes in subway Networks: A comparative analysis of Beijing and Shanghai","volume":"128","author":"Huang","year":"2022","journal-title":"Tunn. Undergr. Space Technol."},{"key":"ref_4","first-page":"33","article-title":"Contributions to the mathematical theory of epidemics--I. 1927","volume":"53","author":"Kermack","year":"1991","journal-title":"Bull. Math. Biol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"103155","DOI":"10.1016\/j.ijdrr.2022.103155","article-title":"Risk identification of major infectious disease epidemics based on complex network theory","volume":"78","author":"Fu","year":"2022","journal-title":"Int. J. Disaster Risk Reduct."},{"key":"ref_6","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":"ref_7","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_8","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/JETCAS.2023.3283680","article-title":"Identification of influential nodes in complex networks with degree and average neighbor degree","volume":"13","author":"Chen","year":"2023","journal-title":"IEEE J. Emerg. Sel. Top. Circuits Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1016\/j.cam.2017.05.019","article-title":"On eigenvector-like centralities for temporal networks: Discrete vs. continuous time scales","volume":"330","author":"Flores","year":"2018","journal-title":"J. Comput. Appl. Math."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"3284","DOI":"10.1109\/TFUZZ.2021.3112226","article-title":"LFIC: Identifying influential nodes in complex networks by local fuzzy information centrality","volume":"30","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_11","first-page":"226","article-title":"Ranking and Recognition of Influential Nodes Based on k-shell Entropy","volume":"49","author":"Yuan","year":"2022","journal-title":"Comput. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"107198","DOI":"10.1016\/j.knosys.2021.107198","article-title":"An improved gravity model to identify in-fluential nodes in complex networks based on K-shell method","volume":"227","author":"Yang","year":"2021","journal-title":"Knowl. Based Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11128-020-02650-4","article-title":"Discrete-time quantum walk algorithm for ranking nodes on a network","volume":"19","author":"Chawla","year":"2020","journal-title":"Quantum Inf. Process."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"129194","DOI":"10.1016\/j.physa.2023.129194","article-title":"A novel higher-order neural network framework based on motifs attention for identifying critical nodes","volume":"629","author":"Zhao","year":"2023","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Yang, S., Zhu, W., Zhang, K., Diao, Y., and Bai, Y. (2024). Influence Maximization in Temporal Social Networks with the Mixed K-Shell Method. Electronics, 13.","DOI":"10.3390\/electronics13132533"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Xi, Y., and Cui, X. (2023). Identifying Influential Nodes in Complex Networks Based on Information Entropy and Relationship Strength. Entropy, 25.","DOI":"10.3390\/e25050754"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Yu, Y., Zhou, B., Chen, L., Gao, T., and Liu, J. (2022). Identifying Important Nodes in Complex Networks Based on Node Propagation Entropy. Entropy, 24.","DOI":"10.3390\/e24020275"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.54254\/2755-2721\/60\/20240842","article-title":"Key Nodes Identification Method Based on Neighborhood K-shell Distribution","volume":"60","author":"Wu","year":"2024","journal-title":"Comput. Eng. Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.neucom.2018.07.044","article-title":"Detection of spam-posting accounts on Twitter","volume":"315","author":"Liptrott","year":"2018","journal-title":"Neurocomputing"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"65462","DOI":"10.1109\/ACCESS.2020.2984286","article-title":"A machine learning based framework for identifying influential nodes in complex networks","volume":"8","author":"Zhao","year":"2020","journal-title":"IEEE Access"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.physa.2018.03.076","article-title":"Fast ranking nodes importance in complex networks based on LS-SVM method","volume":"506","author":"Wen","year":"2018","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"4394","DOI":"10.1007\/s10489-020-02132-1","article-title":"Ranking influential nodes in complex networks based on local and global structures","volume":"51","author":"Qiu","year":"2021","journal-title":"Appl. Intell."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.neucom.2022.05.010","article-title":"A new approach for evaluating node importance in complex networks via deep learning methods","volume":"497","author":"Zhang","year":"2022","journal-title":"Neurocomputing"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Fan, C., Zeng, L., Ding, Y., Chen, M., Sun, Y., and Liu, Z. (2019, January 3\u20137). Learning to identify high betweenness centrality nodes from scratch: A novel graph neural network approach. Proceedings of the 28th ACM International Conference on Information and Knowledge Management, Beijing, China.","DOI":"10.1145\/3357384.3357979"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.neucom.2020.07.028","article-title":"InfGCN: Identifying influential nodes in complex networks with graph convolutional networks","volume":"414","author":"Zhao","year":"2020","journal-title":"Neurocomputing"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"129339","DOI":"10.1016\/j.physa.2023.129339","article-title":"GNR: A universal and efficient node ranking model for various tasks based on graph neural networks","volume":"632","author":"Qu","year":"2023","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_27","unstructured":"Hamilton, W.L., Ying, R., and Leskovec, J. (2017, January 4\u20139). Inductive Representation Learning on Large Graphs. Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS\u201917), Long Beach, CA, USA."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"118770","DOI":"10.1016\/j.eswa.2022.118770","article-title":"Influence maximization in social networks using transfer learning via graph-based LSTM","volume":"212","author":"Kumar","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Zhu, J., and Wang, L. (2021). Identifying influential nodes in complex networks based on node itself and neighbor layer information. Symmetry, 13.","DOI":"10.3390\/sym13091570"},{"key":"ref_30","first-page":"106","article-title":"Node Influence Ranking Model Based on Transformer","volume":"51","author":"Xi","year":"2024","journal-title":"Comput. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., and Markopoulou, A. (2013, January 14\u201319). 2.5 k-graphs: From Sampling to Generation. Proceedings of the 32nd IEEE International Conference on Computer Communications, Turin, Italy.","DOI":"10.1109\/INFCOM.2013.6566997"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Mahadevan, P., Hubble, C., Krioukov, D., Huffaker, B., and Vahdat, A. (2007, January 27\u201331). Orbis: Rescaling degree correlations to generate annotated internet topologies. Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Kyoto, Japan.","DOI":"10.1145\/1282380.1282417"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/8\/676\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:34:23Z","timestamp":1760110463000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/8\/676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,10]]},"references-count":32,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["e26080676"],"URL":"https:\/\/doi.org\/10.3390\/e26080676","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,10]]}}}