Pith. sign in

REVIEW 2 cited by

HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.06588 v2 pith:QWZXLFS4 submitted 2023-05-11 cs.AI cs.LG

classification cs.AIcs.LG
keywords attentionhahepredictionstructurehyper-relationallinkrepresentationglobal-level
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Link Prediction on Hyper-relational Knowledge Graphs (HKG) is a worthwhile endeavor. HKG consists of hyper-relational facts (H-Facts), composed of a main triple and several auxiliary attribute-value qualifiers, which can effectively represent factually comprehensive information. The internal structure of HKG can be represented as a hypergraph-based representation globally and a semantic sequence-based representation locally. However, existing research seldom simultaneously models the graphical and sequential structure of HKGs, limiting HKGs' representation. To overcome this limitation, we propose a novel Hierarchical Attention model for HKG Embedding (HAHE), including global-level and local-level attention. The global-level attention can model the graphical structure of HKG using hypergraph dual-attention layers, while the local-level attention can learn the sequential structure inside H-Facts via heterogeneous self-attention layers. Experiment results indicate that HAHE achieves state-of-the-art performance in link prediction tasks on HKG standard datasets. In addition, HAHE addresses the issue of HKG multi-position prediction for the first time, increasing the applicability of the HKG link prediction task. Our code is publicly available.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A survey of n-ary knowledge representation learning methods proposes a two-dimensional taxonomy based on modeling technique and entity role/position awareness.

  2. A Survey of Link Prediction in N-ary Knowledge Graphs

    cs.AI 2025-06 conditional novelty 4.0 of 10

    A comprehensive survey of link prediction in n-ary knowledge graphs, providing a method taxonomy, benchmark statistics, performance comparisons, and open problems.

Pith tools