A deep graph convolutional neural network architecture for graph classification.
Graph Convolutional Networks (GCNs) are powerful deep learning methods for non-Euclidean structure data and achieve impressive performance in many fields. But most of the state-of-the-art GCN models are shallow structures with depths of no more than 3 to 4 layers, which greatly limits the ability of...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2023-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://doi.org/10.1371/journal.pone.0279604 |
| _version_ | 1797847182274985984 |
|---|---|
| author | Yuchen Zhou Hongtao Huo Zhiwen Hou Fanliang Bu |
| author_facet | Yuchen Zhou Hongtao Huo Zhiwen Hou Fanliang Bu |
| author_sort | Yuchen Zhou |
| collection | DOAJ |
| description | Graph Convolutional Networks (GCNs) are powerful deep learning methods for non-Euclidean structure data and achieve impressive performance in many fields. But most of the state-of-the-art GCN models are shallow structures with depths of no more than 3 to 4 layers, which greatly limits the ability of GCN models to extract high-level features of nodes. There are two main reasons for this: 1) Overlaying too many graph convolution layers will lead to the problem of over-smoothing. 2) Graph convolution is a kind of localized filter, which is easily affected by local properties. To solve the above problems, we first propose a novel general framework for graph neural networks called Non-local Message Passing (NLMP). Under this framework, very deep graph convolutional networks can be flexibly designed, and the over-smoothing phenomenon can be suppressed very effectively. Second, we propose a new spatial graph convolution layer to extract node multiscale high-level node features. Finally, we design an end-to-end Deep Graph Convolutional Neural Network II (DGCNNII) model for graph classification task, which is up to 32 layers deep. And the effectiveness of our proposed method is demonstrated by quantifying the graph smoothness of each layer and ablation studies. Experiments on benchmark graph classification datasets show that DGCNNII outperforms a large number of shallow graph neural network baseline methods. |
| first_indexed | 2024-04-09T18:08:13Z |
| format | Article |
| id | doaj.art-bae6b794a6bf4e49a31a7e4ea7f49b90 |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-04-09T18:08:13Z |
| publishDate | 2023-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-bae6b794a6bf4e49a31a7e4ea7f49b902023-04-14T05:31:28ZengPublic Library of Science (PLoS)PLoS ONE1932-62032023-01-01183e027960410.1371/journal.pone.0279604A deep graph convolutional neural network architecture for graph classification.Yuchen ZhouHongtao HuoZhiwen HouFanliang BuGraph Convolutional Networks (GCNs) are powerful deep learning methods for non-Euclidean structure data and achieve impressive performance in many fields. But most of the state-of-the-art GCN models are shallow structures with depths of no more than 3 to 4 layers, which greatly limits the ability of GCN models to extract high-level features of nodes. There are two main reasons for this: 1) Overlaying too many graph convolution layers will lead to the problem of over-smoothing. 2) Graph convolution is a kind of localized filter, which is easily affected by local properties. To solve the above problems, we first propose a novel general framework for graph neural networks called Non-local Message Passing (NLMP). Under this framework, very deep graph convolutional networks can be flexibly designed, and the over-smoothing phenomenon can be suppressed very effectively. Second, we propose a new spatial graph convolution layer to extract node multiscale high-level node features. Finally, we design an end-to-end Deep Graph Convolutional Neural Network II (DGCNNII) model for graph classification task, which is up to 32 layers deep. And the effectiveness of our proposed method is demonstrated by quantifying the graph smoothness of each layer and ablation studies. Experiments on benchmark graph classification datasets show that DGCNNII outperforms a large number of shallow graph neural network baseline methods.https://doi.org/10.1371/journal.pone.0279604 |
| spellingShingle | Yuchen Zhou Hongtao Huo Zhiwen Hou Fanliang Bu A deep graph convolutional neural network architecture for graph classification. PLoS ONE |
| title | A deep graph convolutional neural network architecture for graph classification. |
| title_full | A deep graph convolutional neural network architecture for graph classification. |
| title_fullStr | A deep graph convolutional neural network architecture for graph classification. |
| title_full_unstemmed | A deep graph convolutional neural network architecture for graph classification. |
| title_short | A deep graph convolutional neural network architecture for graph classification. |
| title_sort | deep graph convolutional neural network architecture for graph classification |
| url | https://doi.org/10.1371/journal.pone.0279604 |
| work_keys_str_mv | AT yuchenzhou adeepgraphconvolutionalneuralnetworkarchitectureforgraphclassification AT hongtaohuo adeepgraphconvolutionalneuralnetworkarchitectureforgraphclassification AT zhiwenhou adeepgraphconvolutionalneuralnetworkarchitectureforgraphclassification AT fanliangbu adeepgraphconvolutionalneuralnetworkarchitectureforgraphclassification AT yuchenzhou deepgraphconvolutionalneuralnetworkarchitectureforgraphclassification AT hongtaohuo deepgraphconvolutionalneuralnetworkarchitectureforgraphclassification AT zhiwenhou deepgraphconvolutionalneuralnetworkarchitectureforgraphclassification AT fanliangbu deepgraphconvolutionalneuralnetworkarchitectureforgraphclassification |