Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2106.15098

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2106.15098 (cs)
[Submitted on 29 Jun 2021 (v1) , last revised 17 Dec 2022 (this version, v4)]

Title: Molecule Generation by Principal Subgraph Mining and Assembling

Title: 通过主子图挖掘和组装生成分子

Authors:Xiangzhe Kong, Wenbing Huang, Zhixing Tan, Yang Liu
Abstract: Molecule generation is central to a variety of applications. Current attention has been paid to approaching the generation task as subgraph prediction and assembling. Nevertheless, these methods usually rely on hand-crafted or external subgraph construction, and the subgraph assembling depends solely on local arrangement. In this paper, we define a novel notion, principal subgraph, that is closely related to the informative pattern within molecules. Interestingly, our proposed merge-and-update subgraph extraction method can automatically discover frequent principal subgraphs from the dataset, while previous methods are incapable of. Moreover, we develop a two-step subgraph assembling strategy, which first predicts a set of subgraphs in a sequence-wise manner and then assembles all generated subgraphs globally as the final output molecule. Built upon graph variational auto-encoder, our model is demonstrated to be effective in terms of several evaluation metrics and efficiency, compared with state-of-the-art methods on distribution learning and (constrained) property optimization tasks.
Abstract: 分子生成是多种应用的核心。 当前的研究关注于将生成任务视为子图预测和组装。 然而,这些方法通常依赖于手工设计或外部的子图构建,且子图组装仅依赖于局部排列。 在本文中,我们定义了一个新的概念,主子图,它与分子内的信息模式密切相关。 有趣的是,我们提出的合并与更新子图提取方法可以从数据集中自动发现频繁的主子图,而之前的方法无法做到这一点。 此外,我们开发了一种两步的子图组装策略,首先按顺序预测一组子图,然后全局地组装所有生成的子图作为最终输出的分子。 基于图变分自编码器,我们的模型在多个评估指标和效率方面被证明是有效的,与在分布学习和(约束)属性优化任务上的最先进方法相比。
Comments: Accepted by NeurIPS 2022. Oral presentation
Subjects: Machine Learning (cs.LG) ; Quantitative Methods (q-bio.QM)
Cite as: arXiv:2106.15098 [cs.LG]
  (or arXiv:2106.15098v4 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2106.15098
arXiv-issued DOI via DataCite

Submission history

From: Xiangzhe Kong [view email]
[v1] Tue, 29 Jun 2021 05:26:18 UTC (795 KB)
[v2] Sun, 19 Dec 2021 07:59:46 UTC (769 KB)
[v3] Sat, 1 Oct 2022 02:56:19 UTC (799 KB)
[v4] Sat, 17 Dec 2022 13:44:00 UTC (800 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs
< prev   |   next >
new | recent | 2021-06
Change to browse by:
cs.LG
q-bio
q-bio.QM

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号