Pith. sign in

REVIEW 3 cited by

Learning Graph-Level Representation for Drug Discovery

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 1709.03741 v2 pith:QFQODV6W submitted 2017-09-12 cs.LG stat.ML

classification cs.LGstat.ML
keywords graphdruggraph-levelrepresentationfeaturenetworkspredicationclassification
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Predicating macroscopic influences of drugs on human body, like efficacy and toxicity, is a central problem of small-molecule based drug discovery. Molecules can be represented as an undirected graph, and we can utilize graph convolution networks to predication molecular properties. However, graph convolutional networks and other graph neural networks all focus on learning node-level representation rather than graph-level representation. Previous works simply sum all feature vectors for all nodes in the graph to obtain the graph feature vector for drug predication. In this paper, we introduce a dummy super node that is connected with all nodes in the graph by a directed edge as the representation of the graph and modify the graph operation to help the dummy super node learn graph-level feature. Thus, we can handle graph-level classification and regression in the same way as node-level classification and regression. In addition, we apply focal loss to address class imbalance in drug datasets. The experiments on MoleculeNet show that our method can effectively improve the performance of molecular properties predication.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Investigating Graph Neural Networks and Classical Feature-Extraction Techniques in Activity-Cliff and Molecular Property Prediction

    cs.LG 2024-11 conditional novelty 6.0 of 10

    A systematic comparison shows ECFP fingerprints still beat GNNs at standard QSAR prediction, while GIN features and a new frequency-based fingerprint method (Sort & Slice) improve activity-cliff and property prediction.

  2. Sparse hierarchical representation learning on molecular graphs

    cs.LG 2019-08 conditional novelty 6.0 of 10

    The paper introduces two edge-feature-aware graph pooling layers and reports improved MoleculeNet benchmark results on three of four datasets and state-of-the-art results on HIV.

  3. Virtual Nodes Improve Long-term Traffic Prediction

    cs.LG 2025-01 conditional novelty 4.0 of 10

    Adding virtual nodes with a semi-adaptive adjacency matrix improves long-term traffic flow prediction accuracy over a standard STGCN baseline.

Pith tools