| Challenge: | Existing representation learning methods for knowledge graph representation do not consider the ambiguity of relations and entities. |
| Approach: | They propose a text-enhanced knowledge graph representation learning method which exploits the entity descriptions and triple-specific relation mention to enhance representations. |
| Outcome: | The proposed method outperforms existing representation learning models on link prediction and triple classification tasks and significantly outperformed existing models. |
Similar Papers
VISTA: Visual-Textual Knowledge Graph Representation Learning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods only consider the structure of a knowledge graph, but some recent proposed methods utilize images or text descriptions of entities in a VTKG. |
| Approach: | They propose a visual-textual knowledge graph (VTKG) where triplets can be explained using images and entities and relations can accompany text descriptions. |
| Outcome: | The proposed method outperforms state-of-the-art knowledge graph completion methods in real-world knowledge graphs. |
ENT-DESC: Entity Description Generation by Exploring Knowledge Graph (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for knowledge-to-text generation use RDF triples or key-value pairs to generate a natural language description. |
| Approach: | They propose a large-scale dataset to facilitate the study of KG-to-text . they propose MGCN model architecture that incorporates aggregation methods to extract the rich graph information. |
| Outcome: | The proposed model can represent the original graph information more comprehensively and integrates multiple aggregation methods to extract the rich graph information. |
Exploiting Structured Knowledge in Text via Graph-Guided Representation Learning (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for integrating knowledge graphs into pre-trained language models have been poorly implemented. |
| Approach: | They propose a self-supervised entity masking scheme that exploits relational knowledge underlying the text. |
| Outcome: | The proposed model achieves improved performance on five benchmarks, including question answering and knowledge base completion. |
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. |
A Mutual Information Perspective on Knowledge Graph Embedding (2025.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding techniques suffer from high intra-group similarity, loss of semantic information, and insufficient inference capability, particularly in complex relation patterns such as 1-N and N-1 relations. |
| Approach: | They propose a knowledge graph embedding framework that leverages mutual information maximization to improve the semantic representation of entities and relations. |
| Outcome: | Extensive experiments on benchmark datasets demonstrate the effectiveness of the proposed method, with consistent performance improvements across various baseline models. |
LinkNBed: Multi-Graph Representation Learning with Entity Linkage (P18-1)
Copied to clipboard
| Challenge: | Knowledge graphs have emerged as an important model for studying complex multi-relational data. |
| Approach: | They propose a deep relational learning framework that learns entity and relationship representations across multiple graphs. |
| Outcome: | The proposed framework improves on the state-of-the-art relational learning approaches and identifies entity linkage across graphs. |
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. |
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. |
Improving Recall of Large Language Models: A Model Collaboration Approach for Relational Triple Extraction (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing large language models can extract triples from simple sentences with few-shot learning or fine-tuning, but they often miss out when extracting from complex sentences. |
| Approach: | They propose an evaluation-filtering framework that integrates large language models with small models for relational triple extraction tasks. |
| Outcome: | The proposed framework integrates large language models with small models for relational triple extraction tasks. |
A Relational Memory-based Embedding Model for Triple Classification and Search Personalization (2020.acl-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods do not allow for the prediction of new triples, such as for search personalization tasks. |
| Approach: | They propose a relational memory network to encode potential dependencies in relationship triples by a transformer self-attention mechanism. |
| Outcome: | The proposed model obtains state-of-the-art results on SEARCH17, WN11 and FB13 for the search personalization task, and on a convolutional neural network-based decoder. |