Representation Learning with Ordered Relation Paths for Knowledge Graph Completion (D19-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs are incomplete and lack the order of relations in paths. |
| Approach: | They propose a method which takes relation paths into account but ignores order of relations in paths which is important for reasoning. |
| Outcome: | The proposed method performs better than state-of-the-art methods on two benchmark datasets. |
Similar Papers
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. |
Joint Completion and Alignment of Multilingual Knowledge Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph completion are incomplete, as curators struggle to keep up with the real world. |
| Approach: | They propose a multitask approach to solve missing facts in incomplete Knowledge Graphs . they add a relation representation to the existing KG embedding scheme . |
| Outcome: | The proposed system outperforms existing models in seven languages compared to existing models . it also outperformed existing models, underscoring the value of joint alignment and completion. |
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. |
Learning Sequence Encoders for Temporal Knowledge Graph Completion (D18-1)
Copied to clipboard
| Challenge: | Existing work on link prediction in knowledge graphs has focused on static multi-relational data. |
| Approach: | They propose to learn latent entity and relation type representations to incorporate temporal information into knowledge graphs. |
| Outcome: | The proposed approach is robust to common challenges in real-world KGs. |
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. |
Relation Prediction for Unseen-Entities Using Entity-Word Graphs (D19-53)
Copied to clipboard
Yuki Tagawa, Motoki Taniguchi, Yasuhide Miura, Tomoki Taniguchi, Tomoko Ohkuma, Takayuki Yamamoto, Keiichi Nemoto
| Challenge: | Knowledge graphs (KGs) are incomplete and miss some information. |
| Approach: | They propose to learn entity representations via a graph structure that uses Seen-entities, Unseen-Entities and words as nodes created from the descriptions of all entities. |
| Outcome: | The proposed method improves relation prediction for the entity pairs containing Unseen-entities. |
Does Pre-trained Language Model Actually Infer Unseen Links in Knowledge Graph Completion? (2024.naacl-long)
Copied to clipboard
| Challenge: | Knowledge Graph Completion (KGC) is a task that infers unseen relationships between entities . traditional embedding-based methods infer missing links using only training data . a pre-trained language model (PLM)-based KGC may be ineffective in practical applications . |
| Approach: | They propose to use knowledge Graph Completion (KGC) to infer unseen relationships . traditional embedding-based KGC methods infer missing links only from training data . they argue that pre-trained language models acquire inference abilities through pre-training . |
| Outcome: | The proposed method improves performance even though it does not use memorized knowledge. |
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. |
A Semantic Filter Based on Relations for Knowledge Graph Completion (2021.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge graph embedding is a new form of knowledge graphing that allows for better link prediction. |
| Approach: | They propose to use relational embedding to fit symmetry/antisymmetry and combination relationships. |
| Outcome: | The proposed model can fit symmetry/antisymmetry and combination relationships. |
GreenKGC: A Lightweight Knowledge Graph Completion Method (2023.acl-long)
Copied to clipboard
| Challenge: | Knowledge graph completion (KGC) aims to discover missing relationships in knowledge graphs (KGs). |
| Approach: | They propose a modularized knowledge graph completion solution that learns embeddings for entities and relations through a score function. |
| Outcome: | Experimental results show that GreenKGC outperforms SOTA methods in low dimensions and even better against high-dimensional models with a much smaller model size. |