Han Yu, Ziniu Liu, Hongkui Tu, Kai Chen, Aiping Li
{"title":"Generalizable inductive relation prediction with causal subgraph","authors":"Han Yu, Ziniu Liu, Hongkui Tu, Kai Chen, Aiping Li","doi":"10.1007/s11280-024-01264-5","DOIUrl":null,"url":null,"abstract":"<p>Inductive relation prediction is an important learning task for knowledge graph reasoning that aims to infer new facts from existing ones. Previous graph neural networks (GNNs) based methods have demonstrated great success in inductive relation prediction by capturing more subgraph information. However, they aggregate all reasoning paths which might introduces redundant information. Such redundant information changes with the context of entity and easily outside the training distribution making existing GNN-base methods suffer from poor generalization. In this work, we propose a novel causal knowledge graph reasoning (CKGR) framework for inductive relation prediction task with better generalization. We first take a causal view of inductive relation prediction and construct a structural causal model (SCM) that reveals the relationship between variables. With our assumption, CKGR extracts causal and shortcut subgraphs conditioned on query triplet. Then, we parameter the backdoor adjustment of causality theory by making intervention in representation space. In this way, CKGR can learn stable causal feature and alleviates the confounding effect of shortcut features that are spuriously correlated to relation prediction. Extensive experiments on various tasks with real-world and synthetic datasets demonstrate the effectiveness of CKGR.</p>","PeriodicalId":501180,"journal":{"name":"World Wide Web","volume":"8 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Wide Web","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11280-024-01264-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Inductive relation prediction is an important learning task for knowledge graph reasoning that aims to infer new facts from existing ones. Previous graph neural networks (GNNs) based methods have demonstrated great success in inductive relation prediction by capturing more subgraph information. However, they aggregate all reasoning paths which might introduces redundant information. Such redundant information changes with the context of entity and easily outside the training distribution making existing GNN-base methods suffer from poor generalization. In this work, we propose a novel causal knowledge graph reasoning (CKGR) framework for inductive relation prediction task with better generalization. We first take a causal view of inductive relation prediction and construct a structural causal model (SCM) that reveals the relationship between variables. With our assumption, CKGR extracts causal and shortcut subgraphs conditioned on query triplet. Then, we parameter the backdoor adjustment of causality theory by making intervention in representation space. In this way, CKGR can learn stable causal feature and alleviates the confounding effect of shortcut features that are spuriously correlated to relation prediction. Extensive experiments on various tasks with real-world and synthetic datasets demonstrate the effectiveness of CKGR.