Relation-dependent Contrastive Learning with Cluster Sampling for Inductive Relation Prediction

11/22/2022
by   Jianfeng Wu, et al.
0

Relation prediction is a task designed for knowledge graph completion which aims to predict missing relationships between entities. Recent subgraph-based models for inductive relation prediction have received increasing attention, which can predict relation for unseen entities based on the extracted subgraph surrounding the candidate triplet. However, they are not completely inductive because of their disability of predicting unseen relations. Moreover, they fail to pay sufficient attention to the role of relation as they only depend on the model to learn parameterized relation embedding, which leads to inaccurate prediction on long-tail relations. In this paper, we introduce Relation-dependent Contrastive Learning (ReCoLe) for inductive relation prediction, which adapts contrastive learning with a novel sampling method based on clustering algorithm to enhance the role of relation and improve the generalization ability to unseen relations. Instead of directly learning embedding for relations, ReCoLe allocates a pre-trained GNN-based encoder to each relation to strengthen the influence of relation. The GNN-based encoder is optimized by contrastive learning, which ensures satisfactory performance on long-tail relations. In addition, the cluster sampling method equips ReCoLe with the ability to handle both unseen relations and entities. Experimental results suggest that ReCoLe outperforms state-of-the-art methods on commonly used inductive datasets.

READ FULL TEXT
research
12/16/2020

Communicative Message Passing for Inductive Relation Reasoning

Relation prediction for knowledge graphs aims at predicting missing rela...
research
09/03/2022

Disconnected Emerging Knowledge Graph Oriented Inductive Link Prediction

Inductive link prediction (ILP) is to predict links for unseen entities ...
research
10/08/2022

Relational Message Passing for Fully Inductive Knowledge Graph Completion

In knowledge graph completion (KGC), predicting triples involving emergi...
research
09/19/2020

Inductive Learning on Commonsense Knowledge Graph Completion

Commonsense knowledge graph (CKG) is a special type of knowledge graph (...
research
03/12/2021

Inductive Relation Prediction by BERT

Relation prediction in knowledge graphs is dominated by embedding based ...
research
04/30/2020

Semantic Triple Encoder for Fast Open-Set Link Prediction

We improve both the open-set generalization and efficiency of link predi...
research
01/22/2021

A shallow neural model for relation prediction

Knowledge graph completion refers to predicting missing triples. Most ap...

Please sign up or login with your details

Forgot password? Click here to reset