WWW 2023

Knowledge Graph Completion with Counterfactual Augmentation

Heng Chang, Jie Cai, Jia Li

Main figure for Knowledge Graph Completion with Counterfactual Augmentation

Abstract

Graph Neural Networks (GNNs) have demonstrated great success in Knowledge Graph Completion (KGC) by modeling how entities and relations interact in recent years. However, most of them are designed to learn from the observed graph structure, which appears to have imbalanced relation distribution during the training stage. Motivated by the causal relationship among the entities on a knowledge graph, we explore this defect through a counterfactual question: ``would the relation still exist if the neighborhood of entities became different from observation?''. With a carefully designed instantiation of a causal model on the knowledge graph, we generate the counterfactual relations to answer the question by regarding the representations of entity pair given relation as context, structural information of relation-aware neighborhood as treatment, and validity of the composed triplet as the outcome. Furthermore, we incorporate the created counterfactual relations with the GNN-based framework on KGs to augment their learning of entity pair representations from both the observed and counterfactual relations. Experiments on benchmarks show that our proposed method outperforms existing methods on the task of KGC, achieving new state-of-the-art results. Moreover, we demonstrate that the proposed counterfactual relations-based augmentation also enhances the interpretability of the GNN-based framework through the path interpretations of predictions.

Proposed method: KGCF

Benchmark Results

Tested on 2 datasets

Tables show presented results in global context (best 3 papers + GCN + MLP).

Knowledge Graphs

#ModelMRR ↑Paper
1
FedSage
0.8426 ±0.0026
2
FED-PUB
0.8348 ±0.0025
3
FedAvg
0.8252 ±0.0023
7
GCN
0.8171 ±0.0030
30
KGCF
0.5530
This paper
32
NBFnet
0.5510
This paper
65
LTE + ConvE
0.4720
This paper
70
CompGCN + ConvE
0.4690
This paper
86
LTE + DistMult
0.4370
This paper
90
CompGCN + DistMult
0.4300
This paper
91
RGCN + ConvE
0.4280
This paper
95
RGCN + DistMult
0.3930
This paper
97
Path Ranking
0.3240
This paper
104
LTE + TransE
0.2110
This paper
105
CompGCN + TransE
0.2060
This paper
106
RGCN + TransE
0.1980
This paper
#ModelMRR ↑Paper
1
sum, Msg_r^3, f(t)=0
0.8500
2
sum, Msg_r^3, f(t)=t
0.8440
3
PNA, Msg_r^1, f(t)=0
0.8010
10
KGCF
0.4210
This paper
12
NBFnet
0.4150
This paper
39
LTE + ConvE
0.3520
This paper
41
CompGCN + ConvE
0.3510
This paper
54
CompGCN + DistMult
0.3420
This paper
59
RGCN + ConvE
0.3360
This paper
62
CompGCN + TransE
0.3350
This paper
63
LTE + DistMult
0.3350
This paper
64
LTE + TransE
0.3340
This paper
66
RGCN + DistMult
0.3320
This paper
74
RGCN + TransE
0.3240
This paper
95
Path Ranking
0.1740
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers)