对角线的
计算机科学
基质(化学分析)
基础(线性代数)
数量结构-活动关系
人工神经网络
穆利肯种群分析
距离矩阵
节点(物理)
基准集
分子图
计算化学
化学
图形
理论计算机科学
密度泛函理论
人工智能
数学
算法
物理
机器学习
量子力学
几何学
色谱法
标识
DOI:10.1021/acs.jctc.5c00425
摘要
Here, molecular graphs derived from the one-electron density matrix are introduced within a more general effort to explore whether incorporating electronic structure awareness allows a single model to both better generalize from small data and better learn molecular encodings. Diagonal density matrix blocks serve as atomic node embeddings, while off-diagonal blocks provide embeddings for "link" nodes related to atomic pairs. In a minimal basis, these embeddings have dimensions of only 45 and 81, yet no information is lost and the original density matrix can be fully reconstructed. Blocks from the basis set overlap matrix are used as edge embeddings to encode structural information and as weights for message aggregation operations. Additionally, element-wise multiplication performed during aggregation may provide access to electronic charges, analogous to Mulliken population analysis. The proposed concept was evaluated using data from the First and Second Solubility Challenges (Llinàs et al. J.Chem. Inf. Model. 2008, 48, 1289-1303; Llinàs and Avdeef J. Chem. Inf. Model. 2019, 59, 3036-3040). A graph neural network (GNN) trained on sets of 94 and 1000 drug-like molecules achieved improved solubility prediction accuracy (RMSE 0.63, R2 0.79 in SC-1 and RMSE of 0.83 and 0.92, R2 of 0.57 and 0.79 on the "tight" and "loose" SC-2 test sets, respectively). If combined with existing techniques for predicting electron density from molecular structures, this approach is promising for addressing a range of chemical machine-learning problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI