{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T17:02:26Z","timestamp":1771520546559,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Innovation Foundation for Postgraduate Student of Jiangxi Province","award":["YC2023-100"],"award-info":[{"award-number":["YC2023-100"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62062050"],"award-info":[{"award-number":["62062050"]}],"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":["62062050"],"award-info":[{"award-number":["62062050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s13042-024-02413-y","type":"journal-article","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T12:02:39Z","timestamp":1729598559000},"page":"2653-2669","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic networks link prediction based on continuous gated recurrent graph convolution"],"prefix":"10.1007","volume":"16","author":[{"given":"Yunchun","family":"Liao","sequence":"first","affiliation":[]},{"given":"Jian","family":"Shu","sequence":"additional","affiliation":[]},{"given":"Linlan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"issue":"2","key":"2413_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TAI.2021.3076021","volume":"2","author":"F Xia","year":"2021","unstructured":"Xia F, Sun K, Yu S, Aziz A, Wan L, Pan S, Liu H (2021) Graph learning: a survey. IEEE Trans Artif Intell 2(2):109\u2013127. https:\/\/doi.org\/10.1109\/TAI.2021.3076021","journal-title":"IEEE Trans Artif Intell"},{"key":"2413_CR2","doi-asserted-by":"publisher","DOI":"10.1145\/3625820","author":"M Qin","year":"2023","unstructured":"Qin M, Yeung D-Y (2023) Temporal link prediction: a unified framework, taxonomy, and review. ACM Comput Surv. https:\/\/doi.org\/10.1145\/3625820","journal-title":"ACM Comput Surv"},{"key":"2413_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ins.2020.01.043","volume":"521","author":"H Peng","year":"2020","unstructured":"Peng H, Wang H, Du B, Bhuiyan MZA, Ma H, Liu J, Wang L, Yang Z, Du L, Wang S, Yu PS (2020) Spatial temporal incidence dynamic graph neural networks for traffic flow forecasting. Inf Sci 521:277\u2013290. https:\/\/doi.org\/10.1016\/j.ins.2020.01.043","journal-title":"Inf Sci"},{"key":"2413_CR4","doi-asserted-by":"publisher","unstructured":"Zou D, Peng H, Huang X, Yang R, Li J, Wu J, Liu C, Yu PS (2023) Se-gsl: a general and effective graph structure learning framework through structural entropy optimization. In: Proceedings of the ACM Web Conference 2023. WWW \u201923, pp. 499\u2013510. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3543507.3583453","DOI":"10.1145\/3543507.3583453"},{"key":"2413_CR5","doi-asserted-by":"publisher","unstructured":"Zou D, Wang S, Li X, Peng H, Wang Y, Liu C, Sheng K, Zhang B (2024) Multispans: a multi-range spatial-temporal transformer network for traffic forecast via structural entropy optimization. In: Proceedings of the 17th ACM international conference on web search and data mining. WSDM \u201924, pp. 1032\u20131041. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3616855.3635820","DOI":"10.1145\/3616855.3635820"},{"key":"2413_CR6","doi-asserted-by":"crossref","unstructured":"Wu Z, Pan S, Long G, Jiang J, Zhang C (2019) Graph wavenet for deep spatial-temporal graph modeling. CoRR arXiv:1906.00121","DOI":"10.24963\/ijcai.2019\/264"},{"key":"2413_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-031-20047-2_13","volume-title":"Computer vision\u2014ECCV 2022","author":"S Wen","year":"2022","unstructured":"Wen S, Wang H, Metaxas D (2022) Social ode: multi-agent trajectory forecasting with neural ordinary differential equations. In: Avidan S, Brostow G, Ciss\u00e9 M, Farinella GM, Hassner T (eds) Computer vision\u2014ECCV 2022. Springer, Cham, pp 217\u2013233"},{"key":"2413_CR8","unstructured":"Jiang R, Wang S, Zhang Y (2023) A dynamic temporal self-attention graph convolutional network for traffic prediction. arxiv:2302.10428"},{"issue":"9","key":"2413_CR9","doi-asserted-by":"publisher","first-page":"3848","DOI":"10.1109\/TITS.2019.2935152","volume":"21","author":"L Zhao","year":"2020","unstructured":"Zhao L, Song Y, Zhang C, Liu Y, Wang P, Lin T, Deng M, Li H (2020) T-gcn: a temporal graph convolutional network for traffic prediction. IEEE Trans Intell Transp Syst 21(9):3848\u20133858. https:\/\/doi.org\/10.1109\/TITS.2019.2935152","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2413_CR10","unstructured":"Brouwer ED, Simm J, Arany A, Moreau Y (2019) Gru-ode-bayes: continuous modeling of sporadically-observed time series. CoRR arXiv:1905.12374"},{"key":"2413_CR11","unstructured":"Mikolov T, Chen K, Corrado GS, Dean J (2013) Efficient estimation of word representations in vector space. In: International conference on learning representations. https:\/\/api.semanticscholar.org\/CorpusID:5959482"},{"key":"2413_CR12","doi-asserted-by":"publisher","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201914, pp. 701\u2013710. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"2413_CR13","doi-asserted-by":"crossref","unstructured":"Mahdavi S, Khoshraftar S, An A (2018) dynnode2vec: scalable dynamic network embedding. CoRR arXiv:1812.02356","DOI":"10.1109\/BigData.2018.8621910"},{"key":"2413_CR14","doi-asserted-by":"crossref","unstructured":"Singer U, Guy I, Radinsky K (2019) Node embedding over temporal graphs. CoRR arXiv:1903.08889","DOI":"10.24963\/ijcai.2019\/640"},{"key":"2413_CR15","doi-asserted-by":"publisher","unstructured":"Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. In: Companion proceedings of the the Web Conference 2018. WWW \u201918, pp. 969\u2013976. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE. https:\/\/doi.org\/10.1145\/3184558.3191526","DOI":"10.1145\/3184558.3191526"},{"issue":"1","key":"2413_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.26599\/BDMA.2017.9020002","volume":"1","author":"NM Ahmed","year":"2018","unstructured":"Ahmed NM, Chen L, Wang Y, Li B, Li Y, Liu W (2018) Deepeye: link prediction in dynamic networks based on non-negative matrix factorization. Big Data Min Anal 1(1):19\u201333. https:\/\/doi.org\/10.26599\/BDMA.2017.9020002","journal-title":"Big Data Min Anal"},{"key":"2413_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.108977","volume":"133","author":"A Agibetov","year":"2023","unstructured":"Agibetov A (2023) Neural graph embeddings as explicit low-rank matrix factorization for link prediction. Pattern Recogn 133:108977. https:\/\/doi.org\/10.1016\/j.patcog.2022.108977","journal-title":"Pattern Recogn"},{"key":"2413_CR18","doi-asserted-by":"publisher","unstructured":"Li J, Cheng K, Wu L, Liu H (2018) Streaming link prediction on dynamic attributed networks. In: Proceedings of the eleventh ACM international conference on web search and data mining. WSDM \u201918, pp. 369\u2013377. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3159652.3159674","DOI":"10.1145\/3159652.3159674"},{"key":"2413_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112107","volume":"159","author":"L Lv","year":"2022","unstructured":"Lv L, Bardou D, Hu P, Liu Y, Yu G (2022) Graph regularized nonnegative matrix factorization for link prediction in directed temporal networks using pagerank centrality. Chaos Solit Fract 159:112107. https:\/\/doi.org\/10.1016\/j.chaos.2022.112107","journal-title":"Chaos Solit Fract"},{"issue":"3","key":"2413_CR20","doi-asserted-by":"publisher","first-page":"3745","DOI":"10.1007\/s11042-022-12943-8","volume":"82","author":"E Nasiri","year":"2023","unstructured":"Nasiri E, Berahmand K, Li Y (2023) Robust graph regularization nonnegative matrix factorization for link prediction in attributed networks. Multimedia Tools Appl 82(3):3745\u20133768. https:\/\/doi.org\/10.1007\/s11042-022-12943-8","journal-title":"Multimedia Tools Appl"},{"key":"2413_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108216","volume":"121","author":"X Ma","year":"2022","unstructured":"Ma X, Tan S, Xie X, Zhong X, Deng J (2022) Joint multi-label learning and feature extraction for temporal link prediction. Pattern Recogn 121:108216. https:\/\/doi.org\/10.1016\/j.patcog.2021.108216","journal-title":"Pattern Recogn"},{"issue":"7","key":"2413_CR22","doi-asserted-by":"publisher","first-page":"7513","DOI":"10.1007\/s10489-021-02518-9","volume":"52","author":"J Chen","year":"2022","unstructured":"Chen J, Wang X, Xu X (2022) Gc-lstm: graph convolution embedded lstm for dynamic network link prediction. Appl Intell 52(7):7513\u20137528. https:\/\/doi.org\/10.1007\/s10489-021-02518-9","journal-title":"Appl Intell"},{"key":"2413_CR23","doi-asserted-by":"crossref","unstructured":"Pareja A, Domeniconi G, Chen J, Ma T, Suzumura T, Kanezashi H, Kaler T, Leiserson CE (2019) Evolvegcn: evolving graph convolutional networks for dynamic graphs. CoRR arXiv:1902.10191","DOI":"10.1609\/aaai.v34i04.5984"},{"key":"2413_CR24","doi-asserted-by":"publisher","unstructured":"Lei K, Qin M, Bai B, Zhang G, Yang M (2019) Gcn-gan: a non-linear temporal link prediction model for weighted dynamic networks. In: IEEE INFOCOM 2019\u2014IEEE conference on computer communications, pp 388\u2013396 . https:\/\/doi.org\/10.1109\/INFOCOM.2019.8737631","DOI":"10.1109\/INFOCOM.2019.8737631"},{"issue":"12","key":"2413_CR25","doi-asserted-by":"publisher","first-page":"4946","DOI":"10.1109\/TCYB.2019.2920268","volume":"50","author":"M Yang","year":"2020","unstructured":"Yang M, Liu J, Chen L, Zhao Z, Chen X, Shen Y (2020) An advanced deep generative framework for temporal link prediction in dynamic networks. IEEE Trans Cybern 50(12):4946\u20134957. https:\/\/doi.org\/10.1109\/TCYB.2019.2920268","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"2413_CR26","doi-asserted-by":"publisher","first-page":"3699","DOI":"10.1109\/TSMC.2019.2932913","volume":"51","author":"J Chen","year":"2021","unstructured":"Chen J, Zhang J, Xu X, Fu C, Zhang D, Zhang Q, Xuan Q (2021) E-lstm-d: a deep learning framework for dynamic network link prediction. IEEE Trans Syst Man Cybern Syst 51(6):3699\u20133712. https:\/\/doi.org\/10.1109\/TSMC.2019.2932913","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"2413_CR27","first-page":"705","volume":"60","author":"ZLY Liu","year":"2023","unstructured":"Liu ZLY, Zhu H (2023) A link prediction method based on gated recurrent units for mobile social network. J Comput Res Dev 60:705\u2013716","journal-title":"J Comput Res Dev"},{"issue":"4","key":"2413_CR28","doi-asserted-by":"publisher","first-page":"2495","DOI":"10.1109\/TNSE.2022.3164659","volume":"9","author":"Y Yin","year":"2022","unstructured":"Yin Y, Wu Y, Yang X, Zhang W, Yuan X (2022) Se-gru: structure embedded gated recurrent unit neural networks for temporal link prediction. IEEE Trans Netw Sci Eng 9(4):2495\u20132509. https:\/\/doi.org\/10.1109\/TNSE.2022.3164659","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"2413_CR29","doi-asserted-by":"publisher","unstructured":"Li D, Tan S, Wang Y, Funakoshi K, Okumura M (2023) Temporal and topological augmentation-based cross-view contrastive learning model for temporal link prediction. In: Proceedings of the 32nd ACM international conference on information and knowledge management. CIKM \u201923, pp. 4059\u20134063. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3583780.3615231","DOI":"10.1145\/3583780.3615231"},{"key":"2413_CR30","doi-asserted-by":"publisher","unstructured":"Tan S, You J, Li D (2022) Temporality- and frequency-aware graph contrastive learning for temporal network. In: Proceedings of the 31st ACM international conference on information & knowledge management. CIKM \u201922, pp. 1878\u20131888. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3511808.3557469","DOI":"10.1145\/3511808.3557469"},{"issue":"9","key":"2413_CR31","doi-asserted-by":"publisher","first-page":"2075","DOI":"10.14778\/3598581.3598583","volume":"16","author":"J Layne","year":"2023","unstructured":"Layne J, Carpenter J, Serra E, Gullo F (2023) Temporal sir-gn: efficient and effective structural representation learning for temporal graphs. Proc VLDB Endow 16(9):2075\u20132089. https:\/\/doi.org\/10.14778\/3598581.3598583","journal-title":"Proc VLDB Endow"},{"key":"2413_CR32","unstructured":"Chen TQ, Rubanova Y, Bettencourt J, Duvenaud D (2018) Neural ordinary differential equations. CoRR arXiv:1806.07366"},{"key":"2413_CR33","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. CoRR arXiv:1609.02907"},{"key":"2413_CR34","doi-asserted-by":"crossref","unstructured":"Cho K, Merrienboer B, G\u00fcl\u00e7ehre \u00c7, Bougares F, Schwenk H, Bengio Y (2014) Learning phrase representations using RNN encoder-decoder for statistical machine translation. CoRR arXiv:1406.1078","DOI":"10.3115\/v1\/D14-1179"},{"key":"2413_CR35","unstructured":"Chung J, G\u00fcl\u00e7ehre \u00c7, Cho K, Bengio Y (2014) Empirical evaluation of gated recurrent neural networks on sequence modeling. CoRR arXiv:1412.3555"},{"issue":"6","key":"2413_CR36","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Phys. A 390(6):1150\u20131170. https:\/\/doi.org\/10.1016\/j.physa.2010.11.027","journal-title":"Phys. A"},{"key":"2413_CR37","doi-asserted-by":"publisher","unstructured":"Huang Z, Sun Y, Wang W (2021) Coupled graph ode for learning interacting system dynamics. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining. KDD \u201921, pp. 705\u2013715. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3447548.3467385","DOI":"10.1145\/3447548.3467385"},{"key":"2413_CR38","doi-asserted-by":"crossref","unstructured":"Luo X, Zhu C, Zhang D, Li Q (2023) Dynamic graph convolutional network with attention fusion for traffic flow prediction. In: European conference on artificial intelligence . https:\/\/api.semanticscholar.org\/CorpusID:257206088","DOI":"10.3233\/FAIA230446"},{"issue":"10","key":"2413_CR39","doi-asserted-by":"publisher","first-page":"11210","DOI":"10.1109\/TITS.2023.3279929","volume":"24","author":"T Liu","year":"2023","unstructured":"Liu T, Jiang A, Zhou J, Li M, Kwan HK (2023) Graphsage-based dynamic spatial-temporal graph convolutional network for traffic prediction. IEEE Trans Intell Transp Syst 24(10):11210\u201311224. https:\/\/doi.org\/10.1109\/TITS.2023.3279929","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"4","key":"2413_CR40","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MPRV.2005.75","volume":"4","author":"D Kotz","year":"2005","unstructured":"Kotz D, Henderson T (2005) Crawdad: a community resource for archiving wireless data at dartmouth. IEEE Pervas Comput 4(4):12\u201314. https:\/\/doi.org\/10.1109\/MPRV.2005.75","journal-title":"IEEE Pervas Comput"},{"key":"2413_CR41","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1109\/ACCESS.2018.2886360","volume":"7","author":"X Cai","year":"2019","unstructured":"Cai X, Shu J, Al-Kali M (2019) Link prediction approach for opportunistic networks based on recurrent neural network. IEEE Access 7:2017\u20132025. https:\/\/doi.org\/10.1109\/ACCESS.2018.2886360","journal-title":"IEEE Access"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02413-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02413-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02413-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T07:33:36Z","timestamp":1744011216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02413-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2413"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02413-y","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"13 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":3,"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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}