{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T02:22:49Z","timestamp":1768875769108,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012456","name":"National Social Science Foundation","doi-asserted-by":"crossref","award":["19BYY076"],"award-info":[{"award-number":["19BYY076"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key R & D project of Shandong Province 2019","award":["JZZY010129"],"award-info":[{"award-number":["JZZY010129"]}]},{"name":"Shandong Natural Science Foundation","award":["ZR2021MF064,ZR2021QG041"],"award-info":[{"award-number":["ZR2021MF064,ZR2021QG041"]}]},{"name":"Shandong Provincial Social Science Planning Project","award":["19BJCJ51"],"award-info":[{"award-number":["19BJCJ51"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10489-022-03913-6","type":"journal-article","created":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T14:03:58Z","timestamp":1658757838000},"page":"8195-8208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["An improving reasoning network for complex question answering over temporal knowledge graphs"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0912-8257","authenticated-orcid":false,"given":"Songlin","family":"Jiao","sequence":"first","affiliation":[]},{"given":"Zhenfang","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Wenqing","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Zicheng","family":"Zuo","sequence":"additional","affiliation":[]},{"given":"Jiangtao","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Wenling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guangyuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Peiyu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,25]]},"reference":[{"key":"3913_CR1","unstructured":"Trivedi R, Dai H, Wang Y, Song L (2017) Know-evolve: deep temporal reasoning for dynamic knowledge graphs. In: International conference on machine learning. PMLR, pp 3462\u20133471"},{"key":"3913_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1162\/tacl_a_00459","volume":"10","author":"B Dhingra","year":"2022","unstructured":"Dhingra B, Cole J R, Eisenschlos J M, Gillick D, Eisenstein J, Cohen W W (2022) Time-aware language models as temporal knowledge bases. Trans Assoc Comput Ling 10:257\u2013273. https:\/\/doi.org\/10.1162\/tacl_a_00459, https:\/\/arxiv.org\/abs\/https:\/\/direct.mit.edu\/tacl\/article-pdf\/doi\/10.1162\/tacl_a_00459\/2004543\/tacl_a_00459.pdf","journal-title":"Trans Assoc Comput Ling"},{"key":"3913_CR3","doi-asserted-by":"publisher","unstructured":"Jia Z, Abujabal A, Saha Roy R, Str\u00f6tgen J, Weikum G (2018) Tequila: temporal question answering over knowledge bases. In: Proceedings of the 27th ACM international conference on information and knowledge management, CIKM \u201918. https:\/\/doi.org\/10.1145\/3269206.3269247. Association for Computing Machinery, New York, pp 1807\u20131810","DOI":"10.1145\/3269206.3269247"},{"key":"3913_CR4","doi-asserted-by":"crossref","unstructured":"Jia Z, Pramanik S, Saha Roy R, Weikum G (2021) Complex temporal question answering on knowledge graphs. In: Proceedings of the 30th ACM international conference on information & knowledge management, pp 792\u2013802","DOI":"10.1145\/3459637.3482416"},{"key":"3913_CR5","doi-asserted-by":"crossref","unstructured":"Jia Z, Abujabal A, Saha Roy R, Str\u00f6tgen J, Weikum G (2018) Tempquestions: a benchmark for temporal question answering. In: Companion proceedings of the the web conference 2018, pp 1057\u20131062","DOI":"10.1145\/3184558.3191536"},{"key":"3913_CR6","doi-asserted-by":"crossref","unstructured":"Saxena A, Chakrabarti S, Talukdar P (2021) Question answering over 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). https:\/\/doi.org\/https:\/\/aclanthology.org\/2021.acl-long.520. Association for Computational Linguistics, Online, pp 6663\u20136676","DOI":"10.18653\/v1\/2021.acl-long.520"},{"key":"3913_CR7","unstructured":"Lacroix T, Obozinski G, Usunier N (2020) Tensor decompositions for temporal knowledge base completion. In: 8th International conference on learning representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020. https:\/\/doi.org\/https:\/\/openreview.net\/forum?id=rke2P1BFwS"},{"issue":"10","key":"3913_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107 D, Kr\u00f6tzsch M (2014) Wikidata: a free collaborative knowledgebase. Commun ACM 57(10):78\u201385","journal-title":"Commun ACM"},{"key":"3913_CR9","doi-asserted-by":"crossref","unstructured":"Bollacker K, Evans C, Paritosh P, Sturge T, Taylor J (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, pp 1247\u20131250","DOI":"10.1145\/1376616.1376746"},{"issue":"5","key":"3913_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/3191513","volume":"61","author":"T Mitchell","year":"2018","unstructured":"Mitchell T, Cohen W, Hruschka E, Talukdar P, Yang B, Betteridge J, Carlson A, Dalvi B, Gardner M, Kisiel B et al (2018) Never-ending learning. Commun ACM 61(5):103\u2013115","journal-title":"Commun ACM"},{"key":"3913_CR11","doi-asserted-by":"crossref","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. https:\/\/aclanthology.org\/D18-1516. Association for Computational Linguistics, Brussels, pp 4816\u20134821","DOI":"10.18653\/v1\/D18-1516"},{"key":"3913_CR12","doi-asserted-by":"crossref","unstructured":"Dasgupta S S, Ray S N, Talukdar P (2018) HyTE: hyperplane-based temporally aware knowledge graph embedding. In: Proceedings of the 2018 conference on empirical methods in natural language processing. https:\/\/aclanthology.org\/D18-1225. Association for Computational Linguistics, Brussels, pp 2001\u20132011","DOI":"10.18653\/v1\/D18-1225"},{"key":"3913_CR13","doi-asserted-by":"crossref","unstructured":"Goel R, Kazemi S M, Brubaker M, Poupart P (2020) Diachronic embedding for temporal knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, pp 3988\u20133995","DOI":"10.1609\/aaai.v34i04.5815"},{"key":"3913_CR14","doi-asserted-by":"crossref","unstructured":"Jain P, Rathi S, Mausam, Chakrabarti S (2020) Temporal knowledge base completion: new algorithms and evaluation protocols. In: Proceedings of the 2020 conference on empirical methods in natural language processing (EMNLP). https:\/\/aclanthology.org\/2020.emnlp-main.305. Association for Computational Linguistics, Online, pp 3733\u20133747","DOI":"10.18653\/v1\/2020.emnlp-main.305"},{"key":"3913_CR15","doi-asserted-by":"crossref","unstructured":"Goel R, Kazemi S M, Brubaker M, Poupart P (2020) Diachronic embedding for temporal knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, pp 3988\u20133995","DOI":"10.1609\/aaai.v34i04.5815"},{"key":"3913_CR16","doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI conference on artificial intelligence, vol 28","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"3913_CR17","unstructured":"Trouillon T, Welbl J, Riedel S, Gaussier E, Bouchard G (2016) Complex embeddings for simple link prediction. In: Balcan M F, Weinberger K Q (eds) Proceedings of the 33rd international conference on machine learning. https:\/\/proceedings.mlr.press\/v48\/trouillon16.html, vol 48. PMLR, New York, pp 2071\u20132080"},{"key":"3913_CR18","unstructured":"Kazemi S M, Poole D (2018) Simple embedding for link prediction in knowledge graphs. Advances in Neural Information Processing Systems, 31"},{"key":"3913_CR19","unstructured":"Sun Z, Deng Z-H, Nie J-Y, Tang J (2019) Rotate: knowledge graph embedding by relational rotation in complex space. In: 7th International conference on learning representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. https:\/\/openreview.net\/forum?id=HkgEQnRqYQ"},{"key":"3913_CR20","doi-asserted-by":"crossref","unstructured":"Balazevic I, Allen C, Hospedales T (2019) TuckER: tensor factorization for knowledge graph completion. 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). https:\/\/aclanthology.org\/D19-1522. Association for Computational Linguistics, Hong Kong, pp 5185\u20135194","DOI":"10.18653\/v1\/D19-1522"},{"key":"3913_CR21","doi-asserted-by":"crossref","unstructured":"Miller A, Fisch A, Dodge J, Karimi A-H, Bordes A, Weston J (2016) Key-value memory networks for directly reading documents. In: Proceedings of the 2016 conference on empirical methods in natural language processing. https:\/\/aclanthology.org\/D16-1147. Association for Computational Linguistics, Austin, pp 1400\u20131409","DOI":"10.18653\/v1\/D16-1147"},{"key":"3913_CR22","doi-asserted-by":"crossref","unstructured":"Sun H, Bedrax-Weiss T, Cohen W (2019) PullNet: open domain question answering with iterative retrieval on knowledge bases and text. 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). https:\/\/aclanthology.org\/D19-1242. Association for Computational Linguistics, Hong Kong, pp 2380\u20132390","DOI":"10.18653\/v1\/D19-1242"},{"key":"3913_CR23","unstructured":"Cohen W W, Sun H, Hofer R A, Siegler M (2020) Scalable neural methods for reasoning with a symbolic knowledge base. In: 8th International conference on learning representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020. https:\/\/openreview.net\/forum?id=BJlguT4YPr"},{"key":"3913_CR24","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ins.2019.12.002","volume":"514","author":"M Esposito","year":"2020","unstructured":"Esposito M, Damiano E, Minutolo A, De Pietro G, Fujita H (2020) Hybrid query expansion using lexical resources and word embeddings for sentence retrieval in question answering. Inf Sci 514:88\u2013105. https:\/\/doi.org\/10.1016\/j.ins.2019.12.002, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025519311107","journal-title":"Inf Sci"},{"key":"3913_CR25","doi-asserted-by":"crossref","unstructured":"He G, Lan Y, Jiang J, Zhao W X, Wen J-R (2021) Improving multi-hop knowledge base question answering by learning intermediate supervision signals. In: Proceedings of the 14th ACM international conference on web search and data mining, pp 553\u2013561","DOI":"10.1145\/3437963.3441753"},{"key":"3913_CR26","doi-asserted-by":"crossref","unstructured":"Souza Costa 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","DOI":"10.1145\/3340531.3412760"},{"issue":"3","key":"3913_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.3390\/fi12030045","volume":"12","author":"W Wu","year":"2020","unstructured":"Wu W, Zhu Z, Lu Q, Zhang D, Guo Q (2020) Introducing external knowledge to answer questions with implicit temporal constraints over knowledge base. Future Internet 12(3):45","journal-title":"Future Internet"},{"key":"3913_CR28","doi-asserted-by":"crossref","unstructured":"Mavromatis C, Subramanyam P L, Ioannidis V N, Adeshina S, Howard P R, Grinberg T, Hakim N, Karypis G (2021) Tempoqr: temporal question reasoning over knowledge graphs. arXiv:2112.05785","DOI":"10.1609\/aaai.v36i5.20526"},{"key":"3913_CR29","unstructured":"Kipf T N, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: 5th International conference on learning representations, ICLR 2017, Toulon, France, April 24-26, 2017, conference track proceedings. https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"3913_CR30","doi-asserted-by":"crossref","unstructured":"Sun H, Dhingra B, Zaheer M, Mazaitis K, Salakhutdinov R, Cohen W (2018) Open domain question answering using early fusion of knowledge bases and text. In: Proceedings of the 2018 conference on empirical methods in natural language processing. https:\/\/aclanthology.org\/D18-1455. Association for Computational Linguistics, Brussels, pp 4231\u20134242","DOI":"10.18653\/v1\/D18-1455"},{"key":"3913_CR31","doi-asserted-by":"crossref","unstructured":"Pang S, Xue Y, Yan Z, Huang W, Feng J (2021) Dynamic and multi-channel graph convolutional networks for aspect-based sentiment analysis. In: Findings of the association for computational linguistics: ACL-IJCNLP 2021, pp 2627\u20132636","DOI":"10.18653\/v1\/2021.findings-acl.232"},{"key":"3913_CR32","doi-asserted-by":"publisher","first-page":"14","DOI":"10.3390\/app10144710","volume":"10","author":"M Pota","year":"2020","unstructured":"Pota M, Esposito M, De Pietro G, Fujita H (2020) Best practices of convolutional neural networks for question classification. Appl Sci 10:14. https:\/\/doi.org\/10.3390\/app10144710, https:\/\/www.mdpi.com\/2076-3417\/10\/14\/4710","journal-title":"Appl Sci"},{"key":"3913_CR33","doi-asserted-by":"crossref","unstructured":"F\u00e9vry T, Baldini Soares L, FitzGerald N, Choi E, Kwiatkowski T (2020) Entities as experts: sparse memory access with entity supervision. In: Proceedings of the 2020 conference on empirical methods in natural language processing (EMNLP). https:\/\/aclanthology.org\/2020.emnlp-main.400. Association for Computational Linguistics, Online, pp 4937\u20134951","DOI":"10.18653\/v1\/2020.emnlp-main.400"},{"key":"3913_CR34","unstructured":"Sanh V, Debut L, Chaumond J, Wolf T (2019) Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter. arXiv:1910.01108"},{"key":"3913_CR35","unstructured":"Kingma D P, Ba J (2015) Adam: a method for stochastic optimization. In: Bengio Y, LeCun Y (eds) 3rd International conference on learning representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, conference track proceedings. 1412.6980"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03913-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03913-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03913-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T02:25:46Z","timestamp":1678933546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03913-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,25]]},"references-count":35,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["3913"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03913-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,25]]},"assertion":[{"value":"19 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"We wish to confirm that there are no known conflicts of interest associated with this publication and there has been no significant financial support for this work that could have influenced its outcome.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We confirm that the manuscript has been read and approved by all named authors and that there are no other persons who satisfied the criteria for authorship but are not listed. We further confirm that the order of authors listed in the manuscript has been approved by all of us.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We confirm that we have given due consideration to the protection of intellectual property associated with this work and that there are no impediments to publication, including the timing of publication, with respect to intellectual property. In so doing we confirm that we have followed the regulations of our institutions concerning intellectual property.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We understand that the Corresponding Author is the sole contact for the Editorial process (including Editorial Manager and direct communications with the office). He\/she is responsible for communicating with the other authors about progress, submissions of revisions and final approval of proofs. We confirm that we have provided a current, correct email address which is accessible by the Corresponding Author.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}}]}}