Rethinking Knowledge Graph Evaluation Under the Open-World Assumption
원문 초록
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 .
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs
Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing
Rethinking Regularization Methods for Knowledge Graph Completion
Enhancing Knowledge Graph Completion with GNN Distillation and Probabilistic Interaction Modeling
MetaP: Meta Pattern Learning for One-Shot Knowledge Graph Completion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.