Rethinking Knowledge Graph Evaluation Under the Open-World Assumption
Haotong Yang, Zhouchen Lin, Muhan Zhang
摘要
Most knowledge graphs (KGs) are incomplete, which motivates one important research topic on automatically complementing knowledge graphs. However, evaluation of knowledge graph completion (KGC) models often ignores the incompleteness -- facts in the test set are ranked against all unknown triplets which may contain a large number of missing facts not included in the KG yet. Treating all unknown triplets as false is called the closed-world assumption. This closed-world assumption might negatively affect the fairness and consistency of the evaluation metrics. In this paper, we study KGC evaluation under a more realistic setting, namely the open-world assumption, where unknown triplets are considered to include many missing facts not included in the training or test sets. For the currently most used metrics such as mean reciprocal rank (MRR) and Hits@K, we point out that their behavior may be unexpected under the open-world assumption. Specifically, with not many missing facts, their numbers show a logarithmic trend with respect to the true strength of the model, and thus, the metric increase could be insignificant in terms of reflecting the true model improvement. Further, considering the variance, we show that the degradation in the reported numbers may result in incorrect comparisons between different models, where stronger models may have lower metric numbers. We validate the phenomenon both theoretically and experimentally. Finally, we suggest possible causes and solutions for this problem. Our code and data are available at https://github.com/GraphPKU/Open-World-KG .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Neural Common Neighbor with Completion for Link PredictionXiyuan Wang, Haotong Yang, Muhan ZhangICLR 2024 · 被引用 89 次
- DuetGraph: Coarse-to-Fine Knowledge Graph Reasoning with Dual-Pathway Global-Local FusionJin Li, Zezhong Ding, Xike XieNeurIPS 2025 · 被引用 5 次
- Efficient and Scalable Neural-Symbolic Search for Complex Query Answering over Incomplete Knowledge GraphsWeizhi Fei, Zihao Wang, Hang Yin, Shukai Zhao 等KDD 2026
- MusKGC: A Flexible Multi-source Knowledge Enhancement Framework for Open-World Knowledge Graph CompletionXin Song, Haiyan Liu, Haiyang Wang, Ye Wang 等EMNLP 2025
它引用的顶会 Paper6
- Composition-based Multi-Relational Graph Convolutional NetworksShikhar Vashishth, Soumya Sanyal, Vikram Nitin, Partha P. TalukdarICLR 2020 · 被引用 1,105 次
- Query2box: Reasoning over Knowledge Graphs in Vector Space Using Box EmbeddingsHongyu Ren, Weihua Hu, Jure LeskovecICLR 2020 · 被引用 355 次
- Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge GraphsHongyu Ren, Jure LeskovecNeurIPS 2020 · 被引用 267 次
- BoxE: A Box Embedding Model for Knowledge Base CompletionRalph Abboud, Ismail Ilkan Ceylan, Thomas Lukasiewicz, Tommaso SalvatoriNeurIPS 2020 · 被引用 245 次
- Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental StudyFarahnaz Akrami, Mohammed Samiul Saeef, Qingheng Zhang, Wei Hu 等SIGMOD 2020 · 被引用 101 次
相关 Paper
- Re-thinking Knowledge Graph Completion Evaluation from an Information Retrieval PerspectiveYing Zhou, Xuanang Chen, Ben He, Zheng Ye 等SIGIR 2022 · 被引用 13 次
- Are Missing Links Predictable? An Inferential Benchmark for Knowledge Graph CompletionYixin Cao, Xiang Ji, Xin Lv, Juanzi Li 等ACL 2021
- Evaluating the Calibration of Knowledge Graph Embeddings for Trustworthy Link PredictionTara Safavi, Danai Koutra, Edgar MeijEMNLP 2020 · 被引用 1 次
- KGCRR: An Effective Metric-Driven Knowledge Graph Completion Framework by Designing a Novel Upper Bound Function with Adaptive Approximation to Reciprocal RankKuan Xu, Kuo Yang, Jian Liu, Xiangkui Lu 等AAAI 2025
- Revisiting the Evaluation Protocol of Knowledge Graph Completion Methods for Link PredictionSudhanshu Tiwari, Iti Bansal, Carlos R. RiveroWWW 2021 · 被引用 16 次
