| Challenge: | Existing knowledge graph completion models only evaluated candidate triples from content information. |
| Approach: | They propose a multi-view classification model where multiple views are performed based on both content and context information for candidate triple evaluation. |
| Outcome: | The proposed model improves on two representative datasets and improves performance. |
Similar Papers
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. |
Multi-Task Learning for Knowledge Graph Completion with Pre-trained Language Models (2020.coling-main)
Copied to clipboard
| Challenge: | Existing knowledge graph completion methods are lacking in ranking metrics such as Hits@k . despite the high performance, the proposed method is still behind state-of-the-art models. |
| Approach: | They propose a multi-task learning method that integrates relational and relevance ranking tasks with target link prediction to improve ranking performance. |
| Outcome: | The proposed method improves ranking performance but still behind state-of-the-art models in Hits@k and Mean Rank metrics. |
Path-enhanced Pre-trained Language Model for Knowledge Graph Completion (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Pre-trained language models have achieved remarkable knowledge graph completion (KGC) success. |
| Approach: | They propose a path-enhanced pre-trained language model-based knowledge graph completion method which uses multi-view generation to infer missing facts in triple-level and path-level simultaneously. |
| Outcome: | The proposed method significantly improves the performance of the knowledge graph completion task. |
CAKE: A Scalable Commonsense-Aware Framework For Multi-View Knowledge Graph Completion (2022.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding techniques rely on fact-view data to predict missing links between entities, limiting their performance. |
| Approach: | They propose a commonsense-aware knowledge embedding framework which generates commonsensense from factual triples with entity concepts for a KGC task. |
| Outcome: | The proposed framework could produce high-quality negative triples and joint commonsense and fact-view link prediction. |
Data Augmentation for Few-Shot Knowledge Graph Completion from Hierarchical Perspective (2022.coling-1)
Copied to clipboard
| Challenge: | Existing knowledge graph completion models require only a few associative triples to complete a relationship. |
| Approach: | They propose to perform data augmentation from two perspectives to solve the FKGC problem by inferring new triple facts from existing models. |
| Outcome: | The proposed framework can be applied to a number of existing models. |
A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network (N18-2)
Copied to clipboard
| Challenge: | Existing knowledge base embedding models are incomplete, i.e., missing a lot of valid triples. |
| Approach: | They propose a convolutional neural network embedding model for knowledge base completion that captures global relationships and transitional characteristics. |
| Outcome: | The proposed model outperforms state-of-the-art models on two benchmark 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. |
KGxBoard: Explainable and Interactive Leaderboard for Evaluation of Knowledge Graph Completion Models (2022.emnlp-demos)
Copied to clipboard
Haris Widjaja, Kiril Gashteovski, Wiem Ben Rim, Pengfei Liu, Christopher Malon, Daniel Ruffinelli, Carolin Lawrence, Graham Neubig
| Challenge: | Knowledge Graphs (KGs) store information in the form of (head, predicate, tail)-triples. |
| Approach: | They propose a framework for performing fine-grained evaluation on meaningful subsets of data. |
| Outcome: | The proposed framework tests models on meaningful subsets of the data, which would have been impossible to detect with standard averaged single-score metrics. |
CoDEx: A Comprehensive Knowledge Graph Completion Benchmark (2020.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge graph completion benchmarks for knowledge graphs are often incomplete . however, the field has remained static over the past decade . |
| Approach: | They propose to use Wikidata and Wikipedia to improve on existing benchmarks . they analyze logical relation patterns, then perform baseline link prediction and triple classification . |
| Outcome: | The proposed datasets improve upon existing benchmarks in scope and difficulty. |
A Framework for Adapting Pre-Trained Language Models to Knowledge Graph Completion (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent work has demonstrated that entity representations can be extracted from pre-trained language models to develop knowledge graph completion models that are more robust to the naturally occurring sparsity found in knowledge graphs. |
| Approach: | They propose unsupervised and supervised methods to extract more informative representations from pre-trained language models to develop knowledge graph completion models. |
| Outcome: | The proposed model outperforms recent neural models in terms of performance and unsupervised processing methods. |