.png){kind=icon}
返回
Molecular Graph Augmentation with Rings and Functional Groups
.png){kind=icon}
OA
AI
DOI：10.1021/ci9005035.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Molecular graphs are a compact representation of molecules but may be too concise to obtain optimal generalization performance from graph-based machine learning algorithms. Over centuries, chemists have learned what are the important functional groups in molecules. This knowledge is normally not manifest in molecular graphs. In this paper, we introduce a simple method to incorporate this type of background knowledge: we insert additional vertices with corresponding edges for each functional group and ring structure identified in the molecule. We present experimental evidence that, on a wide range of ligand-based tasks and data sets, the proposed augmentation method improves the predictive performance over several graph kernel-based quantitative structure activity relationship models. When the augmentation technique is used with the recent pairwise maximal common subgraphs kernel, we achieve a significant improvement over the current state-of-the-art on the NCI-60 cancer data set in 28 out of 60 cell lines, with the other 32 cell lines showing no significant difference in accuracy. Finally, on the Bursi mutagenicity data set, we obtain near-optimal predictions.
Keyword:
PREDICTIVE TOXICOLOGY CHALLENGE
SIMILARITY
CLASSIFICATION
DESCRIPTOR
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.3
论文数:
9.1K
被引数:
4.0W
机构
引用论文
Multihop Attention Networks for Question Answer Matching.png)
The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval
The 41st International ACM SIGIR Conference on Research & Development in Information RetrievalIF0
PREAI
分享收藏Influence Relevance Voting: An Accurate And Interpretable Virtual High Throughput Screening MethodOAAI
OAAI分享收藏分享收藏
查看更多内容