Pith. sign in

REVIEW 2 cited by

Few-shot link prediction via graph neural networks for Covid-19 drug-repurposing

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 2007.10261 v1 pith:STDPXNQ4 submitted 2020-07-20 cs.LG stat.ML

Few-shot link prediction via graph neural networks for Covid-19 drug-repurposing

classification cs.LG stat.ML
keywords graphlearningfew-shotlinkdrugdrugsinductiveprediction
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Predicting interactions among heterogenous graph structured data has numerous applications such as knowledge graph completion, recommendation systems and drug discovery. Often times, the links to be predicted belong to rare types such as the case in repurposing drugs for novel diseases. This motivates the task of few-shot link prediction. Typically, GCNs are ill-equipped in learning such rare link types since the relation embedding is not learned in an inductive fashion. This paper proposes an inductive RGCN for learning informative relation embeddings even in the few-shot learning regime. The proposed inductive model significantly outperforms the RGCN and state-of-the-art KGE models in few-shot learning tasks. Furthermore, we apply our method on the drug-repurposing knowledge graph (DRKG) for discovering drugs for Covid-19. We pose the drug discovery task as link prediction and learn embeddings for the biological entities that partake in the DRKG. Our initial results corroborate that several drugs used in clinical trials were identified as possible drug candidates. The method in this paper are implemented using the efficient deep graph learning (DGL)

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Beyond Homophily: Towards Generalized Graph Reconstruction Attack and Defense

    cs.LG 2026-06 unverdicted novelty 6.0

    Proposes MC-GRA attack and MC-GPB defense for graph reconstruction from GNNs via Markov chain approximation of topology-dependent representations, showing improved attack fidelity and reduced leakage with minor accuracy cost.

  2. OptimusKG: Unifying biomedical knowledge in a modern multimodal graph

    cs.AI 2026-04 accept novelty 5.0

    OptimusKG is a labeled property graph unifying biomedical knowledge from structured sources into 190,531 nodes of 10 types and 21.8 million edges of 26 types, with 70% of sampled edges supported by literature evidence...