A Unified Joint Approach with Topological Context Learning and Rule Augmentation for Knowledge Graph Completion (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing knowledge graph completion methods perform simple linear update on relation representation, and only local neighborhood information is aggregated, making it difficult to capture logic semantic between relations and global topological context information. |
| Approach: | They propose a joint approach with Topological Context learning and Rule Augmentation (TCRA) it uses a topological context learning mechanism and a relation rule context learning system . |
| Outcome: | The proposed approach performs better on three benchmark datasets and is widely used in knowledgeintensive applications. |
Similar Papers
Retrieval, Reasoning, Re-ranking: A Context-Enriched Framework for Knowledge Graph Completion (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing embedding-based methods rely on triples in the KG, which is vulnerable to specious relation patterns and long-tail entities. |
| Approach: | They propose a context-enriched framework for KGC that uses a large language model to generate potential answers for each query triple. |
| Outcome: | The proposed framework improves on FB15k237 and WN18RR datasets. |
Knowledge Context Modeling with Pre-trained Language Models for Contrastive Knowledge Graph Completion (2024.findings-acl)
Copied to clipboard
| Challenge: | Text-based knowledge graph completion methods neglect knowledge contexts in inferring process. |
| Approach: | They propose a framework which models the knowledge context as additional prompts with pre-trained language models for knowledge graph completion. |
| Outcome: | The proposed framework achieves state-of-the-art on FB15k-237, WN18RR and Wikidata5M datasets. |
Better Together: Enhancing Generative Knowledge Graph Completion with Language Models and Neighborhood Information (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Knowledge graph completion (KGC) methods are computationally intensive and impractical for large-scale KGs. |
| Approach: | They propose to include node neighborhoods as additional information to improve KGC methods based on language models. |
| Outcome: | The proposed method outperforms KGT5 and conventional methods on inductive and transductive Wikidata subsets and shows its importance. |
Knowledge Is Flat: A Seq2Seq Generative Framework for Various Knowledge Graph Completion (2022.coling-1)
Copied to clipboard
| Challenge: | Knowledge Graph Completion (KGC) has been extended to multiple knowledge graph (KG) structures, initiating new research directions, e.g. static KGC, temporal KGC and few-shot KGC. |
| Approach: | They propose a generative framework that could tackle different verbalizable graph structures by unifying the representation of KG facts into "flat" text. |
| Outcome: | The proposed framework outperforms many competitive baselines and sets new state-of-the-art performance on five benchmarks. |
Multi-perspective Improvement of Knowledge Graph Completion with Large Language Models (2024.lrec-main)
Copied to clipboard
Derong Xu, Ziheng Zhang, Zhenxi Lin, Xian Wu, Zhihong Zhu, Tong Xu, Xiangyu Zhao, Yefeng Zheng, Enhong Chen
| Challenge: | Knowledge graph completion (KGC) is a widely used method to tackle incompleteness in knowledge graphs (KGs). |
| Approach: | They propose a general framework to compensate for the deficiency of contextualized knowledge by querying large language models from various perspectives. |
| Outcome: | The proposed framework improves knowledge graph completion (KGC) by querying large language models from various perspectives. |
Prior Relational Schema Assists Effective Contrastive Learning for Inductive Knowledge Graph Completion (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs lack robustness and incompleteness to provide link prediction. |
| Approach: | They propose to capture prior schema-level interactions related to relations by leveraging entity type information and introduce schema-guided negatives to bolster the efficiency of normal contrastive representation learning. |
| Outcome: | The proposed method achieves state-of-the-art performance on multiple established metrics across multiple datasets for link prediction. |
A2N: Attending to Neighbors for Knowledge Graph Inference (P19-1)
Copied to clipboard
| Challenge: | Existing knowledge graph completion methods learn a fixed embedding for every entity, which is suboptimal as it requires memorizing and generalizing to all possible entity relationships. |
| Approach: | They propose a method which learns query-dependent representations of entities by combining relevant neighborhood of an entity. |
| Outcome: | The proposed model performs competitively or better than existing state-of-the-art models for knowledge graph completion. |
Double-Branch Multi-Attention based Graph Neural Network for Knowledge Graph Completion (2023.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods cannot capture local and global information and are not designed well to learn representations of seen entities with sparse neighborhoods in isolated subgraphs. |
| Approach: | They propose a double-branch multi-attention based graph neural network to learn more expressive entity representations which contain rich global-local structural information. |
| Outcome: | The proposed method outperforms a general GNN-based approach for KGC. |
KICGPT: Large Language Model with Knowledge in Context for Knowledge Graph Completion (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph completion methods struggle with long-tail entities due to limited structural information and imbalanced distributions of entities. |
| Approach: | They propose a framework that integrates a large language model and a triple-based KGC retriever to alleviate the long-tail problem without incurring additional training overhead. |
| Outcome: | The proposed model reduces training overhead and finetuning costs on benchmark 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. |