Benchmarking Toxic Molecule Classification using Graph Neural Networks and Few Shot Learning

• URL: http://arxiv.org/abs/2311.13490v1
• Date: Wed, 22 Nov 2023 16:07:32 GMT
• Title: Benchmarking Toxic Molecule Classification using Graph Neural Networks and Few Shot Learning
• Authors: Bhavya Mehta, Kush Kothari, Reshmika Nambiar, Seema Shrawne
• Abstract summary: Traditional Graph Convolutional Networks (GCNs) face challenges with limited data and class imbalance. We harness the power of Graph Isomorphic Networks, Multi Headed Attention and Free Large-scale Adversarial Augmentation separately on Graphs. We incorporate Few-Shot Learning to improve the model's generalization with limited annotated samples.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Traditional methods like Graph Convolutional Networks (GCNs) face challenges with limited data and class imbalance, leading to suboptimal performance in graph classification tasks during toxicity prediction of molecules as a whole. To address these issues, we harness the power of Graph Isomorphic Networks, Multi Headed Attention and Free Large-scale Adversarial Augmentation separately on Graphs for precisely capturing the structural data of molecules and their toxicological properties. Additionally, we incorporate Few-Shot Learning to improve the model's generalization with limited annotated samples. Extensive experiments on a diverse toxicology dataset demonstrate that our method achieves an impressive state-of-art AUC-ROC value of 0.816, surpassing the baseline GCN model by 11.4%. This highlights the significance of our proposed methodology and Few Shot Learning in advancing Toxic Molecular Classification, with the potential to enhance drug discovery and environmental risk assessment processes.

Related papers

• Adversarial Curriculum Graph-Free Knowledge Distillation for Graph Neural Networks [61.608453110751206]
  We propose a fast and high-quality data-free knowledge distillation approach for graph neural networks. The proposed graph-free KD method (ACGKD) significantly reduces the spatial complexity of pseudo-graphs. ACGKD eliminates the dimensional ambiguity between the student and teacher models by increasing the student's dimensions.
  arXiv  Detail & Related papers  (2025-04-01T08:44:27Z)
• MolGraph-xLSTM: A graph-based dual-level xLSTM framework with multi-head mixture-of-experts for enhanced molecular representation and interpretability [9.858315463084084]
  MolGraph-xLSTM is a graph-based xLSTM model that enhances feature extraction and effectively models molecule long-range interactions. Our approach processes molecular graphs at two scales: atom-level and motif-level. We validate MolGraph-xLSTM on 10 molecular property prediction datasets, covering both classification and regression tasks.
  arXiv  Detail & Related papers  (2025-01-30T15:47:59Z)
• Contrastive Dual-Interaction Graph Neural Network for Molecular Property Prediction [0.0]
  We introduce DIG-Mol, a novel self-supervised graph neural network framework for molecular property prediction. DIG-Mol integrates a momentum distillation network with two interconnected networks to efficiently improve molecular characterization. We have established DIG-Mol's state-of-the-art performance through extensive experimental evaluation in a variety of molecular property prediction tasks.
  arXiv  Detail & Related papers  (2024-05-04T10:09:27Z)
• Semi-Supervised Graph Representation Learning with Human-centric Explanation for Predicting Fatty Liver Disease [2.992602379681373]
  This study explores the potential of graph representation learning within a semi-supervised learning framework. Our approach constructs a subject similarity graph to identify risk patterns from health checkup data.
  arXiv  Detail & Related papers  (2024-03-05T08:59:45Z)
• Bi-level Contrastive Learning for Knowledge-Enhanced Molecule Representations [55.42602325017405]
  We propose a novel method called GODE, which takes into account the two-level structure of individual molecules. By pre-training two graph neural networks (GNNs) on different graph structures, combined with contrastive learning, GODE fuses molecular structures with their corresponding knowledge graph substructures. When fine-tuned across 11 chemical property tasks, our model outperforms existing benchmarks, registering an average ROC-AUC uplift of 13.8% for classification tasks and an average RMSE/MAE enhancement of 35.1% for regression tasks.
  arXiv  Detail & Related papers  (2023-06-02T15:49:45Z)
• Dynamic Graph Enhanced Contrastive Learning for Chest X-ray Report Generation [92.73584302508907]
  We propose a knowledge graph with Dynamic structure and nodes to facilitate medical report generation with Contrastive Learning. In detail, the fundamental structure of our graph is pre-constructed from general knowledge. Each image feature is integrated with its very own updated graph before being fed into the decoder module for report generation.
  arXiv  Detail & Related papers  (2023-03-18T03:53:43Z)
• HiGNN: Hierarchical Informative Graph Neural Networks for Molecular Property Prediction Equipped with Feature-Wise Attention [5.735627221409312]
  We propose a well-designed hierarchical informative graph neural networks framework (termed HiGNN) for predicting molecular property. Experiments demonstrate that HiGNN achieves state-of-the-art predictive performance on many challenging drug discovery-associated benchmark datasets.
  arXiv  Detail & Related papers  (2022-08-30T05:16:15Z)
• Attention-wise masked graph contrastive learning for predicting molecular property [15.387677968070912]
  We proposed a self-supervised representation learning framework for large-scale unlabeled molecules. We developed a novel molecular graph augmentation strategy, referred to as attention-wise graph mask. Our model can capture important molecular structure and higher-order semantic information.
  arXiv  Detail & Related papers  (2022-05-02T00:28:02Z)
• Hierarchical Graph Representation Learning for the Prediction of Drug-Target Binding Affinity [7.023929372010717]
  We propose a novel hierarchical graph representation learning model for the drug-target binding affinity prediction, namely HGRL-DTA. In this paper, we adopt a message broadcasting mechanism to integrate the hierarchical representations learned from the global-level affinity graph and the local-level molecular graph. Besides, we design a similarity-based embedding map to solve the cold start problem of inferring representations for unseen drugs and targets.
  arXiv  Detail & Related papers  (2022-03-22T04:50:16Z)
• Weakly-supervised Graph Meta-learning for Few-shot Node Classification [53.36828125138149]
  We propose a new graph meta-learning framework -- Graph Hallucination Networks (Meta-GHN) Based on a new robustness-enhanced episodic training, Meta-GHN is meta-learned to hallucinate clean node representations from weakly-labeled data. Extensive experiments demonstrate the superiority of Meta-GHN over existing graph meta-learning studies.
  arXiv  Detail & Related papers  (2021-06-12T22:22:10Z)
• Deep Learning for Virtual Screening: Five Reasons to Use ROC Cost Functions [80.12620331438052]
  deep learning has become an important tool for rapid screening of billions of molecules in silico for potential hits containing desired chemical features. Despite its importance, substantial challenges persist in training these models, such as severe class imbalance, high decision thresholds, and lack of ground truth labels in some datasets. We argue in favor of directly optimizing the receiver operating characteristic (ROC) in such cases, due to its robustness to class imbalance.
  arXiv  Detail & Related papers  (2020-06-25T08:46:37Z)
• Finding Patient Zero: Learning Contagion Source with Graph Neural Networks [67.3415507211942]
  Locating the source of an epidemic can provide critical insights into the infection's transmission course. Existing methods use graph-theoretic measures and expensive message-passing algorithms. We revisit this problem using graph neural networks (GNNs) to learn P0.
  arXiv  Detail & Related papers  (2020-06-21T21:12:44Z)
• Self-Supervised Graph Transformer on Large-Scale Molecular Data [73.3448373618865]
  We propose a novel framework, GROVER, for molecular representation learning. GROVER can learn rich structural and semantic information of molecules from enormous unlabelled molecular data. We pre-train GROVER with 100 million parameters on 10 million unlabelled molecules -- the biggest GNN and the largest training dataset in molecular representation learning.
  arXiv  Detail & Related papers  (2020-06-18T08:37:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.