{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T14:56:00Z","timestamp":1773413760432,"version":"3.50.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031434174","type":"print"},{"value":"9783031434181","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43418-1_33","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T09:02:26Z","timestamp":1694854946000},"page":"550-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Improving Few-Shot Inductive Learning on\u00a0Temporal Knowledge Graphs Using Confidence-Augmented Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Zifeng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingpei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongyue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunpu","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Tresp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"33_CR1","unstructured":"Abboud, R., Ceylan, \u0130.\u0130., Lukasiewicz, T., Salvatori, T.: Boxe: a box embedding model for knowledge base completion. In: NeurIPS (2020)"},{"key":"33_CR2","unstructured":"Ammanabrolu, P., Hausknecht, M.J.: Graph constrained reinforcement learning for natural language action spaces. In: ICLR. OpenReview.net (2020)"},{"key":"33_CR3","unstructured":"Baek, J., Lee, D.B., Hwang, S.J.: Learning to extrapolate knowledge: transductive few-shot out-of-graph link prediction. In: NeurIPS (2020)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Balazevic, I., Allen, C., Hospedales, T.M.: Tucker: tensor factorization for knowledge graph completion. In: EMNLP\/IJCNLP (1), pp. 5184\u20135193. Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/D19-1522"},{"key":"33_CR5","unstructured":"Bordes, A., Usunier, N., Garc\u00eda-Dur\u00e1n, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: NIPS, pp. 2787\u20132795 (2013)"},{"key":"33_CR6","unstructured":"Boschee, E., Lautenschlager, J., O\u2019Brien, S., Shellman, S., Starz, J., Ward, M.: ICEWS Coded Event Data (2015)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Chen, K., Wang, Y., Li, Y., Li, A.: Rotateqvs: representing temporal information as rotations in quaternion vector space for temporal knowledge graph completion. In: ACL (1), pp. 5843\u20135857. Association for Computational Linguistics (2022)","DOI":"10.18653\/v1\/2022.acl-long.402"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Chen, M., Zhang, W., Zhang, W., Chen, Q., Chen, H.: Meta relational learning for few-shot link prediction in knowledge graphs. In: EMNLP\/IJCNLP (1), pp. 4216\u20134225. Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/D19-1431"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Cho, K., et al.: Learning phrase representations using RNN encoder-decoder for statistical machine translation. In: EMNLP, pp. 1724\u20131734. ACL (2014)","DOI":"10.3115\/v1\/D14-1179"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Ding, Z., He, B., Ma, Y., Han, Z., Tresp, V.: Learning meta representations of one-shot relations for temporal knowledge graph link prediction. CoRR abs\/2205.10621 (2022)","DOI":"10.1109\/IJCNN54540.2023.10191619"},{"key":"33_CR11","unstructured":"Ding, Z., Ma, Y., He, B., Han, Z., Tresp, V.: A simple but powerful graph encoder for temporal knowledge graph completion. In: NeurIPS 2022 Temporal Graph Learning Workshop (2022)"},{"key":"33_CR12","unstructured":"Ding, Z., et al.: Forecasting question answering over temporal knowledge graphs. CoRR abs\/2208.06501 (2022)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Ding, Z., Wu, J., He, B., Ma, Y., Han, Z., Tresp, V.: Few-shot inductive learning on temporal knowledge graphs using concept-aware information. In: 4th Conference on Automated Knowledge Base Construction (2022)","DOI":"10.1007\/978-3-031-43418-1_33"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Guo, J., Kok, S.: Bique: biquaternionic embeddings of knowledge graphs. In: EMNLP (1), pp. 8338\u20138351. Association for Computational Linguistics (2021)","DOI":"10.18653\/v1\/2021.emnlp-main.657"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Hamaguchi, T., Oiwa, H., Shimbo, M., Matsumoto, Y.: Knowledge transfer for out-of-knowledge-base entities: a graph neural network approach. In: IJCAI, pp. 1802\u20131808. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/250"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"He, Y., Wang, Z., Zhang, P., Tu, Z., Ren, Z.: VN network: embedding newly emerging entities with virtual neighbors. In: CIKM, pp. 505\u2013514. ACM (2020)","DOI":"10.1145\/3340531.3411865"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Jung, J., Jung, J., Kang, U.: Learning to walk across time for interpretable temporal knowledge graph completion. In: KDD, pp. 786\u2013795. ACM (2021)","DOI":"10.1145\/3447548.3467292"},{"key":"33_CR18","unstructured":"Lacroix, T., Obozinski, G., Usunier, N.: Tensor decompositions for temporal knowledge base completion. In: ICLR. OpenReview.net (2020)"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Leblay, J., Chekol, M.W.: Deriving validity time in knowledge graph. In: WWW (Companion Volume), pp. 1771\u20131776. ACM (2018)","DOI":"10.1145\/3184558.3191639"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Li, J., Tang, T., Zhao, W.X., Wei, Z., Yuan, N.J., Wen, J.: Few-shot knowledge graph-to-text generation with pretrained language models. In: ACL\/IJCNLP (Findings). Findings of ACL, vol. ACL\/IJCNLP 2021, pp. 1558\u20131568. Association for Computational Linguistics (2021)","DOI":"10.18653\/v1\/2021.findings-acl.136"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Li, Z., et al.: Search from history and reason for future: two-stage reasoning on temporal knowledge graphs. In: ACL\/IJCNLP (1), pp. 4732\u20134743. Association for Computational Linguistics (2021)","DOI":"10.18653\/v1\/2021.acl-long.365"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Lin, Y., Liu, Z., Sun, M., Liu, Y., Zhu, X.: Learning entity and relation embeddings for knowledge graph completion. In: AAAI, pp. 2181\u20132187. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Messner, J., Abboud, R., Ceylan, \u0130.\u0130.: Temporal knowledge graph completion using box embeddings. In: AAAI, pp. 7779\u20137787. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i7.20746"},{"key":"33_CR24","unstructured":"Mirtaheri, M., Rostami, M., Ren, X., Morstatter, F., Galstyan, A.: One-shot learning for temporal knowledge graphs. In: 3rd Conference on Automated Knowledge Base Construction (2021)"},{"key":"33_CR25","unstructured":"Nickel, M., Tresp, V., Kriegel, H.: A three-way model for collective learning on multi-relational data. In: ICML, pp. 809\u2013816. Omnipress (2011)"},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"Sadeghian, A., Armandpour, M., Colas, A., Wang, D.Z.: Chronor: rotation based temporal knowledge graph embedding. In: AAAI, pp. 6471\u20136479. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i7.16802"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Saxena, A., Tripathi, A., Talukdar, P.P.: Improving multi-hop question answering over knowledge graphs using knowledge base embeddings. In: ACL, pp. 4498\u20134507. Association for Computational Linguistics (2020)","DOI":"10.18653\/v1\/2020.acl-main.412"},{"key":"33_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-319-93417-4_38","volume-title":"The Semantic Web","author":"M Schlichtkrull","year":"2018","unstructured":"Schlichtkrull, M., Kipf, T.N., Bloem, P., van\u00a0den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 593\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93417-4_38"},{"key":"33_CR29","doi-asserted-by":"crossref","unstructured":"Sheng, J., et al.: Adaptive attentional network for few-shot knowledge graph completion. In: EMNLP (1), pp. 1681\u20131691. Association for Computational Linguistics (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.131"},{"key":"33_CR30","doi-asserted-by":"crossref","unstructured":"Sun, H., Zhong, J., Ma, Y., Han, Z., He, K.: Timetraveler: reinforcement learning for temporal knowledge graph forecasting. In: EMNLP (1), pp. 8306\u20138319. Association for Computational Linguistics (2021)","DOI":"10.18653\/v1\/2021.emnlp-main.655"},{"key":"33_CR31","unstructured":"Tresp, V., Esteban, C., Yang, Y., Baier, S., Krompa\u00df, D.: Learning with memory embeddings. arXiv preprint arXiv:1511.07972 (2015)"},{"key":"33_CR32","unstructured":"Trouillon, T., Welbl, J., Riedel, S., Gaussier, \u00c9., Bouchard, G.: Complex embeddings for simple link prediction. In: ICML, JMLR Workshop and Conference Proceedings, vol. 48, pp. 2071\u20132080. JMLR.org (2016)"},{"key":"33_CR33","unstructured":"Tucker, L.R.: The extension of factor analysis to three-dimensional matrices. In: Gulliksen, H., Frederiksen, N. (eds.) Contributions to Mathematical Psychology, pp. 110\u2013127. Holt, Rinehart and Winston, New York (1964)"},{"key":"33_CR34","unstructured":"Vashishth, S., Sanyal, S., Nitin, V., Talukdar, P.P.: Composition-based multi-relational graph convolutional networks. In: ICLR. OpenReview.net (2020)"},{"key":"33_CR35","unstructured":"Vaswani, A., et al.: Attention is all you need. In: NIPS, pp. 5998\u20136008 (2017)"},{"key":"33_CR36","unstructured":"Vinyals, O., Blundell, C., Lillicrap, T., Kavukcuoglu, K., Wierstra, D.: Matching networks for one shot learning. In: NIPS, pp. 3630\u20133638 (2016)"},{"key":"33_CR37","doi-asserted-by":"crossref","unstructured":"Wang, P., Han, J., Li, C., Pan, R.: Logic attention based neighborhood aggregation for inductive knowledge graph embedding. In: AAAI, pp. 7152\u20137159. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33017152"},{"key":"33_CR38","unstructured":"Wang, R., et al.: Learning to sample and aggregate: few-shot reasoning over temporal knowledge graphs. In: NeurIPS (2022)"},{"key":"33_CR39","doi-asserted-by":"crossref","unstructured":"Wu, J., Cao, M., Cheung, J.C.K., Hamilton, W.L.: Temp: temporal message passing for temporal knowledge graph completion. In: EMNLP (1), pp. 5730\u20135746. Association for Computational Linguistics (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.462"},{"key":"33_CR40","doi-asserted-by":"crossref","unstructured":"Xiong, W., Yu, M., Chang, S., Guo, X., Wang, W.Y.: One-shot relational learning for knowledge graphs. In: EMNLP, pp. 1980\u20131990. Association for Computational Linguistics (2018)","DOI":"10.18653\/v1\/D18-1223"},{"key":"33_CR41","doi-asserted-by":"crossref","unstructured":"Xu, C., Chen, Y., Nayyeri, M., Lehmann, J.: Temporal knowledge graph completion using a linear temporal regularizer and multivector embeddings. In: NAACL-HLT, pp. 2569\u20132578. Association for Computational Linguistics (2021)","DOI":"10.18653\/v1\/2021.naacl-main.202"},{"key":"33_CR42","doi-asserted-by":"crossref","unstructured":"Xu, C., Nayyeri, M., Alkhoury, F., Yazdi, H.S., Lehmann, J.: Tero: a time-aware knowledge graph embedding via temporal rotation. In: COLING, pp. 1583\u20131593. International Committee on Computational Linguistics (2020)","DOI":"10.18653\/v1\/2020.coling-main.139"},{"key":"33_CR43","unstructured":"Yang, B., Yih, W., He, X., Gao, J., Deng, L.: Embedding entities and relations for learning and inference in knowledge bases. In: ICLR (Poster) (2015)"},{"key":"33_CR44","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Z., Ao, X., Zhuang, F., Xu, Y., He, Q.: Along the time: timeline-traced embedding for temporal knowledge graph completion. In: CIKM, pp. 2529\u20132538. ACM (2022)","DOI":"10.1145\/3511808.3557233"},{"key":"33_CR45","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Dai, H., Kozareva, Z., Smola, A.J., Song, L.: Variational reasoning for question answering with knowledge graph. In: AAAI, pp. 6069\u20136076. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.12057"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43418-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T13:13:10Z","timestamp":1719407590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43418-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434174","9783031434181"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43418-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"196","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.63","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}