Towards Loosely-Coupling Knowledge Graph Embeddings and Ontology-based Reasoning
원문 초록
Knowledge graph completion (a.k.a.~link prediction), i.e.,~the task of inferring missing information from knowledge graphs, is a widely used task in many applications, such as product recommendation and question answering. The state-of-the-art approaches of knowledge graph embeddings and/or rule mining and reasoning are data-driven and, thus, solely based on the information the input knowledge graph contains. This leads to unsatisfactory prediction results which make such solutions inapplicable to crucial domains such as healthcare. To further enhance the accuracy of knowledge graph completion we propose to loosely-couple the data-driven power of knowledge graph embeddings with domain-specific reasoning stemming from experts or entailment regimes (e.g., OWL2). In this way, we not only enhance the prediction accuracy with domain knowledge that may not be included in the input knowledge graph but also allow users to plugin their own knowledge graph embedding and reasoning method. Our initial results show that we enhance the MRR accuracy of vanilla knowledge graph embeddings by up to 3x and outperform hybrid solutions that combine knowledge graph embeddings with rule mining and reasoning up to 3.5x MRR.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Knowledge Graph Embedding via Graph Attenuated Attention Networks
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
Multi-dataset and Transfer Learning Using Gene Expression Knowledge Graphs
SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs
Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings
Injecting Knowledge Graphs into Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.