{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T19:24:03Z","timestamp":1775676243301,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["101093202"],"award-info":[{"award-number":["101093202"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3615294","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:26Z","timestamp":1697874326000},"page":"5228-5231","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Reasoning beyond Triples: Recent Advances in Knowledge Graph Embeddings"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5859-1961","authenticated-orcid":false,"given":"Bo","family":"Xiong","sequence":"first","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9177-0312","authenticated-orcid":false,"given":"Mojtaba","family":"Nayyeri","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6521-8807","authenticated-orcid":false,"given":"Daniel","family":"Daza","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam &amp; University of Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5726-4638","authenticated-orcid":false,"given":"Michael","family":"Cochez","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2787","volume-title":"NIPS","author":"Bordes Antoine","year":"2013","unstructured":"Antoine Bordes , Nicolas Usunier , Alberto Garc\u00eda-Dur\u00e1n , Jason Weston , and Oksana Yakhnenko . Translating embeddings for modeling multi-relational data . In NIPS , pages 2787 -- 2795 , 2013 . Antoine Bordes, Nicolas Usunier, Alberto Garc\u00eda-Dur\u00e1n, Jason Weston, and Oksana Yakhnenko. Translating embeddings for modeling multi-relational data. In NIPS, pages 2787--2795, 2013."},{"key":"e_1_3_2_1_2_1","volume-title":"ICLR (Poster). OpenReview.net","author":"Sun Zhiqing","year":"2019","unstructured":"Zhiqing Sun , Zhi-Hong Deng , Jian-Yun Nie , and Jian Tang . RotatE: Knowledge graph embedding by relational rotation in complex space . In ICLR (Poster). OpenReview.net , 2019 . Zhiqing Sun, Zhi-Hong Deng, Jian-Yun Nie, and Jian Tang. RotatE: Knowledge graph embedding by relational rotation in complex space. In ICLR (Poster). OpenReview.net, 2019."},{"key":"e_1_3_2_1_3_1","series-title":"JMLR Workshop and Conference Proceedings","first-page":"2071","volume-title":"ICML","author":"Trouillon Th\u00e9o","year":"2016","unstructured":"Th\u00e9o Trouillon , Johannes Welbl , Sebastian Riedel , \u00c9ric Gaussier , and Guillaume Bouchard . Complex embeddings for simple link prediction . In ICML , volume 48 of JMLR Workshop and Conference Proceedings , pages 2071 -- 2080 . JMLR. org, 2016 . Th\u00e9o Trouillon, Johannes Welbl, Sebastian Riedel, \u00c9ric Gaussier, and Guillaume Bouchard. Complex embeddings for simple link prediction. In ICML, volume 48 of JMLR Workshop and Conference Proceedings, pages 2071--2080. JMLR.org, 2016."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539333"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.139"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20746"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.596"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.743"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1260"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191639"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1225"},{"key":"e_1_3_2_1_12_1","first-page":"6141","volume-title":"ACL","author":"Guan Saiping","year":"2020","unstructured":"Saiping Guan , Xiaolong Jin , Jiafeng Guo , Yuanzhuo Wang , and Xueqi Cheng . NeuInfer : Knowledge inference on n-ary facts . In ACL , pages 6141 -- 6151 . Association for Computational Linguistics , 2020 . Saiping Guan, Xiaolong Jin, Jiafeng Guo, Yuanzhuo Wang, and Xueqi Cheng. NeuInfer: Knowledge inference on n-ary facts. In ACL, pages 6141--6151. Association for Computational Linguistics, 2020."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380257"},{"key":"e_1_3_2_1_14_1","volume-title":"ICLR. OpenReview.net","author":"Vashishth Shikhar","year":"2020","unstructured":"Shikhar Vashishth , Soumya Sanyal , Vikram Nitin , and Partha P. Talukdar . Composition-based multi-relational graph convolutional networks . In ICLR. OpenReview.net , 2020 . Shikhar Vashishth, Soumya Sanyal, Vikram Nitin, and Partha P. Talukdar. Composition-based multi-relational graph convolutional networks. In ICLR. OpenReview.net, 2020."},{"key":"e_1_3_2_1_15_1","first-page":"1300","volume-title":"IJCAI","author":"Wen Jianfeng","year":"2016","unstructured":"Jianfeng Wen , Jianxin Li , Yongyi Mao , Shini Chen , and Richong Zhang . On the representation and embedding of knowledge bases beyond binary relations . In IJCAI , pages 1300 -- 1307 . IJCAI\/AAAI Press , 2016 . Jianfeng Wen, Jianxin Li, Yongyi Mao, Shini Chen, and Richong Zhang. On the representation and embedding of knowledge bases beyond binary relations. In IJCAI, pages 1300--1307. IJCAI\/AAAI Press, 2016."},{"key":"e_1_3_2_1_16_1","first-page":"1185","volume-title":"WWW","author":"Zhang Richong","year":"2018","unstructured":"Richong Zhang , Junpeng Li , Jiajie Mei , and Yongyi Mao . Scalable instance reconstruction in knowledge bases via relatedness affiliated embedding . In WWW , pages 1185 -- 1194 . ACM, 2018 . Richong Zhang, Junpeng Li, Jiajie Mei, and Yongyi Mao. Scalable instance reconstruction in knowledge bases via relatedness affiliated embedding. In WWW, pages 1185--1194. ACM, 2018."},{"key":"e_1_3_2_1_17_1","first-page":"2191","volume-title":"IJCAI","author":"Fatemi Bahare","year":"2020","unstructured":"Bahare Fatemi , Perouz Taslakian , David V\u00e1zquez , and David Poole . Knowledge hypergraphs : Prediction beyond binary relations . In IJCAI , pages 2191 -- 2197 . ijcai.org, 2020 . Bahare Fatemi, Perouz Taslakian, David V\u00e1zquez, and David Poole. Knowledge hypergraphs: Prediction beyond binary relations. In IJCAI, pages 2191--2197. ijcai.org, 2020."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450141"},{"key":"e_1_3_2_1_19_1","volume-title":"BioBLP: A modular framework for learning on multimodal biomedical knowledge graphs","author":"Daza Daniel","year":"2023","unstructured":"Daniel Daza , Dimitrios Alivanistos , Payal Mitra , Thom Pijnenburg , Michael Cochez , and Paul Groth . BioBLP: A modular framework for learning on multimodal biomedical knowledge graphs , 2023 . Daniel Daza, Dimitrios Alivanistos, Payal Mitra, Thom Pijnenburg, Michael Cochez, and Paul Groth. BioBLP: A modular framework for learning on multimodal biomedical knowledge graphs, 2023."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-3017"},{"key":"e_1_3_2_1_21_1","volume-title":"A survey on temporal knowledge graph completion: Taxonomy, progress, and prospects. arXiv preprint arXiv:2308.02457","author":"Wang Jiapu","year":"2023","unstructured":"Jiapu Wang , Boyue Wang , Meikang Qiu , Shirui Pan , Bo Xiong , Heng Liu , Linhao Luo , Tengfei Liu , Yongli Hu , Baocai Yin , A survey on temporal knowledge graph completion: Taxonomy, progress, and prospects. arXiv preprint arXiv:2308.02457 , 2023 . Jiapu Wang, Boyue Wang, Meikang Qiu, Shirui Pan, Bo Xiong, Heng Liu, Linhao Luo, Tengfei Liu, Yongli Hu, Baocai Yin, et al. A survey on temporal knowledge graph completion: Taxonomy, progress, and prospects. arXiv preprint arXiv:2308.02457, 2023."},{"key":"e_1_3_2_1_22_1","volume-title":"ICLR","author":"Lacroix Timoth\u00e9e","year":"2020","unstructured":"Timoth\u00e9e Lacroix , Guillaume Obozinski , and Nicolas Usunier . Tensor decompositions for temporal knowledge base completion . In ICLR , 2020 . Timoth\u00e9e Lacroix, Guillaume Obozinski, and Nicolas Usunier. Tensor decompositions for temporal knowledge base completion. In ICLR, 2020."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.202"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62419-4_37"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.593"},{"key":"e_1_3_2_1_26_1","first-page":"3462","volume-title":"ICML","author":"Trivedi Rakshit","year":"2017","unstructured":"Rakshit Trivedi , Hanjun Dai , Yichen Wang , and Le Song . Know-evolve : Deep temporal reasoning for dynamic knowledge graphs . In ICML , pages 3462 -- 3471 . PMLR, 2017 . Rakshit Trivedi, Hanjun Dai, Yichen Wang, and Le Song. Know-evolve: Deep temporal reasoning for dynamic knowledge graphs. In ICML, pages 3462--3471. PMLR, 2017."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.462"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462963"},{"key":"e_1_3_2_1_29_1","volume-title":"Improving hyper-relational knowledge graph completion","author":"Yu Donghan","year":"2021","unstructured":"Donghan Yu and Yiming Yang . Improving hyper-relational knowledge graph completion . volume abs\/ 2104 .08167, 2021 . Donghan Yu and Yiming Yang. Improving hyper-relational knowledge graph completion. volume abs\/2104.08167, 2021."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-acl.35"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2893873.2894046"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380188"},{"key":"e_1_3_2_1_33_1","first-page":"4289","volume-title":"NeurIPS","author":"Kazemi Seyed Mehran","year":"2018","unstructured":"Seyed Mehran Kazemi and David Poole . SimplE embedding for link prediction in knowledge graphs . In NeurIPS , pages 4289 -- 4300 , 2018 . Seyed Mehran Kazemi and David Poole. SimplE embedding for link prediction in knowledge graphs. In NeurIPS, pages 4289--4300, 2018."},{"key":"e_1_3_2_1_34_1","first-page":"1","volume-title":"Knowledge graph completion via complex tensor factorization","author":"Trouillon Th\u00e9o","year":"2017","unstructured":"Th\u00e9o Trouillon , Christopher R Dance , \u00c9ric Gaussier , Johannes Welbl , Sebastian Riedel , and Guillaume Bouchard . Knowledge graph completion via complex tensor factorization . volume 18 , pages 1 -- 38 , 2017 . Th\u00e9o Trouillon, Christopher R Dance, \u00c9ric Gaussier, Johannes Welbl, Sebastian Riedel, and Guillaume Bouchard. Knowledge graph completion via complex tensor factorization. volume 18, pages 1--38, 2017."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1522"},{"key":"e_1_3_2_1_36_1","first-page":"2660","volume-title":"WWW","author":"Liu Yu","year":"2021","unstructured":"Yu Liu , Quanming Yao , and Yong Li . Role-aware modeling for n-ary relational knowledge bases . In WWW , pages 2660 -- 2671 , 2021 . Yu Liu, Quanming Yao, and Yong Li. Role-aware modeling for n-ary relational knowledge bases. In WWW, pages 2660--2671, 2021."},{"key":"e_1_3_2_1_37_1","first-page":"4043","volume-title":"WWW","author":"Di Shimin","year":"2021","unstructured":"Shimin Di , Quanming Yao , and Lei Chen . Searching to sparsify tensor decomposition for n-ary relational data . In WWW , pages 4043 -- 4054 . ACM \/ IW3C2, 2021 . Shimin Di, Quanming Yao, and Lei Chen. Searching to sparsify tensor decomposition for n-ary relational data. In WWW, pages 4043--4054. ACM \/ IW3C2, 2021."},{"key":"e_1_3_2_1_38_1","first-page":"4281","volume-title":"Proceedings of ACL 2022","author":"Wang Liang","year":"2022","unstructured":"Liang Wang , Wei Zhao , Zhuoyu Wei , and Jingming Liu . SimKGC : Simple contrastive knowledge graph completion with pre-trained language models. In Smaranda Muresan, Preslav Nakov, and Aline Villavicencio, editors , Proceedings of ACL 2022 , pages 4281 -- 4294 . acl, 2022 . Liang Wang, Wei Zhao, Zhuoyu Wei, and Jingming Liu. SimKGC: Simple contrastive knowledge graph completion with pre-trained language models. In Smaranda Muresan, Preslav Nakov, and Aline Villavicencio, editors, Proceedings of ACL 2022, pages 4281--4294. acl, 2022."},{"key":"e_1_3_2_1_39_1","first-page":"604","volume-title":"Findings of the ACL: NAACL 2022","author":"Markowitz Elan","year":"2022","unstructured":"Elan Markowitz , Keshav Balasubramanian , Mehrnoosh Mirtaheri , Murali Annavaram , Aram Galstyan , and Greg Ver Steeg . StATIK : Structure and text for inductive knowledge graph completion. In Marine Carpuat, Marie-Catherine de Marneffe, and Iv\u00e1n Vladimir Meza Ru\u00edz, editors , Findings of the ACL: NAACL 2022 , pages 604 -- 615 . ACL, 2022 . Elan Markowitz, Keshav Balasubramanian, Mehrnoosh Mirtaheri, Murali Annavaram, Aram Galstyan, and Greg Ver Steeg. StATIK: Structure and text for inductive knowledge graph completion. In Marine Carpuat, Marie-Catherine de Marneffe, and Iv\u00e1n Vladimir Meza Ru\u00edz, editors, Findings of the ACL: NAACL 2022, pages 604--615. ACL, 2022."},{"key":"e_1_3_2_1_40_1","volume-title":"CascadER: Cross-modal cascading for knowledge graph link prediction. CoRR, abs\/2205.08012","author":"Safavi Tara","year":"2022","unstructured":"Tara Safavi , Doug Downey , and Tom Hope . CascadER: Cross-modal cascading for knowledge graph link prediction. CoRR, abs\/2205.08012 , 2022 . Tara Safavi, Doug Downey, and Tom Hope. CascadER: Cross-modal cascading for knowledge graph link prediction. CoRR, abs\/2205.08012, 2022."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1516"},{"key":"e_1_3_2_1_42_1","volume-title":"Elsevier","author":"Shao Pengpeng","year":"2022","unstructured":"Pengpeng Shao , Dawei Zhang , Guohua Yang , Jianhua Tao , Feihu Che , and Tong Liu . Tucker decomposition-based temporal knowledge graph completion. volume 238, page 107841 . Elsevier , 2022 . Pengpeng Shao, Dawei Zhang, Guohua Yang, Jianhua Tao, Feihu Che, and Tong Liu. Tucker decomposition-based temporal knowledge graph completion. volume 238, page 107841. Elsevier, 2022."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.658"},{"key":"e_1_3_2_1_44_1","volume-title":"Learning representations for hyper-relational knowledge graphs","author":"Shomer Harry","year":"2022","unstructured":"Harry Shomer , Wei Jin , Juan-Hui Li , Yao Ma , and Jiliang Tang . Learning representations for hyper-relational knowledge graphs . volume abs\/ 2208 .14322, 2022 . Harry Shomer, Wei Jin, Juan-Hui Li, Yao Ma, and Jiliang Tang. Learning representations for hyper-relational knowledge graphs. volume abs\/2208.14322, 2022."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10329"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1359"},{"key":"e_1_3_2_1_47_1","volume-title":"Kblrn: End-to-end learning of knowledge base representations with latent, relational, and numerical features. arXiv preprint arXiv:1709.04676","author":"Garc\u00eda-Dur\u00e1n Alberto","year":"2017","unstructured":"Alberto Garc\u00eda-Dur\u00e1n and Mathias Niepert . Kblrn: End-to-end learning of knowledge base representations with latent, relational, and numerical features. arXiv preprint arXiv:1709.04676 , 2017 . Alberto Garc\u00eda-Dur\u00e1n and Mathias Niepert. Kblrn: End-to-end learning of knowledge base representations with latent, relational, and numerical features. arXiv preprint arXiv:1709.04676, 2017."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19433-7_2"},{"key":"e_1_3_2_1_49_1","volume-title":"Knowledge graph embeddings tutorial: From theory to practice","author":"Costabello Luca","year":"2020","unstructured":"Luca Costabello , Sumit Pai , Nicholas McCarthy , and Adrianna Janik . Knowledge graph embeddings tutorial: From theory to practice . 2020 . Luca Costabello, Sumit Pai, Nicholas McCarthy, and Adrianna Janik. Knowledge graph embeddings tutorial: From theory to practice. 2020."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412176"},{"key":"e_1_3_2_1_51_1","volume-title":"Reasoning on knowledge graphs: Symbolic or neural?","author":"Costabello Luca","year":"2022","unstructured":"Luca Costabello , Sumit Pai , Nicholas McCarthy , and Adrianna Janik . Reasoning on knowledge graphs: Symbolic or neural? 2022 . Luca Costabello, Sumit Pai, Nicholas McCarthy, and Adrianna Janik. Reasoning on knowledge graphs: Symbolic or neural? 2022."}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615294","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3615294","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:54Z","timestamp":1750178214000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":51,"alternative-id":["10.1145\/3583780.3615294","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3615294","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}