Message Passing for Hyper-Relational Knowledge Graphs
Hyper-relational knowledge graphs (KGs) (e.g., Wikidata) enable associating additional key-value pairs along with the main triple to disambiguate, or restrict the validity of a fact. In this work, we propose a message passing based graph encoder - StarE capable of modeling such hyper-relational KGs. Unlike existing approaches, StarE can encode an arbitrary number of additional information (qualifiers) along with the main triple while keeping the semantic roles of qualifiers and triples intact. We also demonstrate that existing benchmarks for evaluating link prediction (LP) performance on hyper-relational KGs suffer from fundamental flaws and thus develop a new Wikidata-based dataset - WD50K. Our experiments demonstrate that StarE based LP model outperforms existing approaches across multiple benchmarks. We also confirm that leveraging qualifiers is vital for link prediction with gains up to 25 MRR points compared to triple-based representations.
Code (1)
Tasks
Knowledge GraphsLink PredictionSimilar Papers 제목 키워드 기반
A Relation-Interactive Approach for Message Passing in Hyper-relational Knowledge Graphs
Hyper-relational knowledge graphs (KGs) contain additional key-value pairs, providing more information about the relations. In many scenarios, the same relation can have distinct key-value pairs, making the original trip…
Knowledge GraphsLink PredictionPredictionRelationNeural Message Passing for Multi-Relational Ordered and Recursive Hypergraphs
Message passing neural network (MPNN) has recently emerged as a successful framework by achieving state-of-the-art performances on many graph-based learning tasks. MPNN has also recently been extended to multi-relational…
HyperFormer: Enhancing Entity and Relation Interaction for Hyper-Relational Knowledge Graph Completion
Hyper-relational knowledge graphs (HKGs) extend standard knowledge graphs by associating attribute-value qualifiers to triples, which effectively represent additional fine-grained information about its associated triple.…
AttributeKnowledge Graph CompletionKnowledge GraphsMixture-of-Experts+1Meta-node: A Concise Approach to Effectively Learn Complex Relationships in Heterogeneous Graphs
Existing message passing neural networks for heterogeneous graphs rely on the concepts of meta-paths or meta-graphs due to the intrinsic nature of heterogeneous graphs. However, the meta-paths and meta-graphs need to be …
Contrastive LearningGraph LearningNode ClusteringGenerative Representation Learning on Hyper-relational Knowledge Graphs via Masked Discrete Diffusion
Hyper-relational knowledge graphs (HKGs) effectively represent complex facts. While inferring new knowledge in HKGs is a critical problem, current methods cast it as a simple link prediction, assuming that nearly all ent…
Representation LearningKnowledge GraphsLink Prediction