Pith. sign in

REVIEW 1 cited by

Inductive Knowledge Graph Reasoning for Multi-batch Emerging Entities

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 2208.10378 v3 pith:NEQOJCIB submitted 2022-08-22 cs.CL cs.AI

classification cs.CLcs.AI
keywords entitiesinductivereasoningknowledgeaggregationemergefactsgraph
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Over the years, reasoning over knowledge graphs (KGs), which aims to infer new conclusions from known facts, has mostly focused on static KGs. The unceasing growth of knowledge in real life raises the necessity to enable the inductive reasoning ability on expanding KGs. Existing inductive work assumes that new entities all emerge once in a batch, which oversimplifies the real scenario that new entities continually appear. This study dives into a more realistic and challenging setting where new entities emerge in multiple batches. We propose a walk-based inductive reasoning model to tackle the new setting. Specifically, a graph convolutional network with adaptive relation aggregation is designed to encode and update entities using their neighboring relations. To capture the varying neighbor importance, we employ a query-aware feedback attention mechanism during the aggregation. Furthermore, to alleviate the sparse link problem of new entities, we propose a link augmentation strategy to add trustworthy facts into KGs. We construct three new datasets for simulating this multi-batch emergence scenario. The experimental results show that our proposed model outperforms state-of-the-art embedding-based, walk-based and rule-based models on inductive KG reasoning.

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