Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs

• URL: http://arxiv.org/abs/2606.29860v3
• Date: Wed, 01 Jul 2026 02:01:59 GMT
• Title: Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs
• Abstract summary: We introduce a relation set completion task (RSC) and a relation set Embedding model (RelSetE)<n>RSC aims to reason about missing relations that are semantically compatible with a given entity.<n>RelSetE models latent patterns among the observed relations of entities to infer missing ones.
• Score: 48.16012222834734
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications. Due to their inherent incompleteness, knowledge graph completion (KGC) is widely studied and is typically formulated as triplet prediction, with link prediction as the dominant paradigm. However, this formulation focuses on the incompleteness of triplet-wise information and overlooks the incompleteness of entity-relation compatibility information. To address this limitation, we introduce a relation set completion task (RSC), which complements the link prediction task and aims to reason about missing relations that are semantically compatible with a given entity. We further propose a Relation Set Embedding model (RelSetE), which models latent patterns among the observed relations of entities to infer missing ones. To evaluate RelSetE, we derive three benchmark datasets from standard KG benchmarks. Extensive experiments demonstrate that RelSetE effectively captures entity-relation compatibility patterns and performs favorably in inferring missing relations of entities. Code and data are publicly available.

Related papers

• Knowledge Graph Completion with Relation-Aware Anchor Enhancement [50.50944396454757]
  We propose a relation-aware anchor enhanced knowledge graph completion method (RAA-KGC)<n>We first generate anchor entities within the relation-aware neighborhood of the head entity.<n>Then, by pulling the query embedding towards the neighborhoods of the anchors, it is tuned to be more discriminative for target entity matching.
  arXiv  Detail & Related papers  (2025-04-08T15:22:08Z)
• Efficient Relational Context Perception for Knowledge Graph Completion [25.903926643251076]
  Knowledge Graphs (KGs) provide a structured representation of knowledge but often suffer from challenges of incompleteness.<n>Previous knowledge graph embedding models are limited in their ability to capture expressive features.<n>We propose Triple Receptance Perception architecture to model sequential information, enabling the learning of dynamic context.
  arXiv  Detail & Related papers  (2024-12-31T11:25:58Z)
• A Contextualized BERT model for Knowledge Graph Completion [0.0]
  We introduce a contextualized BERT model for Knowledge Graph Completion (KGC)<n>Our model eliminates the need for entity descriptions and negative triplet sampling, reducing computational demands while improving performance.<n>Our model outperforms state-of-the-art methods on standard datasets, improving Hit@1 by 5.3% and 4.88% on FB15k-237 and WN18RR respectively.
  arXiv  Detail & Related papers  (2024-12-15T02:03:16Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• ExpressivE: A Spatio-Functional Embedding For Knowledge Graph Completion [78.8942067357231]
  ExpressivE embeds pairs of entities as points and relations as hyper-parallelograms in the virtual triple space. We show that ExpressivE is competitive with state-of-the-art KGEs and even significantly outperforms them on W18RR.
  arXiv  Detail & Related papers  (2022-06-08T23:34:39Z)
• Learning Relation-Specific Representations for Few-shot Knowledge Graph Completion [24.880078645503417]
  We propose a Relation-Specific Context Learning framework, which exploits graph contexts of triples to capture semantic information of relations and entities simultaneously. Experimental results on two public datasets demonstrate that RSCL outperforms state-of-the-art FKGC methods.
  arXiv  Detail & Related papers  (2022-03-22T11:45:48Z)
• Document-level Relation Extraction with Context Guided Mention Integration and Inter-pair Reasoning [18.374097786748834]
  Document-level Relation Extraction (DRE) aims to recognize the relations between two entities. Few previous studies have investigated the mention integration, which may be problematic. We propose two novel techniques, Context Guided Mention Integration and Inter-pair Reasoning.
  arXiv  Detail & Related papers  (2022-01-13T08:00:23Z)
• SAIS: Supervising and Augmenting Intermediate Steps for Document-Level Relation Extraction [51.27558374091491]
  We propose to explicitly teach the model to capture relevant contexts and entity types by supervising and augmenting intermediate steps (SAIS) for relation extraction. Based on a broad spectrum of carefully designed tasks, our proposed SAIS method not only extracts relations of better quality due to more effective supervision, but also retrieves the corresponding supporting evidence more accurately.
  arXiv  Detail & Related papers  (2021-09-24T17:37:35Z)
• Link Prediction on N-ary Relational Data Based on Relatedness Evaluation [61.61555159755858]
  We propose a method called NaLP to conduct link prediction on n-ary relational data. We represent each n-ary relational fact as a set of its role and role-value pairs. Experimental results validate the effectiveness and merits of the proposed methods.
  arXiv  Detail & Related papers  (2021-04-21T09:06:54Z)
• Document-Level Relation Extraction with Reconstruction [28.593318203728963]
  We propose a novel encoder-classifier-reconstructor model for document-level relation extraction (DocRE) The reconstructor reconstructs the ground-truth path dependencies from the graph representation, to ensure that the proposed DocRE model pays more attention to encode entity pairs with relationships in the training. Experimental results on a large-scale DocRE dataset show that the proposed model can significantly improve the accuracy of relation extraction on a strong heterogeneous graph-based baseline.
  arXiv  Detail & Related papers  (2020-12-21T14:29:31Z)
• Type-augmented Relation Prediction in Knowledge Graphs [65.88395564516115]
  We propose a type-augmented relation prediction (TaRP) method, where we apply both the type information and instance-level information for relation prediction. Our proposed TaRP method achieves significantly better performance than state-of-the-art methods on four benchmark datasets.
  arXiv  Detail & Related papers  (2020-09-16T21:14:18Z)

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.