Extracting Higher Order Topological Semantic via Motif-Based Deep Graph Neural Networks

Graph neural networks (GNNs) are efficient techniques for learning graph representations and have shown remarkable success in tackling diverse graph-related tasks. However, in the context of the neighborhood aggregation paradigm, conventional GNNs have limited capabilities in capturing the higher order structures and topological semantics of graphs. Researchers have attempted to overcome this limitation by designing new GNNs that explore the impacts of motifs to capture potentially higher order graph information. However, existing motif-based GNNs often ignore lower order connectivity patterns such as nodes and edges, which leads to poor representation of sparse networks. To address these limitations, we propose an innovative approach. First, we design convolution kernels on both motif-based and simple graphs. Second, we introduce a multilevel graph convolution framework for extracting higher order topological semantics of graphs. Our approach overcomes the limitations of prior methods, demonstrating state-of-the-art performance in downstream tasks with excellent scalability. Extensive experiments on real-world datasets validate the effectiveness of our proposed method.

IEEE Transactions on Computational Social Systems