TL;DR
ReCDAP introduces a relation-based conditional diffusion model with attention pooling to improve few-shot knowledge graph completion by effectively leveraging positive and negative triples.
Contribution
It proposes a novel diffusion approach that separately models positive and negative relations using attention pooling, advancing few-shot KG completion methods.
Findings
Outperforms existing methods on benchmark datasets
Achieves state-of-the-art performance in few-shot KG completion
Effectively leverages negative triples through diffusion modeling
Abstract
Knowledge Graphs (KGs), composed of triples in the form of (head, relation, tail) and consisting of entities and relations, play a key role in information retrieval systems such as question answering, entity search, and recommendation. In real-world KGs, although many entities exist, the relations exhibit a long-tail distribution, which can hinder information retrieval performance. Previous few-shot knowledge graph completion studies focused exclusively on the positive triple information that exists in the graph or, when negative triples were incorporated, used them merely as a signal to indicate incorrect triples. To overcome this limitation, we propose Relation-Based Conditional Diffusion with Attention Pooling (ReCDAP). First, negative triples are generated by randomly replacing the tail entity in the support set. By conditionally incorporating positive information in the KG and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSoftmax · Attention Is All You Need · Attention Pooling · Diffusion
