Papers › GCN-BMP: Investigating Graph Representation Learning for DDI Prediction Task

GCN-BMP: Investigating Graph Representation Learning for DDI Prediction Task

1 Jul 2020Methods 2020 7archive 2025-07-28

Xin Chen, Xien Liu, Ji Wu

One drug's pharmacological activity may be changed unexpectedly, owing to the concurrent administration of another drug. It is likely to cause unexpected drug-drug interactions (DDIs). Several machine learning approaches have been proposed to predict the occurrence of DDIs. However, existing approaches are almost dependent heavily on various drug-related features, which may incur noisy inductive bias. To alleviate this problem, we investigate the utilization of the end-to-end graph representation learning for the DDI prediction task. We establish a novel DDI prediction method named GCN-BMP (Graph Convolutional Network with Bond-aware Message Propagation) to conduct an accurate prediction for DDIs. Our experiments on two real-world datasets demonstrate that GCN-BMP can achieve higher performance compared to various baseline approaches. Moreover, in the light of the self-contained attention mechanism in our GCN-BMP, we could find the most vital local atoms that conform to domain knowledge with certain interpretability.

PaperPDFCode

Syntology This paper has no arXiv id in the archive, and this site joins papers to Syntology's graph by arXiv id, so this page does not say whether the graph holds it.

Code

AstraZeneca/chemicalx pytorchApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to ChemicalX: A Deep Learning Library for Drug Pair Scoring (arXiv:2202.05240; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Graph Representation LearningInductive BiasPredictionRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections