The University of Southampton
University of Southampton Institutional Repository

NestE: modeling nested relational structures for knowledge graph reasoning

NestE: modeling nested relational structures for knowledge graph reasoning
NestE: modeling nested relational structures for knowledge graph reasoning
Reasoning with knowledge graphs (KGs) has primarily focused on triple-shaped facts. Recent advancements have been explored to enhance the semantics of these facts by incorporating more potent representations, such as hyper-relational facts. However, these approaches are limited to \emph{atomic facts}, which describe a single piece of information. This paper extends beyond \emph{atomic facts} and delves into \emph{nested facts}, represented by quoted triples where subjects and objects are triples themselves (e.g., ((\emph{BarackObama}, \emph{holds\_position}, \emph{President}), \emph{succeed\_by}, (\emph{DonaldTrump}, \emph{holds\_position}, \emph{President}))). These nested facts enable the expression of complex semantics like \emph{situations} over time and \emph{logical patterns} over entities and relations. In response, we introduce NestE, a novel KG embedding approach that captures the semantics of both atomic and nested factual knowledge. NestE represents each atomic fact as a 1×3 matrix, and each nested relation is modeled as a 3×3 matrix that rotates the 1×3 atomic fact matrix through matrix multiplication. Each element of the matrix is represented as a complex number in the generalized 4D hypercomplex space, including (spherical) quaternions, hyperbolic quaternions, and split-quaternions. Through thorough analysis, we demonstrate the embedding's efficacy in capturing diverse logical patterns over nested facts, surpassing the confines of first-order logic-like expressions. Our experimental results showcase NestE's significant performance gains over current baselines in triple prediction and conditional link prediction. The code and pre-trained models are open available at this https URL.
Xiong, Bo
d8c3ce0a-07ac-43f8-bd67-f230c6cbc1ec
Nayyeri, Mojtaba
476e5009-e6fc-45e6-ac7f-c07fe0898632
Lu, Linhao
d6e6433a-802b-427e-81ac-62bcdb1bdb9b
Wang, Zihao
639762c5-0b94-4e27-b8fc-e980881a7284
Pan, Shirui
5defae6b-0217-4d18-8c99-8ef0dd7665ca
Staab, Steffen
bf48d51b-bd11-4d58-8e1c-4e6e03b30c49
Xiong, Bo
d8c3ce0a-07ac-43f8-bd67-f230c6cbc1ec
Nayyeri, Mojtaba
476e5009-e6fc-45e6-ac7f-c07fe0898632
Lu, Linhao
d6e6433a-802b-427e-81ac-62bcdb1bdb9b
Wang, Zihao
639762c5-0b94-4e27-b8fc-e980881a7284
Pan, Shirui
5defae6b-0217-4d18-8c99-8ef0dd7665ca
Staab, Steffen
bf48d51b-bd11-4d58-8e1c-4e6e03b30c49

Xiong, Bo, Nayyeri, Mojtaba, Lu, Linhao, Wang, Zihao, Pan, Shirui and Staab, Steffen (2024) NestE: modeling nested relational structures for knowledge graph reasoning. The 38th Annual AAAI Conference on Artificial Intelligence, Vancouver Convention Centre, Vancouver, Canada. 20 - 27 Feb 2024. 15 pp . (doi:10.48550/arXiv.2312.09219).

Record type: Conference or Workshop Item (Paper)

Abstract

Reasoning with knowledge graphs (KGs) has primarily focused on triple-shaped facts. Recent advancements have been explored to enhance the semantics of these facts by incorporating more potent representations, such as hyper-relational facts. However, these approaches are limited to \emph{atomic facts}, which describe a single piece of information. This paper extends beyond \emph{atomic facts} and delves into \emph{nested facts}, represented by quoted triples where subjects and objects are triples themselves (e.g., ((\emph{BarackObama}, \emph{holds\_position}, \emph{President}), \emph{succeed\_by}, (\emph{DonaldTrump}, \emph{holds\_position}, \emph{President}))). These nested facts enable the expression of complex semantics like \emph{situations} over time and \emph{logical patterns} over entities and relations. In response, we introduce NestE, a novel KG embedding approach that captures the semantics of both atomic and nested factual knowledge. NestE represents each atomic fact as a 1×3 matrix, and each nested relation is modeled as a 3×3 matrix that rotates the 1×3 atomic fact matrix through matrix multiplication. Each element of the matrix is represented as a complex number in the generalized 4D hypercomplex space, including (spherical) quaternions, hyperbolic quaternions, and split-quaternions. Through thorough analysis, we demonstrate the embedding's efficacy in capturing diverse logical patterns over nested facts, surpassing the confines of first-order logic-like expressions. Our experimental results showcase NestE's significant performance gains over current baselines in triple prediction and conditional link prediction. The code and pre-trained models are open available at this https URL.

Text
2312.09219 - Accepted Manuscript
Available under License Creative Commons Attribution.
Download (519kB)

More information

Published date: 20 February 2024
Venue - Dates: The 38th Annual AAAI Conference on Artificial Intelligence, Vancouver Convention Centre, Vancouver, Canada, 2024-02-20 - 2024-02-27

Identifiers

Local EPrints ID: 485890
URI: http://eprints.soton.ac.uk/id/eprint/485890
PURE UUID: 996e8284-1ec8-4ffd-8210-c2fb95790c18
ORCID for Steffen Staab: ORCID iD orcid.org/0000-0002-0780-4154

Catalogue record

Date deposited: 03 Jan 2024 20:18
Last modified: 18 Mar 2024 03:32

Export record

Altmetrics

Contributors

Author: Bo Xiong
Author: Mojtaba Nayyeri
Author: Linhao Lu
Author: Zihao Wang
Author: Shirui Pan
Author: Steffen Staab ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×