Papers › Graph Convolutional Networks with EigenPooling

Graph Convolutional Networks with EigenPooling

30 Apr 2019arXiv:1904.13107archive 2025-07-28

Yao Ma, Suhang Wang, Charu C. Aggarwal, Jiliang Tang

Graph neural networks, which generalize deep neural network models to graph structured data, have attracted increasing attention in recent years. They usually learn node representations by transforming, propagating and aggregating node features and have been proven to improve the performance of many graph related tasks such as node classification and link prediction. To apply graph neural networks for the graph classification task, approaches to generate the \textit{graph representation} from node representations are demanded. A common way is to globally combine the node representations. However, rich structural information is overlooked. Thus a hierarchical pooling procedure is desired to preserve the graph structure during the graph representation learning. There are some recent works on hierarchically learning graph representation analogous to the pooling step in conventional convolutional neural (CNN) networks. However, the local structural information is still largely neglected during the pooling process. In this paper, we introduce a pooling operator $\pooling$ based on graph Fourier transform, which can utilize the node features and local structures during the pooling process. We then design pooling layers based on the pooling operator, which are further combined with traditional GCN convolutional layers to form a graph neural network framework $\m$ for graph classification. Theoretical analysis is provided to understand $\pooling$ from both local and global perspectives. Experimental results of the graph classification task on $6$ commonly used benchmarks demonstrate the effectiveness of the proposed framework.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

alge24/eigenpooling mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

ClassificationGeneral ClassificationGraph ClassificationGraph Neural NetworkGraph Representation LearningLink PredictionNode ClassificationRepresentation Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification D&D EigenGCN-3 Accuracy 78.6% #26 of 53 Archive leaderboard report
Graph Classification ENZYMES EigenGCN-3 Accuracy 65.0% #23 of 54 Archive leaderboard report
Graph Classification MUTAG EigenGCN-3 Accuracy 79.5% #71 of 74 Archive leaderboard report
Graph Classification NC1 EigenGCN-3 Accuracy 0.770 #1 of 1 Archive leaderboard report
Graph Classification NCI109 EigenGCN-3 Accuracy 74.90 #27 of 38 Archive leaderboard report
Graph Classification PROTEINS EigenGCN-3 Accuracy 76.60% #41 of 103 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

GCNGraph Neural Network

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections