pith. machine review for the scientific record. sign in

arxiv: 1509.09292 · v2 · submitted 2015-09-30 · 💻 cs.LG · cs.NE· stat.ML

Recognition: unknown

Convolutional Networks on Graphs for Learning Molecular Fingerprints

Authors on Pith no claims yet
classification 💻 cs.LG cs.NEstat.ML
keywords graphsconvolutionalfingerprintslearningmolecularnetworksallowarbitrary
0
0 comments X
read the original abstract

We introduce a convolutional neural network that operates directly on graphs. These networks allow end-to-end learning of prediction pipelines whose inputs are graphs of arbitrary size and shape. The architecture we present generalizes standard molecular feature extraction methods based on circular fingerprints. We show that these data-driven features are more interpretable, and have better predictive performance on a variety of tasks.

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks

    cs.LG 2026-05 unverdicted novelty 7.0

    A Max-Cut-specific graph neural network predicts primal- and dual-feasible SDP solutions in linearithmic time, cutting bounding costs in exact branch-and-bound by up to 10.6 times versus a commercial SDP solver while ...