Knowledge Graph Embedding via Graph Attenuated Attention Networks
Knowledge graphs contain a wealth of real-world knowledge that can provide strong support for artificial intelligence applications. Much progress has been made in knowledge graph completion, state-of-the-art models are based on graph convolutional neural networks. These models automatically extract features, in combination with the features of the graph model, to generate feature embeddings with a strong expressive ability. However, these methods assign the same weights on the relation path in the knowledge graph and ignore the rich information presented in neighbor nodes, which result in incomplete mining of triple features. To this end, we propose Graph Attenuated Attention networks(GAATs), a novel representation method, which integrates an attenuated attention mechanism to assign different weight in different relation path and acquire the information from the neighborhoods. As a result, entities and relations can be learned in any neighbors. Our empirical research provides insight into the effectiveness of the attenuated attention-based models, and we show significant improvement compared to the state-of-the-art methods on two benchmark datasets WN18RR and FB15k-237.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph EmbeddingKnowledge Base CompletionKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge GraphsLink PredictionRelationRelational ReasoningWorld KnowledgeSimilar Papers 제목 키워드 기반
H2KGAT: Hierarchical Hyperbolic Knowledge Graph Attention Network
Knowledge Graphs encode rich relationships among large number of entities. Embedding entities and relations in low-dimensional space has shed light on representing knowledge graphs and reasoning over them, e.g., predicti…
Graph AttentionGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graphs+1Association Rules Enhanced Knowledge Graph Attention Network
Most existing knowledge graphs suffer from incompleteness. Embedding knowledge graphs into continuous vector spaces has recently attracted increasing interest in knowledge base completion. However, in most existing embed…
Graph AttentionGraph EmbeddingKnowledge Base CompletionKnowledge Graph Completion+4InGram: Inductive Knowledge Graph Embedding via Relation Graphs
Inductive knowledge graph completion has been considered as the task of predicting missing triplets between new entities that are not observed during training. While most inductive knowledge graph completion methods assu…
Entity EmbeddingsGraph EmbeddingInductive knowledge graph completionInductive Learning+5Time-aware Relational Graph Attention Network for Temporal Knowledge Graph Embeddings
Embedding-based representation learning approaches for knowledge graphs (KGs) have been mostly designed for static data. However, many KGs involve temporal data, which creates the need for new representation learning app…
Entity AlignmentGraph AttentionKnowledge Graph EmbeddingsKnowledge Graphs+1Data Poisoning Attack against Knowledge Graph Embedding
Knowledge graph embedding (KGE) is a technique for learning continuous embeddings for entities and relations in the knowledge graph.Due to its benefit to a variety of downstream tasks such as knowledge graph completion, …
Data PoisoningGraph EmbeddingKnowledge Graph CompletionKnowledge Graph Embedding+1