HEHRGNN: A Unified Embedding Model for Knowledge Graphs with Hyperedges and Hyper-Relational Edges
Rajesh Rajagopalamenon, Unnikrishnan Cheramangalath

TL;DR
HEHRGNN is a novel unified GNN-based embedding model designed to effectively represent and predict links in complex knowledge graphs containing both hyperedges and hyper-relational edges, addressing a gap in modeling n-ary facts.
Contribution
The paper introduces HEHRGNN, a unified model that simultaneously captures hyperedges and hyper-relational edges in knowledge graphs, improving link prediction accuracy.
Findings
HEHRGNN outperforms baseline models on real-world datasets.
The model demonstrates strong inductive prediction capabilities.
It effectively handles complex n-ary relational structures.
Abstract
Knowledge Graph(KG) has gained traction as a machine-readable organization of real-world knowledge for analytics using artificial intelligence systems. Graph Neural Network(GNN), is proven to be an effective KG embedding technique that enables various downstream tasks like link prediction, node classification, and graph classification. The focus of research in both KG embedding and GNNs has been mostly oriented towards simple graphs with binary relations. However, real-world knowledge bases have a significant share of complex and n-ary facts that cannot be represented by binary edges. More specifically, real-world knowledge bases are often a mix of two types of n-ary facts - (i) that require hyperedges and (ii) that require hyper-relational edges. Though there are research efforts catering to these n-ary fact types, they are pursued independently for each type. We propose yperdge…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Bioinformatics and Genomic Networks · Graph Theory and Algorithms
