Cited by 664Computational Drug Discovery MethodsMachine Learning in Materials ScienceGraph theory and applications

Could graph neural networks learn better molecular representation for drug discovery? A comparison study of descriptor-based and graph-based models

Open access
Jiang, Dejun, Wu, Zhenxing, Hsieh, Chang-Yu, Chen, Guangyong, Liao, Ben, Wang, Zhe, Shen, Chao, Cao, Dongsheng +2 more·2021·Journal of Cheminformatics

Published version of a preprint

Abstract

Graph neural networks (GNN) has been considered as an attractive modelling method for molecular property prediction, and numerous studies have shown that GNN could yield more promising results than traditional descriptor-based methods. In this study, based on 11 public datasets covering various property endpoints, the predictive capacity and computational efficiency of the prediction models developed by eight machine learning (ML) algorithms, including four descriptor-based models (SVM, XGBoost, RF and DNN) and four graph-based models (GCN, GAT, MPNN and Attentive FP), were extensively tested and compared. The results demonstrate that on average the descriptor-based models outperform the graph-based models in terms of prediction accuracy and computational efficiency. SVM generally achieves the best predictions for the regression tasks. Both RF and XGBoost can achieve reliable predictions for the classification tasks, and some of the graph-based models, such as Attentive FP and GCN, can yield outstanding performance for a fraction of larger or multi-task datasets. In terms of computational cost, XGBoost and RF are the two most efficient algorithms and only need a few seconds to train a model even for a large dataset. The model interpretations by the SHAP method can effectively explore the established domain knowledge for the descriptor-based models. Finally, we explored use of these models for virtual screening (VS) towards HIV and demonstrated that different ML algorithms offer diverse VS profiles. All in all, we believe that the off-the-shelf descriptor-based models still can be directly employed to accurately predict various chemical endpoints with excellent computability and interpretability.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1186/s13321-020-00479-8

Cites

70 of 70 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The development of ultra-large chemical libraries and generative chemistry methods, particularly those based on Generative Adversarial Networks (GANs), have significantly expanded the possibilities for hit generation and drug discovery.

    “The development of ultra-large chemical libraries (94) and generative chemistry methods, particularly those based on Generative Adversarial Networks (GANs), have significantly expanded the possibilities for hit generation and drug discovery.”

    From Artificial Intelligence for Drug Discovery: Are We There Yet? (2024) · cites this paper as [93]

    The Results and discussion section (page unavailable) says machine-learning models can search large chemical libraries for potential candidates and promote discovery. It does not establish that developing ultra-large libraries expanded hit generation, and the passages found do not address GAN-based generative chemistry. (LLM, conf=0.78)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. [26]Flam-Shepherd D, Wu T, Friederich P et al. Neural Message Passing on High Order Paths, arXiv preprint arXiv:2002.10413 · arXiv
  2. [28]Chen P, Liu W, Hsieh C-Y et al. Utilizing Edge Features in Graph Neural Networks via Variational Information Maximization, arXiv preprint arXiv:.05488 2019
  3. [30]Shang C, Liu Q, Chen K-S et al. Edge attention-based multi-relational graph convolutional networks, arXiv preprint arXiv:.04944 2018
  4. [31]Li J, Cai D, He X. Learning graph-level representation for drug discovery, arXiv preprint arXiv:.03741 2017
  5. [56]Veličković P, Cucurull G, Casanova A et al. Graph attention networks, arXiv preprint arXiv:1710.10903. 2017. · arXiv

Cited by

Sorted by citations

Authors
Jiang, D., Wu, Z., Hsieh, C.-Y., Chen, G., Liao, B., Wang, Z., Shen, C., Cao, D., Wu, J., & Hou, T.
Affiliations
  • Zhejiang University (CN)
  • Tencent (China) (CN)
  • Shenzhen Institutes of Advanced Technology (CN)
  • Central South University (CN)
Corresponding author
  • Cao, Dongsheng
  • Wu, Jian
  • Hou, Tingjun
Venue
Journal of Cheminformatics
Published
2021-02-17
Volume
13
Issue
1
Pages
12-12
ISSN
1758-2946 (ISSN-L)
OpenAlex
W3116202926
Cited by
664
References
70
Citations by year
2026: 108 · 2025: 141 · 2024: 163 · 2023: 117 · 2022: 94 · 2021: 40 · 2020: 1
FWCI
54.18
Type
journal article
Language
en
Open access
Locations
  • Journal of Cheminformatics (publishedVersion, cc-by)
  • Research Square (acceptedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • Key R&D Program of Zhejiang Province (2020C03010)
  • National Natural Science Foundation of China (21575128, 81773632)
  • Natural Science Foundation of Zhejiang Province (LZ19H300001)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
  • Physical Sciences › Materials Science › Materials Chemistry › Machine Learning in Materials Science
  • Physical Sciences › Mathematics › Geometry and Topology › Graph theory and applications
Keywords
graph neural networks, molecular descriptors, molecular property prediction, drug discovery, virtual screening, HIV, SHAP, computational efficiency, GCN, GAT, SVM, XGBoost, random forest

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review