Improving Knowledge Graph Embeddings through Contrastive Learning with Negative Statements

• URL: http://arxiv.org/abs/2510.11868v1
• Date: Mon, 13 Oct 2025 19:21:37 GMT
• Title: Improving Knowledge Graph Embeddings through Contrastive Learning with Negative Statements
• Authors: Rita T. Sousa, Heiko Paulheim,
• Abstract summary: We introduce a novel approach that integrates explicitly declared negative statements into the knowledge embedding learning process.<n>The proposed approach is evaluated on both general-purpose and domain-specific knowledge graphs, with a focus on link prediction and triple classification tasks.
• Score: 3.4591414173342643
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Knowledge graphs represent information as structured triples and serve as the backbone for a wide range of applications, including question answering, link prediction, and recommendation systems. A prominent line of research for exploring knowledge graphs involves graph embedding methods, where entities and relations are represented in low-dimensional vector spaces that capture underlying semantics and structure. However, most existing methods rely on assumptions such as the Closed World Assumption or Local Closed World Assumption, treating missing triples as false. This contrasts with the Open World Assumption underlying many real-world knowledge graphs. Furthermore, while explicitly stated negative statements can help distinguish between false and unknown triples, they are rarely included in knowledge graphs and are often overlooked during embedding training. In this work, we introduce a novel approach that integrates explicitly declared negative statements into the knowledge embedding learning process. Our approach employs a dual-model architecture, where two embedding models are trained in parallel, one on positive statements and the other on negative statements. During training, each model generates negative samples by corrupting positive samples and selecting the most likely candidates as scored by the other model. The proposed approach is evaluated on both general-purpose and domain-specific knowledge graphs, with a focus on link prediction and triple classification tasks. The extensive experiments demonstrate that our approach improves predictive performance over state-of-the-art embedding models, demonstrating the value of integrating meaningful negative knowledge into embedding learning.

Related papers

• TA-KAND: Two-stage Attention Triple Enhancement and U-KAN based Diffusion For Few-shot Knowledge Graph Completion [14.690889651373437]
  Knowledge Graphs have been widely applied in intelligent question answering, recommender systems and other domains.<n>Real-world data inevitably renders the distribution of relations long-tailed, making it crucial to complete missing facts with limited samples.<n>We propose a few-shot knowledge graph completion framework that integrates two-stage attention triple enhancer with U-KAN based diffusion model.
  arXiv  Detail & Related papers  (2025-12-13T05:04:59Z)
• Knowledge Graph Enhanced Generative Multi-modal Models for Class-Incremental Learning [51.0864247376786]
  We introduce a Knowledge Graph Enhanced Generative Multi-modal model (KG-GMM) that builds an evolving knowledge graph throughout the learning process.<n>During testing, we propose a Knowledge Graph Augmented Inference method that locates specific categories by analyzing relationships within the generated text.
  arXiv  Detail & Related papers  (2025-03-24T07:20:43Z)
• Learning Latent Graph Structures and their Uncertainty [63.95971478893842]
  We show that minimizing point-prediction losses does not guarantee proper learning of latent relational information.<n>We propose a sampling-based method that solves this joint learning task.
  arXiv  Detail & Related papers  (2024-05-30T10:49:22Z)
• Pre-training and Diagnosing Knowledge Base Completion Models [58.07183284468881]
  We introduce and analyze an approach to knowledge transfer from one collection of facts to another without the need for entity or relation matching. The main contribution is a method that can make use of large-scale pre-training on facts, which were collected from unstructured text. To understand the obtained pre-trained models better, we then introduce a novel dataset for the analysis of pre-trained models for Open Knowledge Base Completion.
  arXiv  Detail & Related papers  (2024-01-27T15:20:43Z)
• Biomedical Knowledge Graph Embeddings with Negative Statements [1.7778609937758327]
  Explicitly considering negative statements has been shown to improve performance on tasks such as entity summarization. We propose a novel approach, TrueWalks, to incorporate negative statements into the knowledge graph representation learning process. We present a novel walk-generation method that is able to not only differentiate between positive and negative statements but also take into account the semantic implications of negation.
  arXiv  Detail & Related papers  (2023-08-07T10:08:25Z)
• Globally Interpretable Graph Learning via Distribution Matching [12.885580925389352]
  We aim to answer an important question that is not yet well studied: how to provide a global interpretation for the graph learning procedure? We formulate this problem as globally interpretable graph learning, which targets on distilling high-level and human-intelligible patterns that dominate the learning procedure. We propose a novel model fidelity metric, tailored for evaluating the fidelity of the resulting model trained on interpretations.
  arXiv  Detail & Related papers  (2023-06-18T00:50:36Z)
• SMiLE: Schema-augmented Multi-level Contrastive Learning for Knowledge Graph Link Prediction [28.87290783250351]
  Link prediction is the task of inferring missing links between entities in knowledge graphs. We propose a novel Multi-level contrastive LEarning framework (SMiLE) to conduct knowledge graph link prediction.
  arXiv  Detail & Related papers  (2022-10-10T17:40:19Z)
• Repurposing Knowledge Graph Embeddings for Triple Representation via Weak Supervision [77.34726150561087]
  Current methods learn triple embeddings from scratch without utilizing entity and predicate embeddings from pre-trained models. We develop a method for automatically sampling triples from a knowledge graph and estimating their pairwise similarities from pre-trained embedding models. These pairwise similarity scores are then fed to a Siamese-like neural architecture to fine-tune triple representations.
  arXiv  Detail & Related papers  (2022-08-22T14:07:08Z)
• Bayesian Graph Contrastive Learning [55.36652660268726]
  We propose a novel perspective of graph contrastive learning methods showing random augmentations leads to encoders. Our proposed method represents each node by a distribution in the latent space in contrast to existing techniques which embed each node to a deterministic vector. We show a considerable improvement in performance compared to existing state-of-the-art methods on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-12-15T01:45:32Z)
• Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion [53.31911669146451]
  Human-curated knowledge graphs provide critical supportive information to various natural language processing tasks. These graphs are usually incomplete, urging auto-completion of them. graph embedding approaches, e.g., TransE, learn structured knowledge via representing graph elements into dense embeddings. textual encoding approaches, e.g., KG-BERT, resort to graph triple's text and triple-level contextualized representations.
  arXiv  Detail & Related papers  (2020-04-30T13:50:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.