SMiLE: Schema-augmented Multi-level Contrastive Learning for Knowledge Graph Link Prediction (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for linking knowledge graphs lack contextual information in entity neighborhoods, which leads to false prediction results. |
| Approach: | They propose a Schema-augmented Multi-level contrastive LEarning framework to conduct knowledge graph link prediction using a knowledge graph schema. |
| Outcome: | The proposed framework is based on a knowledge graph schema and is compared against state-of-the-art datasets. |
Similar Papers
HyperCL: A Contrastive Learning Framework for Hyper-Relational Knowledge Graph Embedding with Hierarchical Ontology (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies neglect the ontology of knowledge Graph (KG) embeddings and suffer from the dominance issue of facts over ontologies. |
| Approach: | They propose a framework for hyper-relational KG embeddings that captures the hierarchical ontology and a concept-aware contrastive loss to alleviate the dominance issue. |
| Outcome: | The proposed framework improves on three real-world datasets and shows that it can integrate with other embedding methods and improve link prediction performance. |
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. |
Knowledge Representation Learning with Contrastive Completion Coding (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge representation learning methods suffer from immaturity on tackling potentially-imperfect knowledge graphs and highly-imbalanced positive-negative instances during training. |
| Approach: | They propose a framework for knowledge representation learning that incorporates two functional components to achieve robust embedding for each entity/relation. |
| Outcome: | The proposed framework achieves better convergence against state-of-the-art methods on several benchmarks. |
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. |
Link Prediction on N-ary Relational Facts: A Graph-based Approach (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing work on knowledge graphs (KGs) focused on binary relations, but higher-arity relations are ubiquitous in real-world KGs. |
| Approach: | They propose a graph-based approach to link prediction on knowledge graphs using n-ary relational facts and edge-biased fully-connected attention. |
| Outcome: | The proposed approach performs substantially better than current state-of-the-art across a variety of n-ary relational benchmarks. |
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. |
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. |
To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion (2023.acl-long)
Copied to clipboard
Rui Li, Xu Chen, Chaozhuo Li, Yanming Shen, Jianan Zhao, Yujing Wang, Weihao Han, Hao Sun, Weiwei Deng, Qi Zhang, Xing Xie
| Challenge: | Existing methods for embedding knowledge graphs implicitly memorize relation rules to infer missing links, but they are difficult to memorize due to the inherent deficiencies of such implicit memorization strategy. |
| Approach: | They propose a vertical learning paradigm that allows to explicitly copy target information from related factual triples for more accurate prediction. |
| Outcome: | The proposed model improves generalization ability and makes distant link prediction significantly easier. |
HittER: Hierarchical Transformers for Knowledge Graph Embeddings (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods to learn representations of knowledge graphs are conceptually simple and can be applied to tasks like factoid question answering (Saxena et al., 2020) and reasoning. |
| Approach: | They propose a Hierarchical Transformer model to jointly learn Entity-relation composition and Relational contextualization based on a source entity’s neighborhood. |
| Outcome: | The proposed model achieves state-of-the-art on multiple link prediction datasets and can be integrated into BERT and demonstrate its effectiveness on two Freebase factoid question answering datasets. |
MICO: A Multi-alternative Contrastive Learning Framework for Commonsense Knowledge Representation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to commonsense reasoning include fine-tuning large pre-trained language models or injecting the entire knowledge base for CKGC. |
| Approach: | They propose to learn commonsense knowledge representation by using a multi-alternative contrastive learning framework on COmmonsense Knowledge graphs. |
| Outcome: | Extensive experiments show that the proposed framework is effective in commonsense reasoning tasks. |