(477j) Adaptive Spectral Graph Convolutional Neural Network in Crystal Property Prediction
AIChE Annual Meeting
2020
2020 Virtual AIChE Annual Meeting
Topical Conference: Applications of Data Science to Molecules and Materials
Innovations in Methods of Data Science
Wednesday, November 18, 2020 - 9:45am to 10:00am
First a crystal graph is produced base on the cif file of the crystal similar to CGCNN, and each node is encoded with its atomic properties such as electronegativity, covalent radius, etc. The connectivity is determined based on the distance between each atom. The graph Laplacian L is then obtained by performing graph Fourier transformation on the crystal graph. The transformation process can be decomposed by a complete set of eigenvectors U and the eigenvalue matrix LAMBDA(λ), which represents the topology of the graph. The spectral filter gθ(λ) generates a customized convolution kernel on the graph in space which can be formulated by
gθ(λ)=(sum from k=0 to k=k-1)âθkλk
Where k can be interpreted as the number of convolutions in space.
However, this graph convolution cannot exploit the topological property of the graph. It is possible that the disconnected nodes have larger correlation than those connected nodes. To achieve the capability to learn from the geometric structure, we adapted a new spectral filter from Li et.al1 which takes a non Euclean metric so that it learns a residual graph apart from the intrinsic crystal graph which makes a correction on the original graph Laplacian L:
L(with hat) = L + αLres
The overall intrinsic plus residue graph is trained with the spectral graph convoluted neural network to predict chemical properties of crystal and results are compared with various existing models.
[1] Li, R., Wang, S., Zhu, F. and Huang, J., 2018, April. Adaptive graph convolutional neural networks. In Thirty-second AAAI conference on artificial intelligence.