| Challenge: | Existing approaches to link prediction over knowledge graphs (KGs) are designed to work over triple-based models, where facts are represented as binary relations between entities. |
| Approach: | They propose a message passing based graph encoder - StarE capable of modeling hyper-relational knowledge graphs (KGs) they propose to encode an arbitrary number of additional information along with the main triple while keeping the semantic roles of qualifiers and triples intact. |
| Outcome: | The proposed model outperforms existing models across multiple benchmarks and shows that leveraging qualifiers is vital for link prediction. |
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. |
Shrinking Embeddings for Hyper-Relational Knowledge Graphs (2023.acl-long)
Copied to clipboard
| Challenge: | Existing studies have focused on binary relational KGs where each fact is represented by a triple. |
| Approach: | They propose a geometric hyper-relational KG embedding method that explicitly models qualifier monotonicity, qualifier implication, and qualifier mutual exclusion. |
| Outcome: | The proposed method outperforms existing methods on three benchmarks of hyper-relational KGs. |
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. |
Wikontic: Constructing Wikidata-Aligned, Ontology-Aware Knowledge Graphs with Large Language Models (2026.eacl-long)
Copied to clipboard
| Challenge: | Knowledge graphs provide structured, verifiable grounding for large language models . current LLMs use KGs as auxiliary structures for text retrieval . |
| Approach: | They propose a pipeline that constructs KGs from open-domain texts using triplets and qualifiers. |
| Outcome: | The proposed pipeline outperforms existing methods in retrieval-augmented generation. |
MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph completion have not integrated the structural attributes of knowledge graphs with the textual descriptions of entities to generate robust entity encodings. |
| Approach: | They propose to integrate structural information from knowledge graphs with textual descriptions of entities to generate robust entity encodings. |
| Outcome: | The proposed model improves on the standard evaluation metric, Mean Reciprocal Rank (MRR), while surpassing the current best model on the Wikidata5M dataset. |
A Dataset for Hyper-Relational Extraction and a Cube-Filling Approach (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods do not consider qualifier attributes for each relation triplet, such as time, quantity or location. |
| Approach: | They propose a hyper-relational extraction task to extract more specific facts from text using qualifiers. |
| Outcome: | The proposed model outperforms baselines and reveal possible directions for future research. |
Sequence-to-Sequence Knowledge Graph Completion and Question Answering (2022.acl-long)
Copied to clipboard
| Challenge: | Knowledge graph embedding (KGE) models represent each entity and relation of a knowledge graph (KG) with low-dimensional embeddable vectors. |
| Approach: | They propose to use an off-the-shelf encoder-decoder Transformer model to generate a knowledge graph embedding model that can be used for KG link prediction and incomplete KG question answering. |
| Outcome: | The proposed model outperforms baselines on multiple large-scale datasets without extensive hyperparameter tuning. |
Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models of temporal fact reasoning do not explicitly specify temporal information for each fact. |
| Approach: | They propose a new type of data structure called hyper-relational TKG to study temporal fact reasoning over HKGs. |
| Outcome: | The proposed model is based on two new benchmark HTKG datasets . it provides additional key-value pairs (i.e., qualifiers) for each KG fact . |
Digest the Knowledge: Large Language Models empowered Message Passing for Knowledge Graph Question Answering (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods to augment large language models (LLMs) with external knowledge are unorganized and unorganized. |
| Approach: | They propose a method that learns a concise facts graph and encodes it into multi-level lists of texts to augment LLMs. |
| Outcome: | The proposed method improves on all 5 knowledge graph question answering datasets and offers human-level semantic explainability. |
Learning Reasoning Patterns for Relational Triple Extraction with Mutual Generation of Text and Graph (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods focused on learning text patterns from explicit mentions but failed to extract the implicitly implied triples. |
| Approach: | They propose to construct a relational graph from a sentence and apply multi-layer graph convolutions to capture the type inference logic of the paths. |
| Outcome: | The proposed framework can find multi-hop reasoning paths and capture type inference logic with the sentence's supplementary relational expressions. |