GI-GCN: Global Interacted Graph Convolutional Networks via Dominant Sets for Graph Classification

摘要

Graph Convolutional Networks (GCNs) are defined based on aggregating the node information of adjacent nodes, that are usually treated as equally important as each other, limiting the representational power of existing GCNs for graph classification. To address this shortcoming, we propose a novel Global Interacted Graph Convolutional Network (GI-GCN), that can leverage the solution vectors maintained during the iterative updates of the Dominant Set to adaptively characterize the global importance distribution of different nodes. Specifically, at each convolution layer, this distribution is adopted to adaptively modulate the importance weights of different node features before performing the local message passing. We show that this convolution strategy can effectively capture the highly correlated information between nonadjacent nodes through the Dominant Set algorithm, not only emphasizing the critical information at the graph level but also enhancing the discriminative power of graph representations. Furthermore, we optimize the spatial complexity of the framework, significantly reducing the memory overhead associated with the global interaction modeling. Experiments demonstrate the effectiveness of the proposed GI-GCN.