{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:51:21Z","timestamp":1777733481732,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100013314","name":"111 Project","doi-asserted-by":"crossref","award":["No. D23006"],"award-info":[{"award-number":["No. D23006"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 6207604"],"award-info":[{"award-number":["No. 6207604"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Dalian Major Projects of Basic Research","award":["No. 2023JJ11CG002"],"award-info":[{"award-number":["No. 2023JJ11CG002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10489-024-05987-w","type":"journal-article","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T07:32:38Z","timestamp":1733902358000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Global and local information-aware relational graph convolutional network for temporal knowledge graph completion"],"prefix":"10.1007","volume":"55","author":[{"given":"Shuo","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuxu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoqian","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"5987_CR1","doi-asserted-by":"publisher","unstructured":"Yang C, Qi G (2022) An urban traffic knowledge graph-driven spatial-temporal graph convolutional network for traffic flow prediction. In: Proceedings of the 11th International Joint Conference on Knowledge Graphs, pp 110\u2013114. https:\/\/doi.org\/10.1145\/3579051.3579058","DOI":"10.1145\/3579051.3579058"},{"key":"5987_CR2","doi-asserted-by":"publisher","unstructured":"Zhang W, Gu T, Sun W, et\u00a0al (2018) Travel attractions recommendation with travel spatial-temporal knowledge graphs. In: Proceedings of the International Conference of Pioneering Computer Scientists, Engineers and Educators, pp 213\u2013226. https:\/\/doi.org\/10.1007\/978-981-13-2206-8_19","DOI":"10.1007\/978-981-13-2206-8_19"},{"key":"5987_CR3","doi-asserted-by":"publisher","unstructured":"Souza\u00a0Costa T, Gottschalk S, Demidova E (2020) Event-qa: A dataset for event-centric question answering over knowledge graphs. In: Proceedings of the 29th ACM international conference on information & knowledge management, pp 3157\u20133164. https:\/\/doi.org\/10.1145\/3340531.3412760","DOI":"10.1145\/3340531.3412760"},{"key":"5987_CR4","doi-asserted-by":"crossref","unstructured":"Trompf GW (1979) The idea of historical recurrence in Western thought: from antiquity to the Reformation, vol\u00a01. Univ of California Press","DOI":"10.1525\/9780520312401"},{"key":"5987_CR5","unstructured":"Schlesinger AM (1999) The cycles of American history. HMH"},{"key":"5987_CR6","doi-asserted-by":"publisher","first-page":"4732","DOI":"10.1609\/aaai.v35i5.16604","volume":"35","author":"C Zhu","year":"2021","unstructured":"Zhu C, Chen M, Fan C et al (2021) Learning from history: Modeling temporal knowledge graphs with sequential copy-generation networks. Proceed AAAI Conf Art Intell 35:4732\u20134740. https:\/\/doi.org\/10.1609\/aaai.v35i5.16604","journal-title":"Proceed AAAI Conf Art Intell"},{"key":"5987_CR7","unstructured":"Ding Z, Ma Y, He B, et\u00a0al (2022) A simple but powerful graph encoder for temporal knowledge graph completion. In: NeurIPS 2022 Temporal Graph Learning Workshop. https:\/\/openreview.net\/forum?id=DYG8RbgAIo"},{"key":"5987_CR8","doi-asserted-by":"publisher","unstructured":"Jung J, Jung J, Kang U (2021) Learning to walk across time for interpretable temporal knowledge graph completion. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp 786\u2013795. https:\/\/doi.org\/10.1145\/3447548.3467292","DOI":"10.1145\/3447548.3467292"},{"key":"5987_CR9","doi-asserted-by":"publisher","unstructured":"Xie Z, Zhu R, Liu J, et\u00a0al (2023) Targat: A time-aware relational graph attention model for temporal knowledge graph embedding. IEEE\/ACM Trans Audio, Speech, Language Process pp 2246\u20132258. https:\/\/doi.org\/10.1109\/TASLP.2023.3282101","DOI":"10.1109\/TASLP.2023.3282101"},{"key":"5987_CR10","unstructured":"Bordes A, Usunier N, Garcia-Duran A, et\u00a0al (2013) Translating embeddings for modeling multi-relational data. Adv Condens Matter Phys 26"},{"key":"5987_CR11","doi-asserted-by":"publisher","unstructured":"Wang Z, Zhang J, Feng J, et\u00a0al (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI conference on artificial intelligence, vol\u00a028. https:\/\/doi.org\/10.1609\/aaai.v28i1.8870","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"5987_CR12","doi-asserted-by":"crossref","unstructured":"Lin Y, Liu Z, Sun M, et\u00a0al (2015) Learning entity and relation embeddings for knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, vol\u00a029","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"5987_CR13","unstructured":"Sun Z, Deng ZH, Nie JY, et\u00a0al (2019) Rotate: Knowledge graph embedding by relational rotation in complex space. arXiv:1902.10197"},{"key":"5987_CR14","unstructured":"Zhang S, Tay Y, Yao L, et\u00a0al (2019) Quaternion knowledge graph embeddings. In: Advances in Neural Information Processing Systems, vol\u00a032"},{"key":"5987_CR15","unstructured":"Nickel M, Tresp V, Kriegel HP (2011) A three-way model for collective learning on multi-relational data. In: International Conference on Machine Learning, pp 809\u2014-816"},{"key":"5987_CR16","unstructured":"Yang B, Yih SWt, He X, et\u00a0al (2015) Embedding entities and relations for learning and inference in knowledge bases. In: Proceedings of the International Conference on Learning Representations (ICLR)"},{"key":"5987_CR17","unstructured":"Trouillon T, Welbl J, Riedel S, et\u00a0al (2016) Complex embeddings for simple link prediction. In: Proceedings of The 33rd International Conference on Machine Learning, vol\u00a048, pp 2071\u20132080"},{"key":"5987_CR18","doi-asserted-by":"publisher","unstructured":"Dettmers T, Minervini P, Stenetorp P, et\u00a0al (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI conference on artificial intelligence, vol\u00a032 .https:\/\/doi.org\/10.1609\/aaai.v32i1.11573","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"5987_CR19","doi-asserted-by":"publisher","unstructured":"Nguyen DQ, Nguyen TD, Nguyen DQ, et\u00a0al (2018) A novel embedding model for knowledge base completion based on convolutional neural network. In: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers), pp 327\u2013333. https:\/\/doi.org\/10.18653\/v1\/N18-2053","DOI":"10.18653\/v1\/N18-2053"},{"key":"5987_CR20","doi-asserted-by":"publisher","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, et\u00a0al (2018) Modeling relational data with graph convolutional networks. In: The semantic web: 15th international conference, pp 593\u2013607. https:\/\/doi.org\/10.1007\/978-3-319-93417-4_38","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"5987_CR21","doi-asserted-by":"publisher","unstructured":"Bansal T, Juan DC, Ravi S, et\u00a0al (2019) A2n: Attending to neighbors for knowledge graph inference. In: Proceedings of the 57th annual meeting of the association for computational linguistics, pp 4387\u20134392https:\/\/doi.org\/10.18653\/v1\/P19-1431","DOI":"10.18653\/v1\/P19-1431"},{"key":"5987_CR22","doi-asserted-by":"publisher","first-page":"9368","DOI":"10.1609\/aaai.v35i11.17129","volume":"35","author":"X Qin","year":"2021","unstructured":"Qin X, Sheikh N, Reinwald B et al (2021) Relation-aware graph attention model with adaptive self-adversarial training. Proceed AAAI Conf Art Intell 35:9368\u20139376. https:\/\/doi.org\/10.1609\/aaai.v35i11.17129","journal-title":"Proceed AAAI Conf Art Intell"},{"key":"5987_CR23","unstructured":"Jiang T, Liu T, Ge T, et\u00a0al (2016) Towards time-aware knowledge graph completion. In: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pp 1715\u20131724"},{"key":"5987_CR24","doi-asserted-by":"publisher","unstructured":"Dasgupta SS, Ray SN, Talukdar P (2018) Hyte: Hyperplane-based temporally aware knowledge graph embedding. In: Proceedings of the 2018 conference on empirical methods in natural language processing, pp 2001\u20132011. https:\/\/doi.org\/10.18653\/v1\/D18-1225","DOI":"10.18653\/v1\/D18-1225"},{"key":"5987_CR25","doi-asserted-by":"publisher","unstructured":"Xu C, Chen YY, Nayyeri M, et\u00a0al (2021) Temporal knowledge graph completion using a linear temporal regularizer and multivector embeddings. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp 2569\u20132578.https:\/\/doi.org\/10.18653\/v1\/2021.naacl-main.202","DOI":"10.18653\/v1\/2021.naacl-main.202"},{"key":"5987_CR26","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1145\/3184558.3191639","volume":"2018","author":"J Leblay","year":"2018","unstructured":"Leblay J, Chekol MW (2018) Deriving validity time in knowledge graph. Comp Proceed the Web Conf 2018:1771\u20131776. https:\/\/doi.org\/10.1145\/3184558.3191639","journal-title":"Comp Proceed the Web Conf"},{"key":"5987_CR27","doi-asserted-by":"publisher","unstructured":"Garc\u00eda-Dur\u00e1n A, Duman\u010di\u0107 S, Niepert M (2018) Learning sequence encoders for temporal knowledge graph completion. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pp 4816\u20134821. https:\/\/doi.org\/10.18653\/v1\/D18-1516","DOI":"10.18653\/v1\/D18-1516"},{"key":"5987_CR28","doi-asserted-by":"publisher","unstructured":"Wu J, Cao M, Cheung JCK, et\u00a0al (2020) Temp: Temporal message passing for temporal knowledge graph completion. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp 5730\u20135746. https:\/\/doi.org\/10.18653\/v1\/2020.emnlp-main.462","DOI":"10.18653\/v1\/2020.emnlp-main.462"},{"key":"5987_CR29","doi-asserted-by":"publisher","unstructured":"Zhang F, Zhang Z, Ao X, et\u00a0al (2022) Along the time: timeline-traced embedding for temporal knowledge graph completion. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp 2529\u20132538. https:\/\/doi.org\/10.1145\/3511808.3557233","DOI":"10.1145\/3511808.3557233"},{"key":"5987_CR30","doi-asserted-by":"publisher","unstructured":"Dikeoulias I, Amin S, Neumann G (2022) Temporal knowledge graph reasoning with low-rank and model-agnostic representations. In: Proceedings of the 7th Workshop on Representation Learning for NLP, pp 111\u2013120. https:\/\/doi.org\/10.18653\/v1\/2022.repl4nlp-1.12","DOI":"10.18653\/v1\/2022.repl4nlp-1.12"},{"key":"5987_CR31","unstructured":"Kazemi SM, Poole D (2018) Simple embedding for link prediction in knowledge graphs. In: Bengio S, Wallach H, Larochelle H, et\u00a0al (eds) Advances in Neural Information Processing Systems, vol\u00a031"},{"key":"5987_CR32","doi-asserted-by":"publisher","DOI":"10.7910\/DVN\/28075","author":"E Boschee","year":"2015","unstructured":"Boschee E, Lautenschlager J, O\u2019Brien S et al (2015). ICEWS Coded Event Data. https:\/\/doi.org\/10.7910\/DVN\/28075","journal-title":"ICEWS Coded Event Data."},{"key":"5987_CR33","first-page":"1","volume":"2","author":"K Leetaru","year":"2013","unstructured":"Leetaru K, Schrodt PA (2013) Gdelt: Global data on events, location, and tone, 1979\u20132012. ISA Annual Conv, Citeseer 2:1\u201349","journal-title":"ISA Annual Conv, Citeseer"},{"key":"5987_CR34","doi-asserted-by":"publisher","unstructured":"Erxleben F, G\u00fcnther M, Kr\u00f6tzsch M, et\u00a0al (2014) Introducing wikidata to the linked data web. In: The Semantic Web\u2013ISWC 2014: 13th International Semantic Web Conference, pp 50\u201365. https:\/\/doi.org\/10.1007\/978-3-319-11964-9_4","DOI":"10.1007\/978-3-319-11964-9_4"},{"key":"5987_CR35","doi-asserted-by":"publisher","unstructured":"Trivedi R, Dai H, Wang Y, et\u00a0al (2017) Know-evolve: Deep temporal reasoning for dynamic knowledge graphs. In: Proceedings of the 34th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol\u00a070, pp 3462\u20133471. https:\/\/doi.org\/10.5555\/3305890.3306039","DOI":"10.5555\/3305890.3306039"},{"key":"5987_CR36","doi-asserted-by":"publisher","first-page":"3988","DOI":"10.1609\/aaai.v34i04.5815","volume":"34","author":"R Goel","year":"2020","unstructured":"Goel R, Kazemi SM, Brubaker M et al (2020) Diachronic embedding for temporal knowledge graph completion. Proceed AAAI Conf Art Intell 34:3988\u20133995. https:\/\/doi.org\/10.1609\/aaai.v34i04.5815","journal-title":"Proceed AAAI Conf Art Intell"},{"key":"5987_CR37","doi-asserted-by":"publisher","unstructured":"Xu C, Nayyeri M, Alkhoury F, et\u00a0al (2020) Temporal knowledge graph completion based on time series gaussian embedding. In: The Semantic Web\u2013ISWC 2020: 19th International Semantic Web Conference, Athens, Greece, 2\u20136 November, 2020, Proceedings, Part I 19, pp 654\u2013671. https:\/\/doi.org\/10.1007\/978-3-030-62419-4_37","DOI":"10.1007\/978-3-030-62419-4_37"},{"key":"5987_CR38","unstructured":"Lacroix T, Obozinski G, Usunier N (2020) Tensor decompositions for temporal knowledge base completion. arXiv:2004.04926"},{"key":"5987_CR39","doi-asserted-by":"publisher","first-page":"6471","DOI":"10.1609\/aaai.v35i7.16802","volume":"35","author":"A Sadeghian","year":"2021","unstructured":"Sadeghian A, Armandpour M, Colas A et al (2021) Chronor: Rotation based temporal knowledge graph embedding. Proceed AAAI Conf Art Intell 35:6471\u20136479. https:\/\/doi.org\/10.1609\/aaai.v35i7.16802","journal-title":"Proceed AAAI Conf Art Intell"},{"key":"5987_CR40","doi-asserted-by":"publisher","first-page":"7779","DOI":"10.1609\/aaai.v36i7.20746","volume":"36","author":"J Messner","year":"2022","unstructured":"Messner J, Abboud R, Ceylan II (2022) Temporal knowledge graph completion using box embeddings. Proceed AAAI Conf Art Intell 36:7779\u2013778. https:\/\/doi.org\/10.1609\/aaai.v36i7.20746","journal-title":"Proceed AAAI Conf Art Intell"},{"issue":"8","key":"5987_CR41","doi-asserted-by":"publisher","first-page":"8746","DOI":"10.1007\/s10489-021-03149-w","volume":"53","author":"P He","year":"2023","unstructured":"He P, Zhou G, Zhang M et al (2023) Improving temporal knowledge graph embedding using tensor factorization. Applied Intell 53(8):8746\u2013876. https:\/\/doi.org\/10.1007\/s10489-021-03149-w","journal-title":"Applied Intell"},{"issue":"9","key":"5987_CR42","doi-asserted-by":"publisher","first-page":"200","DOI":"10.3390\/electronics12092001","volume":"12","author":"X Zhao","year":"2023","unstructured":"Zhao X, Li A, Jiang R et al (2023) Householder Transformation-Based Temporal Knowledge Graph Reasoning. Electron 12(9):200. https:\/\/doi.org\/10.3390\/electronics12092001","journal-title":"Electron"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05987-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05987-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05987-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T15:06:13Z","timestamp":1737385573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05987-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["5987"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05987-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"30 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2024","order":2,"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 is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"125"}}