Pith. sign in

REVIEW 1 cited by

Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2103.03642 v1 pith:XKQRQOQJ submitted 2021-03-05 cs.LG cs.CL

classification cs.LGcs.CL
keywords inductiverelationscorrelationsgraphsknowledgelinkpredictionexisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Inductive link prediction -- where entities during training and inference stages can be different -- has been shown to be promising for completing continuously evolving knowledge graphs. Existing models of inductive reasoning mainly focus on predicting missing links by learning logical rules. However, many existing approaches do not take into account semantic correlations between relations, which are commonly seen in real-world knowledge graphs. To address this challenge, we propose a novel inductive reasoning approach, namely TACT, which can effectively exploit Topology-Aware CorrelaTions between relations in an entity-independent manner. TACT is inspired by the observation that the semantic correlation between two relations is highly correlated to their topological structure in knowledge graphs. Specifically, we categorize all relation pairs into several topological patterns, and then propose a Relational Correlation Network (RCN) to learn the importance of the different patterns for inductive link prediction. Experiments demonstrate that TACT can effectively model semantic correlations between relations, and significantly outperforms existing state-of-the-art methods on benchmark datasets for the inductive link prediction task.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Beyond Completion: A Foundation Model for General Knowledge Graph Reasoning

    cs.CL 2025-05 conditional novelty 6.0 of 10

    MERRY integrates graph structure and entity/relation text via multi-perspective message passing, improving zero-shot knowledge graph completion and question answering over strong baselines.

Pith tools