HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level (2023.acl-long)
Copied to clipboard
Haoran Luo, Haihong E, Yuhao Yang, Yikai Guo, Mingzhi Sun, Tianyu Yao, Zichen Tang, Kaiyang Wan, Meina Song, Wei Lin
| Challenge: | Existing research on HKGs rarely models the graphical and sequential structure of HKG, limiting their representation. |
| Approach: | They propose a Hierarchical Attention model for HKG Embedding that includes global-level and local-level attention to model the graphical structure of HKGs. |
| Outcome: | The proposed model achieves state-of-the-art performance on HKG standard datasets and addresses the issue of HKG multi-position prediction for the first time. |
Similar Papers
HyperCL: A Contrastive Learning Framework for Hyper-Relational Knowledge Graph Embedding with Hierarchical Ontology (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies neglect the ontology of knowledge Graph (KG) embeddings and suffer from the dominance issue of facts over ontologies. |
| Approach: | They propose a framework for hyper-relational KG embeddings that captures the hierarchical ontology and a concept-aware contrastive loss to alleviate the dominance issue. |
| Outcome: | The proposed framework improves on three real-world datasets and shows that it can integrate with other embedding methods and improve link prediction performance. |
HDiff: Confidence-Guided Denoising Diffusion for Robust Hyper-relational Link Prediction (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Hyper-relational Knowledge Graph Completion (HKGC) is more sensitive to inherent noise, particularly struggling with two prevalent HKG-specific noise types: Intra-fact Inconsistency and Cross-fact Association Noise. |
| Approach: | They propose a conditional denoising diffusion framework that learns to reverse structured noise corruption. |
| Outcome: | The proposed framework outperforms state-of-the-art HKGC methods in a variety of noisy conditions. |
Dual Attention Network for Cross-lingual Entity Alignment (2020.coling-main)
Copied to clipboard
| Challenge: | Experimental results on three real-world cross-lingual entity alignment datasets have shown the effectiveness of DAEA. |
| Approach: | They propose a dual attention network for cross-lingual entity alignment . they use relation-aware graph attention and hierarchical attention to solve this problem . |
| Outcome: | The proposed approach can be applied to three real-world cross-lingual entity alignment datasets. |
Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs (P19-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs (KGs) are incomplete or partial information, in the form of missing relations between entities, which gives rise to the task of knowledge base completion (also known as relation prediction). |
| Approach: | They propose to capture both entity and relation features in any given neighborhood and encapsulate relation clusters and multi-hop relations in their attention-based model. |
| Outcome: | The proposed model captures both entity and relation features in any given neighborhood and also encapsulates relation clusters and multi-hop relations. |
Learning to Think on Hypergraph: HyperCoT for Structure-Guided N-ary Knowledge Graph Completion (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods to solve knowledge hypergraph link prediction problem are limited by their ability to generate chain-of-thought (CoT) representations. |
| Approach: | They propose a structure-aware approach that models multi-hop structural reasoning as a depth-sensitive progressive evidence accumulation process. |
| Outcome: | Experiments on three real-world datasets show that HyperCoT outperforms strong n-ary KGC baselines while yielding interpretable multi-hop reasoning traces. |
Knowledge Graph Embedding with Hierarchical Relation Structure (D18-1)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models embed entities and relations into latent vectors without leveraging rich information from relation structure. |
| Approach: | They extend existing KGE models to learn knowledge representations by leveraging relation structure . authors say their approach is capable of extending other KGEs . |
| Outcome: | The proposed approach can extend existing KGE models, and validates against baselines. |
HGCLIP: Exploring Vision-Language Models with Graph Representations for Hierarchical Understanding (2025.coling-main)
Copied to clipboard
| Challenge: | Object categories are typically organized into a multi-granularity taxonomic hierarchy . traditional uni-modal approaches focus primarily on image features, revealing limitations in complex scenarios. |
| Approach: | They propose a framework that combines vision-language models with a deeper exploitation of the hierarchy. |
| Outcome: | The proposed framework shows significant improvements on 11 diverse visual recognition benchmarks. |
Low-Dimensional Hyperbolic Knowledge Graph Embeddings (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for predicting missing facts do not account for hierarchical and logical patterns in KGs. |
| Approach: | They propose a class of hyperbolic KG embedding models that capture hierarchical and logical patterns. |
| Outcome: | Experimental results show that the proposed method improves by 6.1% in mean reciprocal rank in low dimensions over previous methods. |
Hyperbolic Hierarchy-Aware Knowledge Graph Embedding for Link Prediction (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods are built on Euclidean space, which are difficult to handle hierarchical structures. |
| Approach: | They propose a KGE model with extended Poincaré Ball and polar coordinate system to capture hierarchical structures. |
| Outcome: | The proposed model captures hierarchical relationships with extended Poincaré Ball and polar coordinate system in hyperbolic space and achieves state-of-the-art results on part of link prediction tasks. |
Hierarchical Attention Graph for Scientific Document Summarization in Global and Local Level (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for document summarization focus on one type of relation, neglecting the simultaneous effective modeling of both relations. |
| Approach: | They propose a graph neural network-based approach to local and global document summarization using hierarchical discourses. |
| Outcome: | The proposed approach improves on two benchmark datasets and shows that hierarchical structures are important for document summarization. |