Abstract

Graph neural networks (GNNs) have shown powerful capabilities in modeling and representing graph structural data across various graph learning tasks as an emerging deep learning approach. However, most existing GNNs focus on single-relational graphs and fail to fully utilize the rich and diverse relational information present in real-world graph data. In addition, deeper GNNs tend to suffer from overfitting and oversmoothing issues, leading to degraded model performance. To deeply excavate the multi-relational features in graph data and strengthen the modeling and representation abilities of GNNs, this paper proposes a multi-channel deep graph convolutional neural network method called DeepMCGCN. It constructs multiple relational subgraphs and adopts multiple GCN channels to learn the characteristics of different relational subgraphs separately. Cross-channel connections are utilized to obtain interactions between different relational subgraphs, which can learn node embeddings richer and more discriminative than single-channel GNNs. Meanwhile, it alleviates overfitting issues of deep models by optimizing convolution functions and adding residual connections between and within channels. The DeepMCGCN method is evaluated on three real-world datasets, and the experimental results show that its node classification performance outperforms that of single-channel GCN and other benchmark models, which improves the modeling and representation capabilities of the model.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.