Molecular graph convolutions: moving beyond fingerprints

被引:990
作者
Kearnes, Steven [1 ]
McCloskey, Kevin [2 ]
Berndl, Marc [2 ]
Pande, Vijay [1 ]
Riley, Patrick [2 ]
机构
[1] Stanford Univ, 318 Campus Dr S296, Stanford, CA 94305 USA
[2] Google Inc, 1600 Amphitheatre Pkwy, Mountain View, CA 94043 USA
关键词
Machine learning; Virtual screening; Deep learning; Artificial neural networks; Molecular descriptors; NEURAL-NETWORK; SHAPE; RECOGNITION;
D O I
10.1007/s10822-016-9938-8
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph-atoms, bonds, distances, etc.-which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement.
引用
收藏
页码:595 / 608
页数:14
相关论文
共 42 条
[1]  
[Anonymous], OPENEYE GRAPHSIM TOO
[2]  
[Anonymous], 2009, MOL DESCRIPTORS CHEM
[3]  
[Anonymous], 2014, Rdkit: open-source cheminformatics
[4]  
[Anonymous], 2014, PROC 2 INT C LEARN R
[5]  
[Anonymous], 2015, 2015 IEEE INT C COMP, DOI DOI 10.1109/ICCVW.2015.112
[6]  
[Anonymous], 2015, ARXIV150202072
[7]  
Ballester PJ, 2007, J COMPUT CHEM, V28, P1711, DOI [10.1002/jcc.20681, 10.1002/JCC.20681]
[8]   ATOM PAIRS AS MOLECULAR-FEATURES IN STRUCTURE ACTIVITY STUDIES - DEFINITION AND APPLICATIONS [J].
CARHART, RE ;
SMITH, DH ;
VENKATARAGHAVAN, R .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1985, 25 (02) :64-73
[9]  
Dahl G, 2014, arXiv
[10]  
Dahl George., 2012, DEEP LEARNING DID IT