Knowledge Graph Completion Method Combined With Adaptive Enhanced Semantic Information
Translation models tend to ignore the rich semantic information in triads in the process of knowledge graph complementation. To remedy this shortcoming, this paper constructs a knowledge graph complementation method that incorporates adaptively enhanced semantic information. The hidden semantic information inherent in the triad is obtained by fine-tuning the BERT model, and the attention feature embedding method is used to calculate the semantic attention scores between relations and entities in positive and negative triads and incorporate them into the structural information to form a soft constraint rule for semantic information. The rule is added to the original translation model to realize the adaptive enhancement of semantic information. In addition, the method takes into account the effect of high-dimensional vectors on the effect, and uses the BERT-whitening method to reduce the dimensionality and generate a more efficient semantic vector representation. After experimental comparison, the proposed method performs better on both FB15K and WIN18 datasets, with a numerical improvement of about 2.6% compared with the original translation model, which verifies the reasonableness and effectiveness of the method.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Graph CompletionTranslationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Query-Enhanced Adaptive Semantic Path Reasoning for Inductive Knowledge Graph Completion
Conventional Knowledge graph completion (KGC) methods aim to infer missing information in incomplete Knowledge Graphs (KGs) by leveraging existing information, which struggle to perform effectively in scenarios involving…
Inductive knowledge graph completionKnowledge Graph CompletionKnowledge GraphsContext-Enhanced Entity and Relation Embedding for Knowledge Graph Completion
Most researches for knowledge graph completion learn representations of entities and relations to predict missing links in incomplete knowledge graphs. However, these methods fail to take full advantage of both the conte…
Knowledge Graph CompletionKnowledge GraphsRelationEnhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning
Knowledge graph completion (KGC) aims to infer new knowledge and make predictions from knowledge graphs. Recently, large language models (LLMs) have exhibited remarkable reasoning capabilities. LLM-enhanced KGC methods p…
Knowledge Graph CompletionContrastive LearningKnowledge GraphsLink PredictionKnowledge Enhanced Graph Neural Networks for Graph Completion
Graph data is omnipresent and has a wide variety of applications, such as in natural science, social networks, or the semantic web. However, while being rich in information, graphs are often noisy and incomplete. As a re…
Graph AttentionGraph Neural NetworkLink PredictionNode ClassificationBioGraphFusion: Graph Knowledge Embedding for Biological Completion and Reasoning
Motivation: Biomedical knowledge graphs (KGs) are crucial for drug discovery and disease understanding, yet their completion and reasoning are challenging. Knowledge Embedding (KE) methods capture global semantics but st…
Knowledge GraphsDrug Discovery