{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:42:33Z","timestamp":1776750153262,"version":"3.51.2"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2022YFC3302600"],"award-info":[{"award-number":["No.2022YFC3302600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2022YFC3302600"],"award-info":[{"award-number":["No.2022YFC3302600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2022YFC3302600"],"award-info":[{"award-number":["No.2022YFC3302600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2022YFC3302600"],"award-info":[{"award-number":["No.2022YFC3302600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2022YFC3302600"],"award-info":[{"award-number":["No.2022YFC3302600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10586-025-05448-0","type":"journal-article","created":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T12:46:16Z","timestamp":1757594776000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["HHGNN: a novel framework for node influence ranking in heterogeneous networks"],"prefix":"10.1007","volume":"28","author":[{"given":"Zhongming","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiwen","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziying","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqi","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"5448_CR1","doi-asserted-by":"publisher","unstructured":"Dong, Y., Chawla, N.V., Swami, A.: Metapath2vec: scalable representation learning for heterogeneous networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '17). Association for Computing Machinery, pp. 135\u2013144 (2017). https:\/\/doi.org\/10.1145\/3097983.3098036","DOI":"10.1145\/3097983.3098036"},{"key":"5448_CR2","doi-asserted-by":"publisher","unstructured":"Fu, X., Zhang, J., Meng, Z., King, I.: MAGNN: metapath aggregated graph neural network for heterogeneous graph embedding. In: Proceedings of the Web Conference 2020 (WWW '20). Association for Computing Machinery, pp. 2331\u20132341 (2020). https:\/\/doi.org\/10.1145\/3366423.3380297","DOI":"10.1145\/3366423.3380297"},{"key":"5448_CR3","doi-asserted-by":"publisher","unstructured":"Wang, X., Ji, H., Shi, C., Wang, B., Ye, Y., Cui, P., Yu, P.S.: Heterogeneous graph attention network. In: The World Wide Web Conference (WWW '19). Association for Computing Machinery, pp. 2022\u20132032 (2019). https:\/\/doi.org\/10.1145\/3308558.3313562","DOI":"10.1145\/3308558.3313562"},{"key":"5448_CR4","doi-asserted-by":"publisher","unstructured":"Hu, Z., Dong, Y., Wang, K., Sun, Y.: Heterogeneous graph transformer. In: Proceedings of the Web Conference 2020 (WWW '20). Association for Computing Machinery, pp. 2704\u20132710 (2020). https:\/\/doi.org\/10.1145\/3366423.3380027","DOI":"10.1145\/3366423.3380027"},{"key":"5448_CR5","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS'17), pp. 1025\u20131035 (2017)"},{"issue":"2","key":"5448_CR6","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ipm.2007.06.006","volume":"44","author":"N Ma","year":"1999","unstructured":"Ma, N., Guan, J., Zhao, Y.: Bringing PageRank to the citation analysis. Inf. Process. Manag. 44(2), 800\u2013810 (1999)","journal-title":"Inf. Process. Manag."},{"issue":"1","key":"5448_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. J. Math. Sociol. 2(1), 113\u2013120 (1972)","journal-title":"J. Math. Sociol."},{"issue":"1","key":"5448_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977). https:\/\/doi.org\/10.2307\/3033543","journal-title":"Sociometry"},{"issue":"11","key":"5448_CR9","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888\u2013893 (2010)","journal-title":"Nat. Phys."},{"key":"5448_CR10","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"5448_CR11","doi-asserted-by":"publisher","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09). Association for Computing Machinery, pp. 199\u2013208 (2009). https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"5448_CR12","doi-asserted-by":"crossref","unstructured":"Zhou, D., Orshanskiy, S. A., Zha, H., Giles, C.L.: Co-ranking authors and documents in a heterogeneous network. In Seventh IEEE International Conference on Data Mining (ICDM 2007), pp. 739\u2013744 (2007)","DOI":"10.1109\/ICDM.2007.57"},{"key":"5448_CR13","doi-asserted-by":"publisher","first-page":"113580","DOI":"10.1016\/j.eswa.2020.113580","volume":"160","author":"S Molaei","year":"2020","unstructured":"Molaei, S., Farahbakhsh, R., Salehi, M., Crespi, N.: Identifying influential nodes in heterogeneous networks. Expert Syst. Appl. 160, 113580 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"5448_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R Lempel","year":"2001","unstructured":"Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. 19(2), 131\u2013160 (2001). https:\/\/doi.org\/10.1145\/382979.383041","journal-title":"ACM Trans. Inf. Syst."},{"key":"5448_CR15","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. ACM 46, 604\u2013632 (1999). https:\/\/doi.org\/10.1145\/324133.324140","journal-title":"ACM"},{"key":"5448_CR16","doi-asserted-by":"publisher","unstructured":"Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '02). Association for Computing Machinery, pp. 538\u2013543 (2002). https:\/\/doi.org\/10.1145\/775047.775126","DOI":"10.1145\/775047.775126"},{"key":"5448_CR17","unstructured":"Yun, S., Jeong, M., Kim, R., Kang, J., Kim, H.J: Graph transformer networks. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems. Curran Associates Inc., vol. 1073, pp. 11983\u201311993 (2019)"},{"key":"5448_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, C., Song, D., Huang, C., Swami, A., Chawla, N.V.: Heterogeneous graph neural network. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 793\u2013803 (2019)","DOI":"10.1145\/3292500.3330961"},{"key":"5448_CR19","doi-asserted-by":"crossref","unstructured":"Linmei, H., Yang, T., Shi, C., Ji, H., Li, X.: Heterogeneous graph attention networks for semi-supervised short text classification. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pp. 4821\u20134830 (2019)","DOI":"10.18653\/v1\/D19-1488"},{"key":"5448_CR20","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.ins.2022.07.084","volume":"609","author":"J Zhao","year":"2022","unstructured":"Zhao, J., Wen, T., Jahanshahi, H., Cheong, K.H.: The random walk-based gravity model to identify influential nodes in complex networks. Inf. Sci. 609, 1706\u20131720 (2022)","journal-title":"Inf. Sci."},{"key":"5448_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107198","volume":"227","author":"X Yang","year":"2021","unstructured":"Yang, X., Xiao, F.: An improved gravity model to identify influential nodes in complex networks based on k-shell method. Knowl. Based Syst. 227, 107198 (2021)","journal-title":"Knowl. Based Syst."},{"key":"5448_CR22","doi-asserted-by":"crossref","unstructured":"Geng, H., Wang, D., Zhuang, F., Ming, X., Du, C., Jiang, T., Liu, R.: Modeling dynamic heterogeneous graph and node importance for future citation prediction. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp. 572\u2013581 (2022)","DOI":"10.1145\/3511808.3557398"},{"key":"5448_CR23","doi-asserted-by":"crossref","unstructured":"Fu, T.Y., Lee, W.C., Lei, Z.: Hin2vec: explore meta-paths in heterogeneous information networks for representation learning. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 1797\u20131806 (2017)","DOI":"10.1145\/3132847.3132953"},{"key":"5448_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.neucom.2022.05.010","volume":"497","author":"M Zhang","year":"2022","unstructured":"Zhang, M., Wang, X., Jin, L., Song, M., Li, Z.: A new approach for evaluating node importance in complex networks via deep learning methods. Neurocomputing 497, 13\u201327 (2022)","journal-title":"Neurocomputing"},{"key":"5448_CR25","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2020.07.028","volume":"414","author":"G Zhao","year":"2020","unstructured":"Zhao, G., Jia, P., Zhou, A., Zhang, B.: InfGCN: Identifying influential nodes in complex networks with graph convolutional networks. Neurocomputing 414, 18\u201326 (2020)","journal-title":"Neurocomputing"},{"key":"5448_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121154","volume":"235","author":"G Xu","year":"2024","unstructured":"Xu, G., Dong, C.: CAGM: a communicability-based adaptive gravity model for influential nodes identification in complex networks. Expert Syst. Appl. 235, 121154 (2024)","journal-title":"Expert Syst. Appl."},{"key":"5448_CR27","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/s41467-023-44257-0","volume":"15","author":"M Engsig","year":"2024","unstructured":"Engsig, M., Tejedor, A., Moreno, Y., et al.: DomiRank centrality reveals structural fragility of complex networks via node dominance. Nat. Commun. 15, 56 (2024)","journal-title":"Nat. Commun."},{"key":"5448_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2023.129339","volume":"632","author":"H Qu","year":"2023","unstructured":"Qu, H., Song, Y.R., Li, R., Li, M.: GNR: a universal and efficient node ranking model for various tasks based on graph neural networks. Physica A 632, 129339 (2023)","journal-title":"Physica A"},{"key":"5448_CR29","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks (2016). arXiv:1609.02907"},{"key":"5448_CR30","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks (2017). arXiv:1710.10903"},{"key":"5448_CR31","unstructured":"Liu, Z., Wang, Y., Vaidya, S., Ruehle, F., Halverson, J., Solja\u010di\u0107, M., Tegmark, M.: Kan: Kolmogorov-arnold networks (2024). arXiv:2404.19756"},{"key":"5448_CR32","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.future.2023.05.026","volume":"148","author":"Z Han","year":"2023","unstructured":"Han, Z., Jin, X., Xing, H., Yang, W., Xiong, H.: An effective heterogeneous information network representation learning framework. Future Gener. Comput. Syst. 148, 66\u201378 (2023)","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"5448_CR33","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s11431-020-1683-2","volume":"64","author":"J Liu","year":"2021","unstructured":"Liu, J., Li, X., Dong, J.: A survey on network node ranking algorithms: representative methods, extensions, and applications. Sci. China Technol. Sci. 64(3), 451\u2013461 (2021)","journal-title":"Sci. China Technol. Sci."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05448-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05448-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05448-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T17:32:15Z","timestamp":1759944735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05448-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"references-count":33,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["5448"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05448-0","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"13 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no potential conflict of interest or conflicting relationships in this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Relevant ethical guidelines and regulations were followed in conducting this study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"731"}}