Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This survey establishes a comprehensive two-dimensional taxonomy for n-ary knowledge representation, addressing the limitations of traditional triple-based graphs by integrating hypergraph structures with role-aware semantics. It systematically categorizes existing methods based on their underlying methodologies and their ability to model entity positions within complex relations, providing essential benchmarks for future research in semantic modeling.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods

arXiv3 min read

arXiv:2506.05626v3 Announce Type: replace Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are structured representations that integrate heterogeneous data sources into structured representations. However, KGs typically reduce complex n-ary relations to simple triples, thereby losing higher-order relational details. In contrast, hypergraphs naturally represent n-ary relations with hyperedges that directly connect multiple entities. Recent advances have led to many hypergraph representation learning methods; however, they often overlook entity roles in hyperedges, limiting fine-grained semantic modelling. To address these issues, Knowledge Hypergraphs (KHGs) and Hyper-relational Knowledge Graphs (HKGs) combine the advantages of KGs and hypergraphs to better capture complex relational structures and role-specific semantics of real-world knowledge. This survey provides a structured review of representation learning methods for n-ary relational data, with a primary focus on static KHGs and HKGs. We propose a two-dimensional taxonomy: the first dimension categorises models based on their methodology, including translation-based models, tensor factorisation-based models, deep neural network-based models, logic rule-based models, and hyperedge expansion-based models. The second dimension classifies models according to their awareness of entity roles and positions in n-ary relations, dividing them into position-aware, role-aware, and aware-less approaches. Finally, we summarise benchmark datasets, training settings, negative sampling strategies, and benchmark-style performance comparisons, and outline open challenges to inspire future research.

Abstract:Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are structured representations that integrate heterogeneous data sources into structured representations. However, KGs typically reduce complex n-ary relations to simple triples, thereby losing higher-order relational details. In contrast, hypergraphs naturally represent n-ary relations with hyperedges that directly connect multiple entities. Recent advances have led to many hypergraph representation learning methods; however, they often overlook entity roles in hyperedges, limiting fine-grained semantic modelling. To address these issues, Knowledge Hypergraphs (KHGs) and Hyper-relational Knowledge Graphs (HKGs) combine the advantages of KGs and hypergraphs to better capture complex relational structures and role-specific semantics of real-world knowledge. This survey provides a structured review of representation learning methods for n-ary relational data, with a primary focus on static KHGs and HKGs. We propose a two-dimensional taxonomy: the first dimension categorises models based on their methodology, including translation-based models, tensor factorisation-based models, deep neural network-based models, logic rule-based models, and hyperedge expansion-based models. The second dimension classifies models according to their awareness of entity roles and positions in n-ary relations, dividing them into position-aware, role-aware, and aware-less approaches. Finally, we summarise benchmark datasets, training settings, negative sampling strategies, and benchmark-style performance comparisons, and outline open challenges to inspire future research.

20 pages. Accepted for publication in IEEE Transactions on Knowledge and Data Engineering (TKDE). Author's accepted manuscript

Machine Learning (cs.LG)

arXiv:2506.05626 [cs.LG]

(or arXiv:2506.05626v3 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2506.05626 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 320 words

Related coverage