Evidence map›Paper›PMID 32321421›Full record

ArticleBMC bioinformatics2020

Dual graph convolutional neural network for predicting chemical networks.

Shonosuke Harada, Hirotaka Akita, Masashi Tsubaki, Yukino Baba, Ichigaku Takigawa, Yoshihiro Yamanishi, Hisashi Kashima

Abstract read
In one paragraph

Article in BMC bioinformatics, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 15 papers.

0numbers the graph read from it
0cells of the map it votes in
15citing 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

15 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
  4. Article
  5. Article
  6. Article
  7. AcneGrader: An ensemble pruning of the deep learning base models to grade acne.Skin research and technology : official journal of International Society for Bioengineering and the Skin (ISBS) [and] International Society for Digital Imaging of Skin (ISDIS) [and] International Society for Skin Imaging (ISSI) · 2022
    Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Graph convolutional networks: a comprehensive review.Computational social networks · 2019
    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

7 authors.

Shonosuke HaradaKyoto University, Kyoto, 6068501, Japan. sh1108@ml.ist.i.kyoto-u.ac.jp.
Hirotaka AkitaPreferred Networks, Tokyo, 1000004, Japan.
Masashi TsubakiNational Institute of Advanced Industrial Science and Technology, Tokyo, 1350064, Japan.
Yukino BabaTsukuba University, Ibaraki, 3058577, Japan.
Ichigaku TakigawaHokkaido University, Hokkaido, 0600808, Japan.
Yoshihiro YamanishiKyushu Institute of Technology, Fukuoka, 8208502, Japan.
Hisashi KashimaKyoto University, Kyoto, 6068501, Japan.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundPredicting of chemical compounds is one of the fundamental tasks in bioinformatics and chemoinformatics, because it contributes to various applications in metabolic engineering and drug discovery. The recent rapid growth of the amount of available data has enabled applications of computational approaches such as statistical modeling and machine learning method. Both a set of chemical interactions and chemical compound structures are represented as graphs, and various graph-based approaches including graph convolutional neural networks have been successfully applied to chemical network prediction. However, there was no efficient method that can consider the two different types of graphs in an end-to-end manner.

resultsWe give a new formulation of the chemical network prediction problem as a link prediction problem in a graph of graphs (GoG) which can represent the hierarchical structure consisting of compound graphs and an inter-compound graph. We propose a new graph convolutional neural network architecture called dual graph convolutional network that learns compound representations from both the compound graphs and the inter-compound network in an end-to-end manner.

conclusionsExperiments using four chemical networks with different sparsity levels and degree distributions shows that our dual graph convolution approach achieves high prediction performance in relatively dense networks, while the performance becomes inferior on extremely-sparse networks.

Indexed as

Computer GraphicsModels, ChemicalNeural Networks, ComputerComputational BiologyDrug DiscoveryChemical network predictionGraph convolutional neural networkGraph of graphs

Identifiers

PMID32321421
PMCPMC7178944

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.