A graph convolution network with subgraph embedding for mutagenic prediction in aromatic hydrocarbons
- Authors
- Moon, Hyung-Jun; Bu, Seok-Jun; Cho, Sung-Bae
- Issue Date
- Apr-2023
- Publisher
- Elsevier BV
- Keywords
- Mutagenic prediction; Deep learning; Graph convolution network; Graph partitioning algorithm
- Citation
- Neurocomputing, v.530, pp 60 - 68
- Pages
- 9
- Indexed
- SCIE
SCOPUS
- Journal Title
- Neurocomputing
- Volume
- 530
- Start Page
- 60
- End Page
- 68
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/73643
- DOI
- 10.1016/j.neucom.2023.01.091
- ISSN
- 0925-2312
1872-8286
- Abstract
- An aromatic hydrocarbon refers to an organic material having a carbon ring such as benzene and a func-tional group in the carbon ring. As the industry develops, natural pollution becomes harsh, new com-pounds emerge, and the exposure to aromatic hydrocarbons is continuously increasing. Predicting mutagenicity is one of the crucial issues in reducing the risk because these organisms may have proper-ties that penetrate the DNA of living things to cause mutations. Recently, the accuracy of mutation pre-diction has improved due to the power of deep learning. However, most conventional methods do not consider the characteristics of molecular aromatic hydrocarbons, which dilutes local information and results in a severe deterioration of the prediction performance. In this paper, we propose a method of exploiting subgraph convolution neural networks that enables the extraction of local information of a graph by partitioning it to maintain the detailed information. For extracting the features of molecules, we use the Girvan Newman algorithm to partition the graph according to the carbon ring and functional group and obtain the embedding vectors of the subgraphs as well as the original graph with graph con-volution network (GCN). The embedding vectors are combined to represent the whole graph information and predict mutagenicity. Experiments with MUTAG, NCI1 and NCI109, datasets for predicting muta -genicity of molecules in graph structure, confirm that we successfully segment carbon rings and func-tional groups from molecular graphs and predict mutations using the partitioned graphs, leading to a 2 %p performance improvement. In addition, the proposed method has prevented about 15 %p of infor-mation dilution in GCN, and an analysis of the latent space of graphs reveals that the subgraphs extracted maintain the local information appropriately.(c) 2023 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.