{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:03:05Z","timestamp":1743102185481,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306716"},{"type":"electronic","value":"9783031306723"}],"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-30672-3_52","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T11:10:49Z","timestamp":1681384249000},"page":"768-783","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Temporal-Relational Matching Network for\u00a0Few-Shot Temporal Knowledge Graph Completion"],"prefix":"10.1007","author":[{"given":"Xing","family":"Gong","sequence":"first","affiliation":[]},{"given":"Jianyang","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Heyan","family":"Chai","sequence":"additional","affiliation":[]},{"given":"Ye","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Liao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Bai, L., Zhang, M., Zhang, H., Zhang, H.: FTMF: Few-shot temporal knowledge graph completion based on meta-optimization and fault-tolerant mechanism. In: World Wide Web, pp. 1\u201328 (2022)","DOI":"10.1007\/s11280-022-01091-6"},{"key":"52_CR2","unstructured":"Bordes, A., Usunier, N., Garc\u00eda-Dur\u00e1n, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: NeurIPS, pp. 2787\u20132795 (2013)"},{"key":"52_CR3","doi-asserted-by":"publisher","unstructured":"Boschee, E., Lautenschlager, J., O\u2019Brien, S., Shellman, S., Starz, J., Ward, M.: ICEWS Coded Event Data (2015). https:\/\/doi.org\/10.7910\/DVN\/28075","DOI":"10.7910\/DVN\/28075"},{"key":"52_CR4","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, pp. 4217\u20134226 (2019)","DOI":"10.18653\/v1\/D19-1431"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Goel, R., Kazemi, S.M., Brubaker, M.A., Poupart, P.: Diachronic embedding for temporal knowledge graph completion. In: AAAI, pp. 3988\u20133995 (2020)","DOI":"10.1609\/aaai.v34i04.5815"},{"issue":"4","key":"52_CR6","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00778-016-0427-4","volume":"25","author":"I Jeon","year":"2016","unstructured":"Jeon, I., Papalexakis, E.E., Faloutsos, C., Sael, L., Kang, U.: Mining billion-scale tensors: Algorithms and discoveries. VLDB J. 25(4), 519\u2013544 (2016). https:\/\/doi.org\/10.1007\/s00778-016-0427-4","journal-title":"VLDB J."},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Jiang, Z., Gao, J., Lv, X.: Metap: Meta pattern learning for one-shot knowledge graph completion. In: SIGIR, pp. 2232\u20132236 (2021)","DOI":"10.1145\/3404835.3463086"},{"key":"52_CR8","unstructured":"Kazemi, S.M., Poole, D.: Simple embedding for link prediction in knowledge graphs. NeurIPS, pp. 4289\u20134300 (2018)"},{"key":"52_CR9","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. CoRR (2015)"},{"key":"52_CR10","unstructured":"Lacroix, T., Obozinski, G., Usunier, N.: Tensor decompositions for temporal knowledge base completion. In: ICLR (2019)"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Leblay, J., Chekol, M.W.: Deriving validity time in knowledge graph. WWW, pp. 1771\u20131776 (2018)","DOI":"10.1145\/3184558.3191639"},{"key":"52_CR12","doi-asserted-by":"crossref","unstructured":"Liu, Z., Xiong, C., Sun, M., Liu, Z.: Entity-duet neural ranking: Understanding the role of knowledge graph semantics in neural information retrieval. In: ACL, pp. 2395\u20132405 (2018)","DOI":"10.18653\/v1\/P18-1223"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Niu, G., et al.: Relational learning with gated and attentive neighbor aggregator for few-shot knowledge graph completion. In: SIGIR, pp. 213\u2013222 (2021)","DOI":"10.1145\/3404835.3462925"},{"key":"52_CR14","unstructured":"Ravi, S., Larochelle, H.: Optimization as a model for few-shot learning. In: ICLR (2017)"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Sheng, J., et al.: Adaptive attentional network for few-shot knowledge graph completion. In: EMNLP, pp. 1681\u20131691 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.131"},{"key":"52_CR16","unstructured":"Trouillon, T., Welbl, J., Riedel, S., Gaussier, \u00c9., Bouchard, G.: Complex embeddings for simple link prediction. In: ICML, pp. 2071\u20132080 (2016)"},{"key":"52_CR17","unstructured":"Vinyals, O., Blundell, C., Lillicrap, T., Wierstra, D., et al.: Matching networks for one shot learning. NeurIPS, pp. 3637\u20133645 (2016)"},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"Wang, X., Wang, D., Xu, C., He, X., Cao, Y., Chua, T.S.: Explainable reasoning over knowledge graphs for recommendation. In: AAAI, pp. 5329\u20135336 (2019)","DOI":"10.1609\/aaai.v33i01.33015329"},{"key":"52_CR19","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 (2018)","DOI":"10.18653\/v1\/D18-1223"},{"key":"52_CR20","doi-asserted-by":"crossref","unstructured":"Xu, C., Chen, Y.Y., Nayyeri, M., Lehmann, J.: Temporal knowledge graph completion using a linear temporal regularizer and multivector embeddings. In: NAACL, pp. 2569\u20132578 (2021)","DOI":"10.18653\/v1\/2021.naacl-main.202"},{"key":"52_CR21","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 (2020)","DOI":"10.18653\/v1\/2020.coling-main.139"},{"key":"52_CR22","doi-asserted-by":"crossref","unstructured":"Xu, C., Nayyeri, M., Alkhoury, F., Yazdi, H., Lehmann, J.: Temporal knowledge graph completion based on time series gaussian embedding. In: ISWC, pp. 654\u2013671 (2020)","DOI":"10.1007\/978-3-030-62419-4_37"},{"key":"52_CR23","unstructured":"Xu, D., Ruan, C., K\u00f6rpeoglu, E., Kumar, S., Achan, K.: Inductive representation learning on temporal graphs. ArXiv (2020)"},{"key":"52_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, C., Yao, H., Huang, C., Jiang, M., Li, Z.J., Chawla, N.: Few-shot knowledge graph completion. In: AAAI, pp. 3041\u20133048 (2020)","DOI":"10.1609\/aaai.v34i03.5698"},{"key":"52_CR25","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. 1\u20138 (2018)","DOI":"10.1609\/aaai.v32i1.12057"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30672-3_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:34:36Z","timestamp":1710264876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30672-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306716","9783031306723"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30672-3_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","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":"125","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":"66","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":"19% - 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","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":"7.3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}