{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T06:59:32Z","timestamp":1777273172347,"version":"3.51.4"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"34","license":[{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["IITP-2024-2020-0-01795"],"award-info":[{"award-number":["IITP-2024-2020-0-01795"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korea Advanced Institute of Science and Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Graph neural networks (GNNs) have seen significant growth in analyzing heterogeneous graphs, which contain different types of nodes and connections. Recent studies have attempted to analyze heterogeneous graphs without relying on manually selected metapaths. However, existing methods often struggle to learn long-range dependencies between distant nodes because of over-squashing and over-smoothing. This paper presents a new approach, type-aligning graph diffusion network (TAGDN), that effectively addresses these challenges. Our main idea is to boost the power of graph diffusion techniques in heterogeneous graphs with a type-adaptive alignment scheme. This approach allows us to exploit long-range dependencies between nodes in heterogeneous graphs without suffering over-squashing and over-smoothing. Through extensive experiments, we show that TAGDN outperforms state-of-the-art heterogeneous GNNs on diverse graph analysis tasks. Ablation studies show that our alignment scheme enhances the capacity of graph diffusion networks in heterogeneous graph analysis, yielding an average improvement of 5.02% in node classification and 25.43% in node clustering. Our implementation is available at\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/SeongJinAhn\/TAGDN\" ext-link-type=\"uri\">https:\/\/github.com\/SeongJinAhn\/TAGDN<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1007\/s00521-025-11684-7","type":"journal-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T05:21:16Z","timestamp":1761110476000},"page":"28747-28777","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TAGDN: type-aligning graph diffusion network for capturing long-range dependencies in heterogeneous graphs without over-squashing and over-smoothing"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3435-9551","authenticated-orcid":false,"given":"Seong Jin","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5065-0226","authenticated-orcid":false,"given":"Min-Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4553-6904","authenticated-orcid":false,"given":"Myoung-Ho","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,22]]},"reference":[{"issue":"2","key":"11684_CR1","doi-asserted-by":"publisher","first-page":"102151","DOI":"10.1016\/j.ipm.2019.102151","volume":"57","author":"Y Qiao","year":"2020","unstructured":"Qiao Y, Luo X, Li C, Tian H, Ma J (2020) Heterogeneous graph-based joint representation learning for users and POIS in location-based social network. Inf Process Manage 57(2):102151","journal-title":"Inf Process Manage"},{"key":"11684_CR2","doi-asserted-by":"publisher","first-page":"106817","DOI":"10.1016\/j.knosys.2021.106817","volume":"217","author":"A Salamat","year":"2021","unstructured":"Salamat A, Luo X, Jafari A (2021) HeteroGraphRec: a heterogeneous graph-based neural networks for social recommendations. Knowl-Based Syst 217:106817","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"11684_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/bib\/bbab515","volume":"23","author":"B-W Zhao","year":"2022","unstructured":"Zhao B-W, Hu L, You Z-H, Wang L, Su X-R (2022) HINGRL: predicting drug-disease associations with graph representation learning on heterogeneous information networks. Brief Bioinf 23(1):515","journal-title":"Brief Bioinf"},{"issue":"6","key":"11684_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/bib\/bbab319","volume":"22","author":"L Cai","year":"2021","unstructured":"Cai L, Lu C, Xu J, Meng Y, Wang P, Fu X, Zeng X, Su Y (2021) Drug repositioning based on the heterogeneous information fusion graph convolutional network. Brief Bioinf 22(6):319","journal-title":"Brief Bioinf"},{"key":"11684_CR5","first-page":"103709","volume":"128","author":"J Chen","year":"2024","unstructured":"Chen J, Yang L, Qin C, Yang Y, Peng L, Ge X (2024) Heterogeneous graph traffic prediction considering spatial information around roads. Int J Appl Earth Obs Geoinf 128:103709","journal-title":"Int J Appl Earth Obs Geoinf"},{"key":"11684_CR6","doi-asserted-by":"publisher","first-page":"104695","DOI":"10.1016\/j.trc.2024.104695","volume":"165","author":"T Liu","year":"2024","unstructured":"Liu T, Meidani H (2024) End-to-end heterogeneous graph neural networks for traffic assignment. Transp Res Part C Emerg Technol 165:104695","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"2","key":"11684_CR7","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.eswa.2012.08.004","volume":"40","author":"S Lee","year":"2013","unstructured":"Lee S, Park S, Kahng M, Lee S (2013) PathRank: ranking nodes on a heterogeneous graph for flexible hybrid recommender systems. Expert Syst Appl 40(2):684\u2013697","journal-title":"Expert Syst Appl"},{"issue":"2","key":"11684_CR8","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TBDATA.2022.3177455","volume":"9","author":"X Wang","year":"2022","unstructured":"Wang X, Bo D, Shi C, Fan S, Ye Y, Philip SY (2022) A survey on heterogeneous graph embedding: methods, techniques, applications and sources. IEEE Trans Big Data 9(2):415\u2013436","journal-title":"IEEE Trans Big Data"},{"key":"11684_CR9","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, Van Den\u00a0Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. In: The semantic web: 15th international conference, ESWC 2018, Heraklion, Crete, Greece, June 3\u20137, 2018, Proceedings 15. Springer, pp 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"11684_CR10","doi-asserted-by":"crossref","unstructured":"Wang X, Ji H, Shi C, Wang B, Ye Y, Cui P, Yu PS (2019) Heterogeneous graph attention network. In: The world wide web conference, pp 2022\u20132032","DOI":"10.1145\/3308558.3313562"},{"key":"11684_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.neunet.2022.05.026","volume":"153","author":"S Yun","year":"2022","unstructured":"Yun S, Jeong M, Yoo S, Lee S, Sean SY, Kim R, Kang J, Kim HJ (2022) Graph transformer networks: learning meta-path graphs to improve GNNs. Neural Netw 153:104\u2013119","journal-title":"Neural Netw"},{"key":"11684_CR12","doi-asserted-by":"crossref","unstructured":"Yang Y, Guan Z, Li J, Zhao W, Cui J, Wang Q (2021) Interpretable and efficient heterogeneous graph convolutional network. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2021.3101356"},{"key":"11684_CR13","doi-asserted-by":"crossref","unstructured":"Tian Y, Dong K, Zhang C, Zhang C, Chawla NV (2023) Heterogeneous graph masked autoencoders. In: Proceedings of the AAAI conference on artificial intelligence, vol 37, pp 9997\u201310005","DOI":"10.1609\/aaai.v37i8.26192"},{"key":"11684_CR14","doi-asserted-by":"crossref","unstructured":"Yang X, Yan M, Pan S, Ye X, Fan D (2023) Simple and efficient heterogeneous graph neural network. In: Proceedings of the AAAI conference on artificial intelligence, vol 37, pp 10816\u201310824","DOI":"10.1609\/aaai.v37i9.26283"},{"key":"11684_CR15","doi-asserted-by":"crossref","unstructured":"Fu X, Zhang J, Meng Z, King I (2020) MAGNN: Metapath aggregated graph neural network for heterogeneous graph embedding. In: Proceedings of the web conference 2020, pp 2331\u20132341","DOI":"10.1145\/3366423.3380297"},{"key":"11684_CR16","doi-asserted-by":"crossref","unstructured":"Wang X, Liu N, Han H, Shi C (2021) Self-supervised heterogeneous graph neural network with co-contrastive learning. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pp 1726\u20131736","DOI":"10.1145\/3447548.3467415"},{"issue":"1","key":"11684_CR17","first-page":"521","volume":"35","author":"H Ji","year":"2021","unstructured":"Ji H, Wang X, Shi C, Wang B, Philip SY (2021) Heterogeneous graph propagation network. IEEE Trans Knowl Data Eng 35(1):521\u2013532","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"11684_CR18","doi-asserted-by":"crossref","unstructured":"Dong Y, Chawla NV, Swami A (2017) Metapath2vec: scalable representation learning for heterogeneous networks. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 135\u2013144","DOI":"10.1145\/3097983.3098036"},{"key":"11684_CR19","doi-asserted-by":"crossref","unstructured":"Hussein R, Yang D, Cudr\u00e9-Mauroux P (2018) Are meta-paths necessary? Revisiting heterogeneous graph embeddings. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 437\u2013446","DOI":"10.1145\/3269206.3271777"},{"key":"11684_CR20","doi-asserted-by":"publisher","first-page":"119982","DOI":"10.1016\/j.eswa.2023.119982","volume":"224","author":"Z Wang","year":"2023","unstructured":"Wang Z, Yu D, Li Q, Shen S, Yao S (2023) SR-HGN: semantic-and relation-aware heterogeneous graph neural network. Expert Syst Appl 224:119982","journal-title":"Expert Syst Appl"},{"key":"11684_CR21","doi-asserted-by":"crossref","unstructured":"Hu Z, Dong Y, Wang K, Sun Y (2020) Heterogeneous graph transformer. In: Proceedings of the web conference 2020, pp 2704\u20132710","DOI":"10.1145\/3366423.3380027"},{"key":"11684_CR22","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.neunet.2022.05.026","volume":"153","author":"S Yun","year":"2022","unstructured":"Yun S, Jeong M, Yoo S, Lee S, Sean SY, Kim R, Kang J, Kim HJ (2022) Graph transformer networks: learning meta-path graphs to improve GNNs. Neural Netw 153:104\u2013119","journal-title":"Neural Netw"},{"key":"11684_CR23","doi-asserted-by":"crossref","unstructured":"Fu C, Yu P, Yu Y, Huang C, Zhao Z, Dong J (2024) MHGCN+: Multiplex heterogeneous graph convolutional network. ACM Trans Intell Syst Technol","DOI":"10.1145\/3650046"},{"key":"11684_CR24","unstructured":"Topping J, Di\u00a0Giovanni F, Chamberlain BP, Dong X, Bronstein MM (2021) Understanding over-squashing and bottlenecks on graphs via curvature. arXiv preprint arXiv:2111.14522"},{"key":"11684_CR25","unstructured":"Alon U, Yahav E (2020) On the bottleneck of graph neural networks and its practical implications. arXiv preprint arXiv:2006.05205"},{"key":"11684_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-981-16-6166-2","volume-title":"Heterogeneous graph representation learning and applications","author":"C Shi","year":"2022","unstructured":"Shi C, Wang X, Yu PS (2022) Heterogeneous graph representation learning and applications. Springer, Singapore, pp 1\u2013318"},{"key":"11684_CR27","unstructured":"Shao Z, Shi D, Han A, Guo Y, Zhao Q, Gao J (2023) Unifying over-smoothing and over-squashing in graph neural networks: a physics informed approach and beyond. arXiv preprint arXiv:2309.02769"},{"key":"11684_CR28","unstructured":"Klicpera J, Wei\u00dfenberger S, G\u00fcnnemann S (2019) Diffusion improves graph learning. arXiv preprint arXiv:1911.05485"},{"issue":"4","key":"11684_CR29","first-page":"1005","volume":"48","author":"A Takatsu","year":"2011","unstructured":"Takatsu A (2011) Wasserstein geometry of gaussian measures. Osaka J Math 48(4):1005\u20131026","journal-title":"Osaka J Math"},{"key":"11684_CR30","unstructured":"Black M, Wan Z, Nayyeri A, Wang Y (2023) Understanding oversquashing in GNNs through the lens of effective resistance. In: International conference on machine learning. PMLR, pp 2528\u20132547"},{"key":"11684_CR31","doi-asserted-by":"crossref","unstructured":"Chen D, Lin Y, Li W, Li P, Zhou J, Sun X (2020) Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, pp 3438\u20133445","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"11684_CR32","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"11684_CR33","doi-asserted-by":"publisher","first-page":"220274","DOI":"10.1109\/ACCESS.2020.3043269","volume":"8","author":"Y Yang","year":"2020","unstructured":"Yang Y, Fu Z, Iftekhar A, Cui X (2020) A semantic aware meta-path model for heterogeneous network representation learning. IEEE Access 8:220274\u2013220284","journal-title":"IEEE Access"},{"key":"11684_CR34","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab"},{"key":"11684_CR35","doi-asserted-by":"crossref","unstructured":"Zhu X, Kandola JS, Lafferty J, Ghahramani Z (2006) Graph kernels by spectral transforms","DOI":"10.7551\/mitpress\/6173.003.0021"},{"key":"11684_CR36","unstructured":"Atwood J, Towsley D (2016) Diffusion-convolutional neural networks. Adv Neural Inf Process Syst 29"},{"key":"11684_CR37","unstructured":"Klicpera J, Bojchevski A, G\u00fcnnemann S (2018) Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997"},{"key":"11684_CR38","doi-asserted-by":"crossref","unstructured":"Xu B, Shen H, Cao Q, Cen K, Cheng X (2020) Graph convolutional networks using heat kernel for semi-supervised learning. arXiv preprint arXiv:2007.16002","DOI":"10.24963\/ijcai.2019\/267"},{"key":"11684_CR39","unstructured":"Chen Q, Wang Y, Wang Y, Yang J, Lin Z (2022) Optimization-induced graph implicit nonlinear diffusion. In: International conference on machine learning. PMLR, pp 3648\u20133661"},{"key":"11684_CR40","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2008","unstructured":"Villani C et al (2008) Optimal transport: old and new, vol 338. Springer, Berlin"},{"key":"11684_CR41","unstructured":"Binkowski M, Sutherland DJ, Arbel M, Gretton A (2018) Demystifying MMD GANs. In: International conference on learning representations"},{"key":"11684_CR42","doi-asserted-by":"crossref","unstructured":"Sun B, Saenko K (2016) Deep coral: Correlation alignment for deep domain adaptation. In: Computer vision\u2013ECCV 2016 Workshops: Amsterdam, the Netherlands, October 8-10 and 15-16, 2016, Proceedings, Part III 14. Springer, pp 443\u2013450","DOI":"10.1007\/978-3-319-49409-8_35"},{"issue":"3","key":"11684_CR43","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/0047-259X(82)90077-X","volume":"12","author":"D Dowson","year":"1982","unstructured":"Dowson D, Landau B (1982) The Fr\u00e9chet distance between multivariate normal distributions. J Multivar Anal 12(3):450\u2013455","journal-title":"J Multivar Anal"},{"issue":"4A","key":"11684_CR44","doi-asserted-by":"publisher","first-page":"2620","DOI":"10.3150\/18-BEJ1065","volume":"25","author":"J Weed","year":"2019","unstructured":"Weed J, Bach F (2019) Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance. Bernoulli 25(4A):2620\u20132648","journal-title":"Bernoulli"},{"key":"11684_CR45","unstructured":"Gasteiger J, Bojchevski A, G\u00fcnnemann S. Predict then propagate: graph neural networks meet personalized pagerank. In: International conference on learning representations"},{"key":"11684_CR46","unstructured":"Li M, Guo X, Wang Y, Wang Y, Lin Z (2022) G$$^{2}$$CN: Graph Gaussian convolution networks with concentrated graph filters. In: International conference on machine learning. PMLR, pp 12782\u201312796"},{"issue":"3","key":"11684_CR47","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1214\/aoms\/1177706212","volume":"30","author":"HG Tucker","year":"1959","unstructured":"Tucker HG (1959) A generalization of the Glivenko-Cantelli theorem. Ann Math Stat 30(3):828\u2013830","journal-title":"Ann Math Stat"},{"key":"11684_CR48","doi-asserted-by":"crossref","unstructured":"Bojchevski A, Gasteiger J, Perozzi B, Kapoor A, Blais M, R\u00f3zemberczki B, Lukasik M, G\u00fcnnemann S (2020) Scaling graph neural networks with approximate pagerank. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery and data mining, pp 2464\u20132473","DOI":"10.1145\/3394486.3403296"},{"key":"11684_CR49","doi-asserted-by":"crossref","unstructured":"Li J, Shomer H, Ding J, Wang Y, Ma Y, Shah N, Tang J, Yin D (2023) Are message passing neural networks really helpful for knowledge graph completion? In: Proceedings of the 61st annual meeting of the association for computational linguistics (Volume 1: Long Papers), pp 10696\u201310711","DOI":"10.18653\/v1\/2023.acl-long.597"},{"key":"11684_CR50","unstructured":"Vashishth S, Sanyal S, Nitin V, Talukdar P (2019) Composition-based multi-relational graph convolutional networks. In: International conference on learning representations"},{"key":"11684_CR51","unstructured":"Sun Z, Deng Z-H, Nie J-Y, Tang J (2019) Rotate: Knowledge graph embedding by relational rotation in complex space. arXiv preprint arXiv:1902.10197"},{"key":"11684_CR52","unstructured":"McDaid AF, Greene D, Hurley N (2011) Normalized mutual information to evaluate overlapping community finding algorithms. arXiv preprint arXiv:1110.2515"},{"key":"11684_CR53","doi-asserted-by":"crossref","unstructured":"Santos JM, Embrechts M (2009) On the use of the adjusted rand index as a metric for evaluating supervised classification. In: International conference on artificial neural networks. Springer, pp 175\u2013184","DOI":"10.1007\/978-3-642-04277-5_18"},{"key":"11684_CR54","doi-asserted-by":"crossref","unstructured":"Davis J, Goadrich M (2006) The relationship between precision-recall and roc curves. In: Proceedings of the 23rd international conference on machine learning, pp 233\u2013240","DOI":"10.1145\/1143844.1143874"},{"key":"11684_CR55","unstructured":"Di\u00a0Giovanni F, Rusch TK, Bronstein M, Deac A, Lackenby M, Mishra S, Veli\u010dkovi\u0107 P (2023) How does over-squashing affect the power of GNNs? In: NeurIPS 2023 workshop: new frontiers in graph learning"},{"key":"11684_CR56","unstructured":"Maaten L, Hinton G (2008) Visualizing data using T-SNE. J Mach Learn Res 9(11)"},{"key":"11684_CR57","doi-asserted-by":"crossref","unstructured":"Wang Y, Liu S, Zheng T, Chen K, Song M (2024) Unveiling global interactive patterns across graphs: towards interpretable graph neural networks. In: Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining, pp 3277\u20133288","DOI":"10.1145\/3637528.3671838"},{"key":"11684_CR58","doi-asserted-by":"crossref","unstructured":"Hong X, Li W, Wang C, Lin M, Lu S (2024) Label attentive distillation for GNN-based graph classification. In: Proceedings of the AAAI conference on artificial intelligence, vol 38, pp 8499\u20138507","DOI":"10.1609\/aaai.v38i8.28693"},{"key":"11684_CR59","doi-asserted-by":"crossref","unstructured":"Chen Y, Frias J, Gel YR (2024) TOPOGCL: topological graph contrastive learning. In: Proceedings of the AAAI conference on artificial intelligence, vol 38, pp 11453\u201311461","DOI":"10.1609\/aaai.v38i10.29026"},{"key":"11684_CR60","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2018) How powerful are graph neural networks? arXiv preprint arXiv:1810.00826"},{"key":"11684_CR61","first-page":"22118","volume":"33","author":"W Hu","year":"2020","unstructured":"Hu W, Fey M, Zitnik M, Dong Y, Ren H, Liu B, Catasta M, Leskovec J (2020) Open graph benchmark: datasets for machine learning on graphs. Adv Neural Inf Process Syst 33:22118\u201322133","journal-title":"Adv Neural Inf Process Syst"},{"key":"11684_CR62","doi-asserted-by":"crossref","unstructured":"Ji Y, Jia T, Fang Y, Shi C (2021) Dynamic heterogeneous graph embedding via heterogeneous hawkes process. In: Machine learning and knowledge discovery in databases. Research Track: European Conference, ECML PKDD 2021, Bilbao, Spain, September 13\u201317, 2021, Proceedings, Part I 21. Springer, pp 388\u2013403","DOI":"10.1007\/978-3-030-86486-6_24"},{"key":"11684_CR63","doi-asserted-by":"crossref","unstructured":"Fan Y, Ju M, Zhang C, Ye Y (2022) Heterogeneous temporal graph neural network. In: Proceedings of the 2022 SIAM international conference on data mining (SDM). SIAM, pp 657\u2013665","DOI":"10.1137\/1.9781611977172.74"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11684-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-025-11684-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11684-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T06:28:45Z","timestamp":1777271325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-025-11684-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,22]]},"references-count":63,"journal-issue":{"issue":"34","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["11684"],"URL":"https:\/\/doi.org\/10.1007\/s00521-025-11684-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,22]]},"assertion":[{"value":"4 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised to update the github links.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}