Abstract

Graph classification task plays a crucial role in many practical applications, for which the model is required to be capable of learning an accurate representation with discriminative characteristics, but existing methods typically fail to exploit the most authentic substructures for better representation. Aiming at this limitation, a fuzzy overlapping community guided subgraph neural network is proposed in this paper to make the best use of graph latent topologies for fine-grained representation learning and discriminative feature extraction, namely FS-GRAL. Taking multi-functional elements and their preferences fully into consideration, FS-GRAL allows the nodes to appear in more than one subgraph with different contributions for message passing, so that the model is powerful enough in capturing those natural aggregations inherent in complex networks to achieve accurate representation learning. Meanwhile, on the basis of learned accurate representations, a two-level pooling strategy dominated by intra-subgraph node discarding is presented for feature extraction, which enables graph latent topology can be integrated into extracted discriminative features, and thus the coarsened graph is more representative for graph classification. Extensive experiments on real-world benchmarks demonstrate that our fuzzy overlapping community guided subgraph neural network is highly competitive in learning the accurate graph representation and its intra-subgraph dominated two-level pooling strategy promotes a more promising classification performance.

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.