Evidence map›Paper›PMID 35571558›Full record

ArticleKDD : proceedings. International Conference on Knowledge Discovery & Data Mining2021

MoCL: Data-driven Molecular Fingerprint via Knowledge-aware Contrastive Learning from Molecular Graph.

Mengying Sun, Jing Xing, Huijun Wang, Bin Chen, Jiayu Zhou

Abstract read
In one paragraph

Article in KDD : proceedings. International Conference on Knowledge Discovery & Data Mining, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 30 papers.

0numbers the graph read from it
0cells of the map it votes in
30citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

30 citing papers in PubMed.

  1. Review
  2. Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Review
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Retrieval Augmented Docking Using Hierarchical Navigable Small Worlds.Journal of chemical information and modeling · 2024
    Article
  18. Exploring Novel Fentanyl Analogues Using a Graph-Based Transformer Model.Interdisciplinary sciences, computational life sciences · 2024
    Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Mengying SunMichigan State University, East Lansing, Michigan, USA.
Jing XingMichigan State University, Grand Rapids, Michigan, USA.
Huijun WangAgios Pharmaceuticals, Cambridge, Massachusetts, USA.
Bin ChenMichigan State University, Grand Rapids, Michigan, USA.
Jiayu ZhouMichigan State University, East Lansing, Michigan, USA.

Funding

Identification of Mild Cognitive Impairment using Machine Learning from Language and Behavior MarkersRF1AG072449 · NIA · MICHIGAN STATE UNIVERSITY · PI DODGE, HIROKO HAYAMA, WANG, FEI · 2021 to 2023
$2.6M
Repurpose open data to discover therapeutics for understudied diseasesR01GM134307 · NIGMS · MICHIGAN STATE UNIVERSITY · PI CHEN, BIN · 2019 to 2023
$2.5M
Integrating transcriptomic, proteomic and pharmacogenomic data to inform individualized therapy in cancersK01ES028047 · NIEHS · UNIVERSITY OF CALIFORNIA, SAN FRANCISCO · PI CHEN, BIN · 2017 to 2020
$682k
NIA NIH HHS RF1 AG072449NIEHS NIH HHS K01 ES028047NIGMS NIH HHS R01 GM134307
6 · The paper itself

Abstract

Recent years have seen a rapid growth of utilizing graph neural networks (GNNs) in the biomedical domain for tackling drug-related problems. However, like any other deep architectures, GNNs are data hungry. While requiring labels in real world is often expensive, pretraining GNNs in an unsupervised manner has been actively explored. Among them, graph contrastive learning, by maximizing the mutual information between paired graph augmentations, has been shown to be effective on various downstream tasks. However, the current graph contrastive learning framework has two limitations. First, the augmentations are designed for general graphs and thus may not be suitable or powerful enough for certain domains. Second, the contrastive scheme only learns representations that are invariant to local perturbations and thus does not consider the global structure of the dataset, which may also be useful for downstream tasks. In this paper, we study graph contrastive learning designed specifically for the biomedical domain, where molecular graphs are present. We propose a novel framework called MoCL, which utilizes domain knowledge at both local- and global-level to assist representation learning. The local-level domain knowledge guides the augmentation process such that variation is introduced without changing graph semantics. The global-level knowledge encodes the similarity information between graphs in the entire dataset and helps to learn representations with richer semantics. The entire model is learned through a double contrast objective. We evaluate MoCL on various molecular datasets under both linear and semi-supervised settings and results show that MoCL achieves state-of-the-art performance.

Indexed as

Contrastive LearningDomain knowledgeMolecular Graph

Identifiers

PMID35571558
PMCPMC9105980

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.