LineaRE: Simple but Powerful Knowledge Graph Embedding for Link
Prediction
- URL: http://arxiv.org/abs/2004.10037v2
- Date: Thu, 18 Feb 2021 05:55:39 GMT
- Title: LineaRE: Simple but Powerful Knowledge Graph Embedding for Link
Prediction
- Authors: Yanhui Peng and Jing Zhang
- Abstract summary: We propose a novel embedding model, namely LineaRE, which is capable of modeling four connectivity patterns and four mapping properties.
Experimental results on multiple widely used real-world datasets show that the proposed LineaRE model significantly outperforms existing state-of-the-art models for link prediction tasks.
- Score: 7.0294164380111015
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The task of link prediction for knowledge graphs is to predict missing
relationships between entities. Knowledge graph embedding, which aims to
represent entities and relations of a knowledge graph as low dimensional
vectors in a continuous vector space, has achieved promising predictive
performance. If an embedding model can cover different types of connectivity
patterns and mapping properties of relations as many as possible, it will
potentially bring more benefits for link prediction tasks. In this paper, we
propose a novel embedding model, namely LineaRE, which is capable of modeling
four connectivity patterns (i.e., symmetry, antisymmetry, inversion, and
composition) and four mapping properties (i.e., one-to-one, one-to-many,
many-to-one, and many-to-many) of relations. Specifically, we regard knowledge
graph embedding as a simple linear regression task, where a relation is modeled
as a linear function of two low-dimensional vector-presented entities with two
weight vectors and a bias vector. Since the vectors are defined in a real
number space and the scoring function of the model is linear, our model is
simple and scalable to large knowledge graphs. Experimental results on multiple
widely used real-world datasets show that the proposed LineaRE model
significantly outperforms existing state-of-the-art models for link prediction
tasks.
Related papers
- Connector 0.5: A unified framework for graph representation learning [5.398580049917152]
We introduce a novel graph representation framework covering various graph embedding models, ranging from shallow to state-of-the-art models.
We plan to build an efficient open-source framework that can provide deep graph embedding models to represent structural relations in graphs.
arXiv Detail & Related papers (2023-04-25T23:28:38Z) - You Only Transfer What You Share: Intersection-Induced Graph Transfer
Learning for Link Prediction [79.15394378571132]
We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph.
The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge.
We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
arXiv Detail & Related papers (2023-02-27T22:56:06Z) - Link Prediction with Attention Applied on Multiple Knowledge Graph
Embedding Models [7.620967781722715]
Knowledge graph embeddings map nodes into a vector space to predict new links, scoring them according to geometric criteria.
No single model can learn all patterns equally well.
In this paper, we combine the query representations from several models in a unified one to incorporate patterns that are independently captured by each model.
arXiv Detail & Related papers (2023-02-13T10:07:26Z) - GrannGAN: Graph annotation generative adversarial networks [72.66289932625742]
We consider the problem of modelling high-dimensional distributions and generating new examples of data with complex relational feature structure coherent with a graph skeleton.
The model we propose tackles the problem of generating the data features constrained by the specific graph structure of each data point by splitting the task into two phases.
In the first it models the distribution of features associated with the nodes of the given graph, in the second it complements the edge features conditionally on the node features.
arXiv Detail & Related papers (2022-12-01T11:49:07Z) - STaR: Knowledge Graph Embedding by Scaling, Translation and Rotation [20.297699026433065]
Bilinear method is mainstream in Knowledge Graph Embedding (KGE), aiming to learn low-dimensional representations for entities and relations.
Previous works have mainly discovered 6 important patterns like non-commutativity.
We propose a corresponding bilinear model Scaling Translation and Rotation (STaR) consisting of the above two parts.
arXiv Detail & Related papers (2022-02-15T02:06:22Z) - Learning Representations of Entities and Relations [0.0]
This thesis focuses on improving knowledge graph representation with the aim of tackling the link prediction task.
The first contribution is HypER, a convolutional model which simplifies and improves upon the link prediction performance.
The second contribution is TuckER, a relatively straightforward linear model, which, at the time of its introduction, obtained state-of-the-art link prediction performance.
The third contribution is MuRP, first multi-relational graph representation model embedded in hyperbolic space.
arXiv Detail & Related papers (2022-01-31T09:24:43Z) - QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion [4.837804582368272]
We propose a novel model, QuatDE, with a dynamic mapping strategy to explicitly capture a variety of relational patterns.
Experiment results show QuatDE achieves state-of-the-art performance on three well-established knowledge graph completion benchmarks.
arXiv Detail & Related papers (2021-05-19T09:10:39Z) - TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning [87.38675639186405]
We propose a novel graph neural network approach, called TCL, which deals with the dynamically-evolving graph in a continuous-time fashion.
To the best of our knowledge, this is the first attempt to apply contrastive learning to representation learning on dynamic graphs.
arXiv Detail & Related papers (2021-05-17T15:33:25Z) - Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph
Link Prediction [69.1473775184952]
We introduce a realistic problem of few-shot out-of-graph link prediction.
We tackle this problem with a novel transductive meta-learning framework.
We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
arXiv Detail & Related papers (2020-06-11T17:42:46Z) - Auto-decoding Graphs [91.3755431537592]
The generative model is an auto-decoder that learns to synthesize graphs from latent codes.
Graphs are synthesized using self-attention modules that are trained to identify likely connectivity patterns.
arXiv Detail & Related papers (2020-06-04T14:23:01Z) - Tensor Graph Convolutional Networks for Multi-relational and Robust
Learning [74.05478502080658]
This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor.
The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
arXiv Detail & Related papers (2020-03-15T02:33:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.