.png){kind=icon}
.png){kind=icon}
Return
A Multichannel Convolutional Decoding Network for Graph Classification
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2023.3266243.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph convolutional networks (GCNs) have shown superior performance on graph classification tasks, and their structure can be considered as an encoder-decoder pair. However, most existing methods lack the comprehensive consideration of global and local in decoding, resulting in the loss of global information or ignoring some local information of large graphs. And the commonly used cross-entropy loss is essentially an encoder-decoder global loss, which cannot supervise the training states of the two local components (encoder and decoder). We propose a multichannel convolutional decoding network (MCCD) to solve the above-mentioned problems. MCCD first adopts a multichannel GCN encoder, which has better generalization than a single-channel GCN encoder since different channels can extract graph information from different perspectives. Then, we propose a novel decoder with a global-to-local learning pattern to decode graph information, and this decoder can better extract global and local information. We also introduce a balanced regularization loss to supervise the training states of the encoder and decoder so that they are sufficiently trained. Experiments on standard datasets demonstrate the effectiveness of our MCCD in terms of accuracy, runtime, and computational complexity.
Keywords:
Decoding
Convolution
Task analysis
Convolutional neural networks
Data mining
Training
Computational complexity
Global-to-local
graph classification
graph convolutional network (GCN)
regularization
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W