Structural Landmarking and Interaction Modelling: A "SLIM" Network for Graph Classification
Yaokang Zhu, Kai Zhang, Jun Wang, Haibin Ling, Jie Zhang, Hongyuan Zha
Abstract
Graph neural networks are a promising architecture for learning and inference with graph-structured data. Yet, how to generate informative, fixed-dimensional graph-level features for graphs with varying size and topology can still be challenging. Typically, this is achieved through graph-pooling, which summarizes a graph by compressing all its nodes into a single vector after convolutional operations. Is such a "collapsing-style" graph-pooling the only choice for graph classification? From complex system's point of view, properties of a complex system arise largely from the interaction among its components. Therefore, we speculate that preserving the interacting relation between parts, instead of pooling them together, could benefit system-level prediction. To verify this, we propose SLIM, a graph neural network model for Structural Landmarking and Interaction Modelling. The main idea is to compute a set of end-to-end optimizable sub-structure landmarks, so that any input graph can be projected onto these (spatially) local structural representatives for a faithful, global characterization. By doing this, explicit interaction between component parts of a graph can be leveraged directly in generating useful graphlevel representations despite significant topological variations. Encouraging results are observed on benchmark datasets for graph classification, demonstrating the value of interaction modelling in the design of graph neural networks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on3
- StructPool: Structured Graph Pooling via Conditional Random FieldsHao Yuan, Shuiwang JiICLR 2020 · 204 citations
- Rethinking pooling in graph neural networksDiego Mesquita, Amauri H. Souza Jr., Samuel KaskiNeurIPS 2020 · 147 citations
- Motif-Matching Based Subgraph-Level Attentional Convolutional Network for Graph ClassificationHao Peng, Jianxin Li, Qiran Gong, Yuanxing Ning et al.AAAI 2020 · 75 citations
Related papers
- Topological Pooling on GraphsYuzhou Chen, Yulia R. GelAAAI 2023 · 21 citations
- SSHPool: The Separated Subgraph-based Hierarchical PoolingZhuo Xu, Lu Bai, Lixin Cui, Ming Li et al.AAAI 2026 · 1 citation
- ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph RepresentationsEkagra Ranjan, Soumya Sanyal, Partha P. TalukdarAAAI 2020 · 400 citations
- AttPool: Towards Hierarchical Feature Representation in Graph Convolutional Networks via Attention MechanismJingjia Huang, Zhangheng Li, Nannan Li, Shan Liu et al.ICCV 2019 · 59 citations
- Graph Parsing NetworksYunchong Song, Siyuan Huang, Xinbing Wang, Chenghu Zhou et al.ICLR 2024 · 4 citations
