StATIK: Structure and Text for Inductive Knowledge Graph Completion (2022.findings-naacl)
Copied to clipboard
Elan Markowitz, Keshav Balasubramanian, Mehrnoosh Mirtaheri, Murali Annavaram, Aram Galstyan, Greg Ver Steeg
| Challenge: | Knowledge graphs (KGs) represent incomplete knowledge bases. |
| Approach: | They propose to use language models to extract semantic information from text descriptions while using Message Passing Neural Networks to capture structural information. |
| Outcome: | The proposed model achieves state of the art on three challenging inductive baselines. |
Similar Papers
Joint Language Semantic and Structure Embedding for Knowledge Graph Completion (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods to complete knowledge triplets rely on structures or semantics, but use semantics to improve performance. |
| Approach: | They propose to embed semantics in the natural language description of knowledge triplets with their structure information. |
| Outcome: | The proposed method improves performance on knowledge graph benchmarks and on low-resource regimes. |
Inductive Knowledge Graph Completion with GNNs and Rules: An Analysis (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for inductive knowledge graph completion are underperforming . implausible entities are not ranked and only the most informative path is taken into account . |
| Approach: | They propose to use a rule-based approach to find plausible triples missing from a given KG. |
| Outcome: | The proposed models outperform state-of-the-art methods on inductive knowledge graph completion. |
Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks (2020.acl-main)
Copied to clipboard
| Challenge: | Existing graph-based methods for text classification cannot capture contextual word relationships within each document nor can they produce inductive learning of new words. |
| Approach: | They propose to use Graph Neural Networks to learn the local word representations and then aggregate the word nodes as the document embeddings. |
| Outcome: | The proposed method outperforms state-of-the-art methods on four 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. |
SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models (2022.acl-long)
Copied to clipboard
| Challenge: | Text-based methods lag behind graph embedding-based approaches for knowledge graph completion (KGC) |
| Approach: | They propose three types of negatives to improve contrastive learning to improve learning efficiency. |
| Outcome: | The proposed model outperforms embedding-based methods on several benchmark datasets. |
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. |
DynaSemble: Dynamic Ensembling of Textual and Structure-Based Models for Knowledge Graph Completion (2024.acl-short)
Copied to clipboard
| Challenge: | Existing approaches to Knowledge Graph Completion use textual descriptions of the KG entities and relations to perform the task. |
| Approach: | They propose a method to combine two popular approaches to Knowledge Graph Completion . structure-based models perform better when gold answer is easily reachable . textual models exploit textual descriptions to give good performance . |
| Outcome: | The proposed method achieves 6.8 pt MRR and 8.3 pTits@1 gains over the best baseline model for WN18RR dataset. |
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. |
GLTW: Joint Improved Graph Transformer and LLM via Three-Word Language for Knowledge Graph Completion (2025.findings-acl)
Copied to clipboard
Kangyang Luo, Yuzhuo Bai, Cheng Gao, Shuzheng Si, Zhu Liu, Yingli Shen, Zhitong Wang, Cunliang Kong, Wenhao Li, Yufei Huang, Ye Tian, Xuantang Xiong, Lei Han, Maosong Sun
| Challenge: | Existing knowledge graphs lack the ability to integrate structural information into LLMs and output predictions deterministically. |
| Approach: | They propose a method which encodes structural information of KGs and merges it with LLMs to enhance KGC performance. |
| Outcome: | The proposed method improves the performance of KG Completion datasets on KGs by integrating structural information with LLMs. |