HiHo: A Hierarchical and Homogenous Subgraph Learning Model for Knowledge Graph Relation Prediction

Tracking #: 3654-4868

This paper is currently under review
Jiangtao Ma
Yuke Ma
Fan Zhang1
Yanjun Wang
Xiangyang Luo
Chenliang Li
Yaqiong Qiao

Responsible editor: 
Guest Editors KG Gen 2023

Submission type: 
Full Paper
Relation prediction in Knowledge Graphs (KGs) aims to anticipate the connections between entities. While both transductive and inductive models are incorporated for context comprehension, we need to focus on two primary issues. First, these models only collate relations at each layer of the subgraph, overlooking the potential sequential relationship between different layers. Second, these methods overlook the homogeneity of subgraphs, thus impeding their ability to effectively learn the importance of relationships within the subgraphs. To address this challenge, we propose a hierarchical and homogenous subgraph learning model for knowledge graph relation prediction (HiHo). Specifically, we adopt a subgraph-to-sequence mechanism (S2S) to learn the potential semantic associations between layers in the subgraph of a single entity, and thus model the hierarchy of the subgraph. Then, we implement a common preference inference mechanism (CPI) that assigns higher weights to co-occurrence relations while learning the importance of each relation in the subgraphs of two entities, and thus model the homogeneity of the subgraph. In our study, we sequentially employ induction on each layer of subgraphs pertaining to the two entities for relation prediction. To assess the efficacy of our method, we perform experiments on five publicly available datasets. The results of our experiments demonstrate that our method surpasses the current state-of-the-art baselines in both transductive and inductive settings.
Full PDF Version: 
Under Review