{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:25:39Z","timestamp":1771467939578,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T00:00:00Z","timestamp":1759536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T00:00:00Z","timestamp":1759536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"State Key Laboratory of Massive Personalized Customization System and Technology","award":["H&C-MPC-2023-05-02"],"award-info":[{"award-number":["H&C-MPC-2023-05-02"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62176121"],"award-info":[{"award-number":["62176121"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10115-025-02603-2","type":"journal-article","created":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T07:10:44Z","timestamp":1759561844000},"page":"12579-12598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reasoning temporal knowledge graph through neighboring and historical information aggregation"],"prefix":"10.1007","volume":"67","author":[{"given":"Wei","family":"Jia","sequence":"first","affiliation":[]},{"given":"Ruizhe","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xiaoping","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Weinan","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Zongmin","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,4]]},"reference":[{"key":"2603_CR1","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-540-76298-0_52","volume-title":"international semantic web conference","author":"S Auer","year":"2007","unstructured":"Auer S, Bizer C, Kobilarov G, Lehmann J, Cyganiak R, Ives Z (2007) Dbpedia: A nucleus for a web of open data. international semantic web conference. Springer, pp 722\u2013735"},{"key":"2603_CR2","unstructured":"F. Mahdisoltani, J. Biega, and F. M. Suchanek, \"Yago3: A knowledge base from multilingual wikipedias,\" in CIDR, 2013."},{"key":"2603_CR3","doi-asserted-by":"crossref","unstructured":"K. Bollacker, C. Evans, P. Paritosh, T. Sturge, and J. Taylor, \"Freebase: a collaboratively created graph database for structuring human knowledge,\" in Proceedings of the 2008 ACM SIGMOD international conference on Management of data, 2008, pp. 1247\u20131250.","DOI":"10.1145\/1376616.1376746"},{"issue":"2","key":"2603_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103242","volume":"60","author":"X Bi","year":"2023","unstructured":"Bi X et al (2023) Boosting question answering over knowledge graph with reward integration and policy evaluation under weak supervision. Inf Process Manage 60(2):103242","journal-title":"Inf Process Manage"},{"key":"2603_CR5","doi-asserted-by":"crossref","unstructured":"C. Tang, H. Zhang, T. Loakman, C. Lin, and F. Guerin, \"Enhancing Dialogue Generation via Dynamic Graph Knowledge Aggregation,\" in Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2023, pp. 4604\u20134616.","DOI":"10.18653\/v1\/2023.acl-long.253"},{"key":"2603_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110078","volume":"259","author":"N Zhao","year":"2023","unstructured":"Zhao N, Long Z, Wang J, Zhao Z-D (2023) AGRE: a knowledge graph recommendation algorithm based on multiple paths embeddings RNN encoder. Knowl-Based Syst 259:110078","journal-title":"Knowl-Based Syst"},{"key":"2603_CR7","first-page":"1771","volume":"2018","author":"J Leblay","year":"2018","unstructured":"Leblay J, Chekol MW (2018) Deriving validity time in knowledge graph. Companion proceedings of the the web conference 2018:1771\u20131776","journal-title":"Companion proceedings of the the web conference"},{"key":"2603_CR8","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-030-62419-4_37","volume-title":"The Semantic Web\u2013ISWC 2020: 19th International Semantic Web Conference, Athens, Greece, November 2\u20136, 2020, Proceedings, Part I 19","author":"C Xu","year":"2020","unstructured":"Xu C, Nayyeri M, Alkhoury F, Yazdi H, Lehmann J (2020) Temporal knowledge graph completion based on time series gaussian embedding. The Semantic Web\u2013ISWC 2020: 19th International Semantic Web Conference, Athens, Greece, November 2\u20136, 2020, Proceedings, Part I 19. Springer, pp 654\u2013671"},{"key":"2603_CR9","doi-asserted-by":"crossref","unstructured":"C. Xu, M. Nayyeri, F. Alkhoury, H. S. Yazdi, and J. Lehmann, \"TeRo: A Time-aware Knowledge Graph Embedding via Temporal Rotation,\" in Proceedings of the 28th International Conference on Computational Linguistics, 2020, pp. 1583\u20131593.","DOI":"10.18653\/v1\/2020.coling-main.139"},{"key":"2603_CR10","doi-asserted-by":"crossref","unstructured":"Y. Xu et al., \"RTFE: A Recursive Temporal Fact Embedding Framework for Temporal Knowledge Graph Completion,\" in Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021, pp. 5671\u20135681.","DOI":"10.18653\/v1\/2021.naacl-main.451"},{"key":"2603_CR11","unstructured":"W. Jin, C. Zhang, P. Szekely, and X. Ren, \"Recurrent Event Network for Reasoning over Temporal Knowledge Graphs. arXiv 2019,\" arXiv preprint arXiv:1904.05530."},{"key":"2603_CR12","doi-asserted-by":"crossref","unstructured":"C Zhu M Chen C Fan G Cheng Y Zhang 2021 Learning from history: modeling temporal knowledge graphs with sequential copy-generation networks Proceedings of the AAAI conference on artificial intelligence 35 5 4732 4740","DOI":"10.1609\/aaai.v35i5.16604"},{"key":"2603_CR13","doi-asserted-by":"crossref","unstructured":"Z. Li et al., \"Search from History and Reason for Future: Two-stage Reasoning on Temporal Knowledge Graphs,\" in Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2021, pp. 4732\u20134743.","DOI":"10.18653\/v1\/2021.acl-long.365"},{"key":"2603_CR14","doi-asserted-by":"crossref","unstructured":"Z. Li et al., \"Temporal knowledge graph reasoning based on evolutional representation learning,\" in Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval, 2021, pp. 408\u2013417.","DOI":"10.1145\/3404835.3462963"},{"issue":"01","key":"2603_CR15","first-page":"3060","volume":"33","author":"C Shang","year":"2019","unstructured":"Shang C, Tang Y, Huang J, Bi J, He X, Zhou B (2019) End-to-end structure-aware convolutional networks for knowledge base completion. Proc AAAI Conf Artif Intell 33(01):3060\u20133067","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"2603_CR16","unstructured":"A. Bordes, N. Usunier, A. Garcia-Duran, J. Weston, and O. Yakhnenko, \"Translating embeddings for modeling multi-relational data,\" Advances in neural information processing systems, vol. 26, 2013."},{"key":"2603_CR17","doi-asserted-by":"crossref","unstructured":"Z. Wang, J. Zhang, J. Feng, and Z. Chen, \"Knowledge graph embedding by translating on hyperplanes,\" in Proceedings of the AAAI conference on artificial intelligence, 2014, vol. 28, no. 1.","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"2603_CR18","doi-asserted-by":"crossref","unstructured":"Y. Lin, Z. Liu, M. Sun, Y. Liu, and X. Zhu, \"Learning entity and relation embeddings for knowledge graph completion,\" in Proceedings of the AAAI conference on artificial intelligence, 2015, vol. 29, no. 1.","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"2603_CR19","doi-asserted-by":"crossref","unstructured":"S. He, K. Liu, G. Ji, and J. Zhao, \"Learning to represent knowledge graphs with gaussian embedding,\" in proceedings of the 24th ACM international on conference on information and knowledge management, 2015, pp. 623\u2013632.","DOI":"10.1145\/2806416.2806502"},{"key":"2603_CR20","unstructured":"M. Nickel, V. Tresp, and H.-P. Kriegel, \"A three-way model for collective learning on multi-relational data,\" in Icml, 2011, vol. 11, no. 10.5555, p. 3104482.3104584."},{"key":"2603_CR21","unstructured":"B. Yang, S. W.-t. Yih, X. He, J. Gao, and L. Deng, \"Embedding entities and relations for learning and inference in knowledge bases,\" In Proceedings of the international conference on learning representations (ICLR) 2015, 2015."},{"key":"2603_CR22","doi-asserted-by":"crossref","unstructured":"T. Dettmers, P. Minervini, P. Stenetorp, and S. Riedel, \"Convolutional 2d knowledge graph embeddings,\" in proceedings of the AAAI conference on artificial intelligence, 2018, vol. 32, no. 1.","DOI":"10.1609\/aaai.v32i1.11573"},{"issue":"05","key":"2603_CR23","doi-asserted-by":"publisher","first-page":"9612","DOI":"10.1609\/aaai.v34i05.6508","volume":"34","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Zhuang F, Zhu H, Shi Z, Xiong H, He Q (2020) Relational graph neural network with hierarchical attention for knowledge graph completion. Proceedings of the AAAI conference on artificial intelligence 34(05):9612\u20139619","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"2603_CR24","unstructured":"X. V. Lin, R. Socher, and C. Xiong, \"Multi-Hop Knowledge Graph Reasoning with Reward Shaping.\""},{"key":"2603_CR25","doi-asserted-by":"crossref","unstructured":"W. Xiong, T. Hoang, and W. Y. Wang, \"DeepPath: A reinforcement learning method for knowledge graph reasoning,\" in proceedings of the 2017 conference on empirical methods in natural language processing, 2017, pp. 564\u2013573.","DOI":"10.18653\/v1\/D17-1060"},{"key":"2603_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119787","volume":"653","author":"B Shang","year":"2024","unstructured":"Shang B, Zhao Y, Liu Y, Wang C (2024) Attention-based exploitation and exploration strategy for multi-hop knowledge graph reasoning. Inf Sci 653:119787","journal-title":"Inf Sci"},{"key":"2603_CR27","first-page":"414","volume-title":"International Conference on Advanced Data Mining and Applications","author":"H Li","year":"2024","unstructured":"Li H, Wei J, Yu J, Jiang Y (2024) Enhancing Embedding and Hierarchical Reward Shaping for Multi-Hop Reasoning with Reinforcement Learning. International Conference on Advanced Data Mining and Applications. Springer, pp 414\u2013429"},{"key":"2603_CR28","unstructured":"T. Jiang et al., \"Towards time-aware knowledge graph completion,\" in Proceedings of COLING 2016, the 26th international conference on computational linguistics: technical papers, 2016, pp. 1715\u20131724."},{"issue":"3","key":"2603_CR29","first-page":"1","volume":"16","author":"Y Xu","year":"2021","unstructured":"Xu Y et al (2021) Time-aware graph embedding: a temporal smoothness and task-oriented approach. ACM Tran Knowl Discovery from Data (TKDD) 16(3):1\u201323","journal-title":"ACM Tran Knowl Discovery from Data (TKDD)"},{"key":"2603_CR30","doi-asserted-by":"crossref","unstructured":"S. S. Dasgupta, S. N. Ray, and P. Talukdar, \"Hyte: Hyperplane-based temporally aware knowledge graph embedding,\" In Proceedings of the 2018 conference on empirical methods in natural language processing, 2018, pp. 2001\u20132011.","DOI":"10.18653\/v1\/D18-1225"},{"key":"2603_CR31","doi-asserted-by":"crossref","unstructured":"Z. Han, P. Chen, Y. Ma, and V. Tresp, \"DyERNIE: Dynamic evolution of riemannian manifold embeddings for temporal knowledge graph completion,\" In proceedings of the 2020 conference on empirical methods in natural language processing (EMNLP), 2020, pp. 7301\u20137316.","DOI":"10.18653\/v1\/2020.emnlp-main.593"},{"key":"2603_CR32","unstructured":"T. Lacroix, G. Obozinski, and N. Usunier, \"Tensor decompositions for temporal knowledge base completion,\" in international conference on learning representations, 2019."},{"key":"2603_CR33","unstructured":"T. Trouillon, J. Welbl, S. Riedel, \u00c9. Gaussier, and G. Bouchard, \"Complex embeddings for simple link prediction,\" in International conference on machine learning, 2016: PMLR, pp. 2071\u20132080."},{"key":"2603_CR34","doi-asserted-by":"crossref","unstructured":"J. Wu, M. Cao, J. C. K. Cheung, and W. L. Hamilton, \"TeMP: temporal message passing for temporal knowledge graph completion,\" in Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), 2020, pp. 5730\u20135746.","DOI":"10.18653\/v1\/2020.emnlp-main.462"},{"key":"2603_CR35","unstructured":"R. Trivedi, H. Dai, Y. Wang, and L. Song, \"Know-evolve: Deep temporal reasoning for dynamic knowledge graphs,\" in international conference on machine learning, 2017: PMLR, pp. 3462\u20133471."},{"key":"2603_CR36","unstructured":"Z. Han, J. Jiang, Y. Wang, Y. Ma, and V. Tresp, \"The graph hawkes network for reasoning on temporal knowledge graphs,\" in Learning with temporal point processes workshop at at the 33rd conference on neural information processing systems (NeurIPS 2019) NeurIPS 2019, 2019."},{"key":"2603_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111727","volume":"160","author":"L Bai","year":"2024","unstructured":"Bai L, Chen M, Xiao Q (2024) Multi-hop temporal knowledge graph reasoning with multi-agent reinforcement learning. Appl Soft Comput 160:111727","journal-title":"Appl Soft Comput"},{"key":"2603_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.112164","volume":"300","author":"X Luo","year":"2024","unstructured":"Luo X, Zhu A, Zhang J, Shao J (2024) Hierart: multi-hop temporal knowledge graph forecasting with hierarchical reinforcement learning. Knowl-Based Syst 300:112164","journal-title":"Knowl-Based Syst"},{"issue":"no. 2","key":"2603_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103605","volume":"61","author":"X Meng","year":"2024","unstructured":"Meng X, Bai L, Hu J, Zhu L (2024) Multi-hop path reasoning over sparse temporal knowledge graphs based on path completion and reward shaping. Inf Process Manage 61(2):103605","journal-title":"Inf Process Manage"},{"key":"2603_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2023.102292","volume":"120","author":"R Liu","year":"2024","unstructured":"Liu R, Yin G, Liu Z, Tian Y (2024) Reinforcement learning with time intervals for temporal knowledge graph reasoning. Inf Syst 120:102292","journal-title":"Inf Syst"},{"key":"2603_CR41","doi-asserted-by":"crossref","unstructured":"A. Garcia-Duran, S. Duman\u010di\u0107, and M. Niepert, \"Learning sequence encoders for temporal knowledge graph completion,\" In proceedings of the 2018 conference on empirical methods in natural language processing, 2018, pp. 4816\u20134821.","DOI":"10.18653\/v1\/D18-1516"},{"key":"2603_CR42","unstructured":"K. Leetaru and P. A. Schrodt, \"Gdelt: Global data on events, location, and tone, 1979\u20132012,\" Citeseer."},{"key":"2603_CR43","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-319-93417-4_38","volume-title":"The Semantic Web: 15th International Conference, ESWC 2018, Heraklion, Crete, Greece, June 3\u20137, 2018, Proceedings 15","author":"M Schlichtkrull","year":"2018","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, Van Den Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. The Semantic Web: 15th International Conference, ESWC 2018, Heraklion, Crete, Greece, June 3\u20137, 2018, Proceedings 15. Springer, pp 593\u2013607"},{"key":"2603_CR44","unstructured":"Z. Sun, Z.-H. Deng, J.-Y. Nie, and J. Tang, \"RotatE: knowledge graph embedding by relational rotation in complex space,\" in international conference on learning representations, 2018."},{"key":"2603_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126390","volume":"550","author":"P Shao","year":"2023","unstructured":"Shao P, He J, Li G, Zhang D, Tao J (2023) Hierarchical graph attention network for temporal knowledge graph reasoning. Neurocomputing 550:126390","journal-title":"Neurocomputing"},{"key":"2603_CR46","first-page":"7790","volume":"2023","author":"W Xu","year":"2023","unstructured":"Xu W, Liu B, Peng M, Jia X, Peng M (2023) Pre-trained language model with prompts for temporal knowledge graph completion. Find Assoc Comput Linguist: ACL 2023:7790\u20137803","journal-title":"Find Assoc Comput Linguist: ACL"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02603-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02603-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02603-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T05:07:20Z","timestamp":1763701640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02603-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,4]]},"references-count":46,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2603"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02603-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,4]]},"assertion":[{"value":"21 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}