Abstract
As an important task of Graph Neural Networks (GNN), graph classification has received increasing attention, as it can be widely used in numerous fields, such as protein prediction and community prediction. The GNN models for graph classification usually require aggregating the structure and feature information of an input graph into a hidden representation vector. Such a technique can be generally referred as graph pooling, which intends to maximize the removal of noise while minimize the loss of important features. Therefore, there exists a trade-off between the noise reduction and information maximization that needs to be balanced for better performance. However, the existing pooling-based GNNs for graph classification depends on the manual setting of the graph-pooling degree, making it difficult to balance the trade-off. To this end, we propose a Feature Pyramid-based Graph Convolutional Neural network for Graph Classification (FPGCN-GC), which constructs multi-scale hierarchical information fusion to reduce information loss, and achieves an adaptive feature fusion through a learnable weighted residual connection and self-attention mechanism. The superior performance of the proposed method is verified on multiple graph classification datasets, thus illustrating the effectiveness and superiority of FPGCN-GC. In addition, we visualize FPGCN-GC by T-SNE to further analyze the underlying reason for its effectiveness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.