A Re-evaluation of Knowledge Graph Completion Methods
원문 초록
Knowledge Graph Completion (KGC) aims at automatically predicting missing links for large-scale knowledge graphs. A vast number of state-of-the-art KGC techniques have got published at top conferences in several research fields, including data mining, machine learning, and natural language processing. However, we notice that several recent papers report very high performance, which largely outperforms previous state-of-the-art methods. In this paper, we find that this can be attributed to the inappropriate evaluation protocol used by them and propose a simple evaluation protocol to address this problem. The proposed protocol is robust to handle bias in the model, which can substantially affect the final results. We conduct extensive experiments and report the performance of several existing methods using our protocol. The reproducible code has been made publicly available
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs
Knowledge Graph Completion with Mixed Geometry Tensor Factorization
Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing
Knowledge Graph Embedding via Graph Attenuated Attention Networks
A Survey of Link Prediction in N-ary Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.