Gapformer: Graph Transformer with Graph Pooling for Node Classification

Graph Transformers (GTs) have proved their advantage in graph-level tasks. However, existing GTs still perform unsatisfactorily on the node classification task due to 1) the overwhelming unrelated information obtained from a vast number of irrelevant distant nodes and 2) the quadratic complexity regarding the number of nodes via the fully connected attention mechanism. In this paper, we present Gapformer, a method for node classification that deeply incorporates Graph Transformer with Graph Pooling. More specifically, Gapformer coarsens the large-scale nodes of a graph into a smaller number of pooling nodes via local or global graph pooling methods, and then computes the attention solely with the pooling nodes rather than all other nodes. In such a manner, the negative influence of the overwhelming unrelated nodes is mitigated while maintaining the long-range information, and the quadratic complexity is reduced to linear complexity with respect to the fixed number of pooling nodes. Extensive experiments on 13 node classification datasets, including homophilic and heterophilic graph datasets, demonstrate the competitive performance of Gapformer over existing Graph Neural Networks and GTs.

Authors

• Chuang Liu Beihang University
• Yibing Zhan JD Explore Academy, Beijing, China
• Xueqi Ma
• Liang Ding The University of Sydney
• Dapeng Tao Yunnan University, Kunming, China
• Jia Wu
• Wenbin Hu

Keywords

• Data Mining: DM: Mining graphs
• Data Mining: DM: Networks