Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference

• URL: http://arxiv.org/abs/2408.05136v1
• Date: Fri, 9 Aug 2024 15:45:41 GMT
• Title: Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference
• Authors: Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu,
• Abstract summary: Cycle-configuration (CC) descriptors can be used in the standard "two-layered (2L) model of mol-infer. Proposed descriptors capture the notion of ortho/meta/para patterns that appear in aromatic rings.
• Score: 6.170488239124818
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we propose a novel family of descriptors of chemical graphs, named cycle-configuration (CC), that can be used in the standard "two-layered (2L) model" of mol-infer, a molecular inference framework based on mixed integer linear programming (MILP) and machine learning (ML). Proposed descriptors capture the notion of ortho/meta/para patterns that appear in aromatic rings, which has been impossible in the framework so far. Computational experiments show that, when the new descriptors are supplied, we can construct prediction functions of similar or better performance for all of the 27 tested chemical properties. We also provide an MILP formulation that asks for a chemical graph with desired properties under the 2L model with CC descriptors (2L+CC model). We show that a chemical graph with up to 50 non-hydrogen vertices can be inferred in a practical time.

Related papers

• Pre-trained Molecular Language Models with Random Functional Group Masking [54.900360309677794]
  We propose a SMILES-based underlineem Molecular underlineem Language underlineem Model, which randomly masking SMILES subsequences corresponding to specific molecular atoms. This technique aims to compel the model to better infer molecular structures and properties, thus enhancing its predictive capabilities.
  arXiv  Detail & Related papers  (2024-11-03T01:56:15Z)
• Coarse-Grained Configurational Polymer Fingerprints for Property Prediction using Machine Learning [0.0]
  We present a method to generate a configurational level fingerprint for polymers using the Bead-Spring-Model. The proposed approach may be advantageous for the study of behavior resulting from large molecular weights.
  arXiv  Detail & Related papers  (2023-11-20T12:17:25Z)
• On the Equivalence of Graph Convolution and Mixup [70.0121263465133]
  This paper investigates the relationship between graph convolution and Mixup techniques. Under two mild conditions, graph convolution can be viewed as a specialized form of Mixup. We establish this equivalence mathematically by demonstrating that graph convolution networks (GCN) and simplified graph convolution (SGC) can be expressed as a form of Mixup.
  arXiv  Detail & Related papers  (2023-09-29T23:09:54Z)
• Atomic and Subgraph-aware Bilateral Aggregation for Molecular Representation Learning [57.670845619155195]
  We introduce a new model for molecular representation learning called the Atomic and Subgraph-aware Bilateral Aggregation (ASBA) ASBA addresses the limitations of previous atom-wise and subgraph-wise models by incorporating both types of information. Our method offers a more comprehensive way to learn representations for molecular property prediction and has broad potential in drug and material discovery applications.
  arXiv  Detail & Related papers  (2023-05-22T00:56:00Z)
• Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes [6.504869613326338]
  We propose a framework for designing the molecular structure of chemical compounds with a desired chemical property. The proposed framework infers a desired chemical graph by solving a mixed integer linear program (MILP) and a prediction function constructed by a machine learning method. The results of our computational experiments suggest that the proposed method improved the learning performance for several chemical properties to which a good prediction function has been difficult to construct.
  arXiv  Detail & Related papers  (2023-04-27T04:18:41Z)
• Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model [5.845754795753478]
  The framework infers a desired chemical graph by solving a mixed integer linear program (MILP) A set of graph theoretical descriptors in the feature function plays a key role to derive a compact formulation of such an MILP. The results of our computational experiments suggest that the proposed method can infer a chemical structure with up to 50 non-hydrogen atoms.
  arXiv  Detail & Related papers  (2022-09-13T08:27:25Z)
• Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search [6.519339570726759]
  In this paper, we propose a procedure for generating other feasible solutions of a mixed integer linear program. The results of our computational experiments suggest that the proposed method can generate an additional number of new chemical graphs with up to 50 non-hydrogen atoms.
  arXiv  Detail & Related papers  (2021-08-23T16:10:57Z)
• Structure-Enhanced Meta-Learning For Few-Shot Graph Classification [53.54066611743269]
  This work explores the potential of metric-based meta-learning for solving few-shot graph classification. An implementation upon GIN, named SMFGIN, is tested on two datasets, Chembl and TRIANGLES.
  arXiv  Detail & Related papers  (2021-03-05T09:03:03Z)
• Conditional Constrained Graph Variational Autoencoders for Molecule Design [70.59828655929194]
  We present Conditional Constrained Graph Variational Autoencoder (CCGVAE), a model that implements this key-idea in a state-of-the-art model. We show improved results on several evaluation metrics on two commonly adopted datasets for molecule generation.
  arXiv  Detail & Related papers  (2020-09-01T21:58:07Z)
• Retrosynthesis Prediction with Conditional Graph Logic Network [118.70437805407728]
  Computer-aided retrosynthesis is finding renewed interest from both chemistry and computer science communities. We propose a new approach to this task using the Conditional Graph Logic Network, a conditional graphical model built upon graph neural networks.
  arXiv  Detail & Related papers  (2020-01-06T05:36:57Z)

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.