Learning Representations for Hyper-Relational Knowledge Graphs

N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Knowledge graphs (KGs) have gained prominence for their ability to learn representations for uni-relational facts. Recently, research has focused on modeling hyper-relational facts, which move beyond the restriction of uni-relational facts and allow us to represent more complex and real-world information. However, existing approaches for learning representations on hyper-relational KGs majorly focus on enhancing the communication from qualifiers to base triples while overlooking the flow of information from base triple to qualifiers. This can lead to suboptimal qualifier representations, especially when a large amount of qualifiers are presented. It motivates us to design a framework that utilizes multiple aggregators to learn representations for hyper-relational facts: one from the perspective of the base triple and the other one from the perspective of the qualifiers. Experiments demonstrate the effectiveness of our framework for hyper-relational knowledge graph completion across multiple datasets. Furthermore, we conduct an ablation study that validates the importance of the various components in our framework.

Author supplied keywords

Cite

CITATION STYLE

APA

Shomer, H., Jin, W., Li, J., Ma, Y., & Liu, H. (2023). Learning Representations for Hyper-Relational Knowledge Graphs. In Proceedings of the 2023 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2023 (pp. 253–257). Association for Computing Machinery, Inc. https://doi.org/10.1145/3625007.3627591

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free