{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:25:55Z","timestamp":1755926755138,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583308","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:25Z","timestamp":1682551825000},"page":"2455-2466","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Can Persistent Homology provide an efficient alternative for Evaluation of Knowledge Graph Completion Methods?"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2739-0729","authenticated-orcid":false,"given":"Anson","family":"Bastos","sequence":"first","affiliation":[{"name":"IIT, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5054-9881","authenticated-orcid":false,"given":"Kuldeep","family":"Singh","sequence":"additional","affiliation":[{"name":"Cerence GmbH and Zerotha Research, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0697-5410","authenticated-orcid":false,"given":"Abhishek","family":"Nadgeri","sequence":"additional","affiliation":[{"name":"RWTH Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5426-785X","authenticated-orcid":false,"given":"Johannes","family":"Hoffart","sequence":"additional","affiliation":[{"name":"SAP, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7919-2206","authenticated-orcid":false,"given":"Manish","family":"Singh","sequence":"additional","affiliation":[{"name":"IIT Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6412-8386","authenticated-orcid":false,"given":"Toyotaro","family":"Suzumura","sequence":"additional","affiliation":[{"name":"The University of Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.3389\/frai.2021.668302"},{"key":"e_1_3_2_2_2_1","volume-title":"Bringing light into the dark: A large-scale evaluation of knowledge graph embedding models under a unified framework","author":"Ali Mehdi","year":"2021","unstructured":"Mehdi Ali, Max Berrendorf, Charles\u00a0Tapley Hoyt, Laurent Vermue, Mikhail Galkin, Sahand Sharifzadeh, Asja Fischer, Volker Tresp, and Jens Lehmann. 2021. Bringing light into the dark: A large-scale evaluation of knowledge graph embedding models under a unified framework. IEEE Transactions on Pattern Analysis and Machine Intelligence (2021)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1522"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412023"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482263"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/WIIAT50758.2020.00053"},{"key":"e_1_3_2_2_7_1","volume-title":"Freebase: A Shared Database of Structured General Human Knowledge. In AAAI.","author":"Bollacker D.","year":"2007","unstructured":"Kurt\u00a0D. Bollacker, Robert\u00a0P. Cook, and Patrick Tufts. 2007. Freebase: A Shared Database of Structured General Human Knowledge. In AAAI."},{"key":"e_1_3_2_2_8_1","unstructured":"Antoine Bordes Nicolas Usunier Alberto Garcia-Duran Jason Weston and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In NeurlPS. 1\u20139."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2900423.2900470"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"e_1_3_2_2_11_1","unstructured":"Karsten\u00a0M. Borgwardt Tobias Petri S.\u00a0V.\u00a0N. Vishwanathan and Hans-Peter Kriegel. 2007. An Efficient Sampling Scheme For Comparison of Large Graphs. In Mining and Learning with Graphs MLG."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775247"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning(Proceedings of Machine Learning Research), Vol.\u00a070","author":"Carri\u00e8re Mathieu","year":"2017","unstructured":"Mathieu Carri\u00e8re, Marco Cuturi, and Steve Oudot. 2017. Sliced Wasserstein Kernel for Persistence Diagrams. In Proceedings of the 34th International Conference on Machine Learning(Proceedings of Machine Learning Research), Vol.\u00a070. PMLR, 664\u2013673."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796607"},{"key":"e_1_3_2_2_16_1","volume-title":"Comparing Distance Metrics on Vectorized Persistence Summaries. In NeurIPS 2020 Workshop on Topological Data Analysis and Beyond.","author":"Fasy Brittany","year":"2020","unstructured":"Brittany Fasy, Yu Qin, Brian Summa, and Carola Wenk. 2020. Comparing Distance Metrics on Vectorized Persistence Summaries. In NeurIPS 2020 Workshop on Topological Data Analysis and Beyond."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577302"},{"key":"e_1_3_2_2_18_1","volume-title":"A survey on knowledge graph embeddings with literals: Which model links better literal-ly?Semantic WebPreprint","author":"Gesese Genet\u00a0Asefa","year":"2019","unstructured":"Genet\u00a0Asefa Gesese, Russa Biswas, Mehwish Alam, and Harald Sack. 2019. A survey on knowledge graph embeddings with literals: Which model links better literal-ly?Semantic WebPreprint (2019), 1\u201331."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.3389\/frai.2021.681108"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77385-4_9"},{"key":"e_1_3_2_2_21_1","volume-title":"Knowledge base completion: Baseline strikes back (again). arXiv preprint arXiv:2005.00804","author":"Jain Prachi","year":"2020","unstructured":"Prachi Jain, Sushant Rathi, Soumen Chakrabarti, 2020. Knowledge base completion: Baseline strikes back (again). arXiv preprint arXiv:2005.00804 (2020)."},{"key":"e_1_3_2_2_22_1","volume-title":"A survey on knowledge graphs: Representation, acquisition and applications. EEE Transactions on Neural Networks and Learning Systems","author":"Ji Shaoxiong","year":"2021","unstructured":"Shaoxiong Ji, Shirui Pan, Erik Cambria, Pekka Marttinen, and Philip\u00a0S Yu. 2021. A survey on knowledge graphs: Representation, acquisition and applications. EEE Transactions on Neural Networks and Learning Systems (2021)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-2609"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449859"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775167"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"e_1_3_2_2_28_1","volume-title":"Conference on Uncertainty in Artificial Intelligence. PMLR, 1059\u20131068","author":"Mohamed Aisha","year":"2020","unstructured":"Aisha Mohamed, Shameem Parambath, Zoi Kaoudi, and Ashraf Aboulnaga. 2020. Popularity agnostic evaluation of knowledge graph embeddings. In Conference on Uncertainty in Artificial Intelligence. PMLR, 1059\u20131068."},{"key":"e_1_3_2_2_29_1","volume-title":"International conference on machine learning. PMLR, 7045\u20137054","author":"Moor Michael","year":"2020","unstructured":"Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt. 2020. Topological autoencoders. In International conference on machine learning. PMLR, 7045\u20137054."},{"key":"e_1_3_2_2_30_1","volume-title":"Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections. Advances in Neural Information Processing Systems 34","author":"Nadjahi Kimia","year":"2021","unstructured":"Kimia Nadjahi, Alain Durmus, Pierre\u00a0E Jacob, Roland Badeau, and Umut Simsekli. 2021. Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections. Advances in Neural Information Processing Systems 34 (2021)."},{"key":"e_1_3_2_2_31_1","volume-title":"Toward Understanding The Effect Of Loss function On Then Performance Of Knowledge Graph Embedding. arXiv preprint arXiv:1909.00519","author":"Nayyeri Mojtaba","year":"2019","unstructured":"Mojtaba Nayyeri, Chengjin Xu, Yadollah Yaghoobzadeh, Hamed\u00a0Shariat Yazdi, and Jens Lehmann. 2019. Toward Understanding The Effect Of Loss function On Then Performance Of Knowledge Graph Embedding. arXiv preprint arXiv:1909.00519 (2019)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Tu\u00a0Dinh Nguyen Dat\u00a0Quoc Nguyen Dinh Phung 2018. A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network. In NAACL. 327\u2013333.","DOI":"10.18653\/v1\/N18-2053"},{"key":"e_1_3_2_2_33_1","volume-title":"Then Shrink. arXiv preprint arXiv:2204.05149","author":"Patterson David","year":"2022","unstructured":"David Patterson, Joseph Gonzalez, Urs H\u00f6lzle, Quoc Le, Chen Liang, Lluis-Miquel Munguia, Daniel Rothchild, David So, Maud Texier, and Jeff Dean. 2022. The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrink. arXiv preprint arXiv:2204.05149 (2022)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Xutan Peng Guanyi Chen Chenghua Lin and Mark Stevenson. 2021. Highly Efficient Knowledge Graph Embedding Learning with Orthogonal Procrustes Analysis. In NAACL. 2364\u20132375.","DOI":"10.18653\/v1\/2021.naacl-main.187"},{"key":"e_1_3_2_2_35_1","unstructured":"Pouya Pezeshkpour Yifan Tian and Sameer Singh. 2020. Revisiting evaluation of knowledge base completion models. In Automated Knowledge Base Construction."},{"key":"e_1_3_2_2_36_1","volume-title":"Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology. In International Conference on Learning Representations.","author":"Rieck Bastian","year":"2018","unstructured":"Bastian Rieck, Matteo Togninalli, Christian Bock, Michael Moor, Max Horn, Thomas Gumbsch, and Karsten Borgwardt. 2018. Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_37_1","volume-title":"Behavioral Testing of Knowledge Graph Embedding Models for Link Prediction. In 3rd Conference on Automated Knowledge Base Construction.","author":"Rim Wiem\u00a0Ben","year":"2021","unstructured":"Wiem\u00a0Ben Rim, Carolin Lawrence, Kiril Gashteovski, Mathias Niepert, and Naoaki Okazaki. 2021. Behavioral Testing of Knowledge Graph Embedding Models for Link Prediction. In 3rd Conference on Automated Knowledge Base Construction."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.669"},{"key":"e_1_3_2_2_39_1","first-page":"169","article-title":"The Box-Cox transformation technique: a review","volume":"41","author":"Sakia M","year":"1992","unstructured":"Remi\u00a0M Sakia. 1992. The Box-Cox transformation technique: a review. Journal of the Royal Statistical Society: Series D (The Statistician) 41, 2 (1992), 169\u2013178.","journal-title":"Journal of the Royal Statistical Society: Series D (The Statistician)"},{"key":"e_1_3_2_2_40_1","volume-title":"Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 122\u2013131","author":"Sharma Aditya","year":"2018","unstructured":"Aditya Sharma, Partha Talukdar, 2018. Towards understanding the geometry of knowledge graph embeddings. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 122\u2013131."},{"key":"e_1_3_2_2_41_1","volume-title":"Build Question Answering Systems Together. In The Web Conference (WWW","author":"Singh Kuldeep","year":"2018","unstructured":"Kuldeep Singh, Arun\u00a0Sethupat Radhakrishna, Andreas Both, Saeedeh Shekarpour, Ioanna Lytra, Ricardo Usbeck, Akhilesh Vyas, Akmal Khikmatullaev, Dharmen Punjani, Christoph Lange, Maria\u00a0Esther Vidal, Jens Lehmann, and S\u00f6ren Auer. 2018. Why Reinvent the Wheel\u2013Let\u2019s Build Question Answering Systems Together. In The Web Conference (WWW 2018)."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/1412408"},{"key":"e_1_3_2_2_43_1","unstructured":"Marina Speranskaya Martin Schmitt and Benjamin Roth. 2020. Ranking vs. Classifying: Measuring Knowledge Base Completion Quality. In Automated Knowledge Base Construction."},{"key":"e_1_3_2_2_44_1","volume-title":"International Conference on Learning Representations.","author":"Sun Zhiqing","year":"2018","unstructured":"Zhiqing Sun, Zhi-Hong Deng, Jian-Yun Nie, and Jian Tang. 2018. RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.489"},{"key":"e_1_3_2_2_46_1","volume-title":"Probability Calibration for Knowledge Graph Embedding Models. In International Conference on Learning Representations.","author":"Tabacof Pedro","year":"2019","unstructured":"Pedro Tabacof and Luca Costabello. 2019. Probability Calibration for Knowledge Graph Embedding Models. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449856"},{"key":"e_1_3_2_2_48_1","volume-title":"International Conference on Machine Learning. PMLR","author":"Trouillon Th\u00e9o","year":"2016","unstructured":"Th\u00e9o Trouillon, Johannes Welbl, Sebastian Riedel, \u00c9ric Gaussier, and Guillaume Bouchard. 2016. Complex embeddings for simple link prediction. In International Conference on Machine Learning. PMLR, 2071\u20132080."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330848"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","unstructured":"Renata Turke\u0161 Guido Mont\u00fafar and Nina Otter. 2022. On the effectiveness of persistent homology. https:\/\/doi.org\/10.48550\/ARXIV.2206.10551","DOI":"10.48550\/ARXIV.2206.10551"},{"key":"e_1_3_2_2_51_1","volume-title":"Optimal transport. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 338","author":"Villani C.","year":"2009","unstructured":"C. Villani. 2009. Optimal transport. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 338 (2009)."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482224"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449898"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511927"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"e_1_3_2_2_56_1","volume-title":"International Conference on Machine Learning. PMLR, 10727\u201310737","author":"Wang Xin","year":"2021","unstructured":"Xin Wang, Shuyi Fan, Kun Kuang, and Wenwu Zhu. 2021. Explainable automated graph representation learning with hyperparameter importance. In International Conference on Machine Learning. PMLR, 10727\u201310737."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00360"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-031017-100045"},{"key":"e_1_3_2_2_60_1","first-page":"795","article-title":"Sustainable ai: Environmental implications, challenges and opportunities","volume":"4","author":"Wu Carole-Jean","year":"2022","unstructured":"Carole-Jean Wu, Ramya Raghavendra, Udit Gupta, Bilge Acun, Newsha Ardalani, Kiwan Maeng, Gloria Chang, Fiona Aga, Jinshi Huang, Charles Bai, 2022. Sustainable ai: Environmental implications, challenges and opportunities. Proceedings of Machine Learning and Systems 4 (2022), 795\u2013813.","journal-title":"Proceedings of Machine Learning and Systems"},{"key":"e_1_3_2_2_61_1","volume-title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases. In 3rd International Conference on Learning Representations, ICLR.","author":"Yang Bishan","year":"2015","unstructured":"Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. 2015. Embedding Entities and Relations for Learning and Inference in Knowledge Bases. In 3rd International Conference on Learning Representations, ICLR."},{"key":"e_1_3_2_2_62_1","first-page":"16","article-title":"Pykg2vec: A Python Library for Knowledge Graph Embedding.","volume":"22","author":"Yu Shih-Yuan","year":"2021","unstructured":"Shih-Yuan Yu, Sujit\u00a0Rokka Chhetri, Arquimedes Canedo, Palash Goyal, and Mohammad\u00a0Abdullah Al\u00a0Faruque. 2021. Pykg2vec: A Python Library for Knowledge Graph Embedding.J. Mach. Learn. Res. 22 (2021), 16\u20131.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482367"},{"key":"e_1_3_2_2_64_1","volume-title":"KGTuner: Efficient Hyper-parameter Search for Knowledge Graph Learning. CoRR abs\/2205.02460","author":"Zhang Yongqi","year":"2022","unstructured":"Yongqi Zhang, Zhanke Zhou, Quanming Yao, and Yong Li. 2022. KGTuner: Efficient Hyper-parameter Search for Knowledge Graph Learning. CoRR abs\/2205.02460 (2022)."},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115476.3115792"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Austin TX USA","acronym":"WWW '23"},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:22Z","timestamp":1750178242000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":64,"alternative-id":["10.1145\/3543507.3583308","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583308","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}