Hierarchical Graph Capsule Network
Abstract
Graph Neural Networks (GNNs) draw their strength from explicitly modeling the topological information of structured data. However, existing GNNs suffer from limited capability in capturing the hierarchical graph representation which plays an important role in graph classification. In this paper, we innovatively propose hierarchical graph capsule network (HGCN) that can jointly learn node embeddings and extract graph hierarchies. Specifically, disentangled graph capsules are established by identifying heterogeneous factors underlying each node, such that their instantiation parameters represent different properties of the same entity. To learn the hierarchical representation, HGCN characterizes the part-whole relationship between lower-level capsules (part) and higher-level capsules (whole) by explicitly considering the structure information among the parts. Experimental studies demonstrate the effectiveness of HGCN and the contribution of each component. Code: https://github.com/uta-smile/HGCN
Benchmark Results
Tested on 5 datasets 1 baseline value reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9910
±0.0030 | |
| 2 | ID-GNN+BEC | 0.9830
±0.0360 | |
| 3 | SupCosine | 0.9830
±0.0250 | |
| 39 | GIN | 0.9330
±0.0290 | |
| 41 | HGCN | 0.9316
±0.0610 | This paper |
| 51 | PSCN | 0.9263
±0.0421 best reported | best at pub: Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs (2017) best today: Quaternion Graph Neural Networks (2020) Difference within reported uncertainty; not counted as underperformance. |
| 63 | GCN | 0.8720
±0.0511 | prev best: Graph Neural Networks With Convolutional ARMA Filters (2019) Improvement within reported uncertainty; not highlighted. |
| 159 | WL | 0.9040
±0.0570 best reported | best at pub: Understanding Isomorphism Bias in Graph Data Sets (2019) best today: How Powerful are $K$-hop Message Passing Graph Neural Networks (NeurIPS 2022) |
| 365 | DGK | 0.8744
±0.0272 | This paper |
| 403 | MLP | 0.8660
±0.0495 | |
| 634 | EigenPooling | 0.7950 | This paper |
| 671 | HaarPool | 0.7760
±0.0894 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 | |
| 3 | GCN | 0.8365
±0.0169 | prev best: Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels (NeurIPS 2019) best today: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 24 | CapsNets | 0.8487
±0.0168 | This paper |
| 88 | GFN | 0.8277
±0.0149 | This paper |
| 131 | GraphSAGE | 0.8200
±0.0100 | |
| 218 | HaarPool | 0.8017
±0.0229 | This paper |
| 302 | CapsGNN | 0.7840
±0.0160 best reported | best today: Molecular Representation Learning via Heterogeneous Motif Graph Neural Networks (ICML 2022) Difference within reported uncertainty; not counted as underperformance. |
| 357 | EigenPooling | 0.7700 | This paper |
| 519 | GK | 0.6600
±0.0010 best reported | best at pub: Implicit Graph Neural Networks (NeurIPS 2020) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9410
±0.0330 | |
| 2 | GRDL | 0.8260
±0.0120 | |
| 3 | GMN | 0.8225 | |
| 32 | GIN | 0.7880
±0.0410 | |
| 101 | EigenPooling | 0.7660 | This paper |
| 148 | GCN | 0.7565
±0.0324 | prev best: Graph Convolutional Networks with EigenPooling (KDD 2019) Improvement within reported uncertainty; not highlighted. |
| 149 | MLP | 0.7600
±0.0320 | |
| 178 | DGK | 0.7568
±0.0054 | This paper |
| 355 | HaarPool | 0.7323
±0.0251 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GMN | 0.7866 | |
| 2 | MemGNN | 0.7550 | |
| 3 | TFGW SP | 0.7510
±0.0500 | |
| 16 | GFN | 0.7017
±0.0558 | This paper |
| 17 | GatedGCN | 0.7000
±0.0494 | |
| 26 | GraphSAGE | 0.6817
±0.0545 | |
| 36 | GCN | 0.6650
±0.0691 | prev best: GraphCrop: Subgraph Cropping for Graph Classification (2020) Improvement within reported uncertainty; not highlighted. |
| 54 | EigenPooling | 0.6450 | This paper |
| 124 | MLP | 0.5583
±0.0352 | |
| 127 | CapsGNN | 0.5531
±0.0423 best reported | best at pub: Wasserstein Embedding for Graph Learning (ICLR 2020) best today: Contrastive Graph Few-Shot Learning (2022) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GC-GNN (GCN) | 0.9210
±0.0810 | |
| 2 | SUGAR | 0.8403
±0.0133 | |
| 3 | Ortho-g-U-Nets | 0.8387 | |
| 15 | SAGE | 0.8088
±0.0233 | |
| 43 | GCN | 0.7912
±0.0307 | prev best: Graph Convolutional Networks with EigenPooling (KDD 2019) Improvement within reported uncertainty; not highlighted. |
| 52 | GFN | 0.7878
±0.0349 | This paper |
| 85 | GCAPS-CNN | 0.7762
±0.0499 | This paper |
| 97 | CliquePool | 0.7733 | This paper |
| 101 | PSCN | 0.7712
±0.0241 best reported | best at pub: Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs (2017) best today: Semi-Supervised Hierarchical Graph Classification (2022) Difference within reported uncertainty; not counted as underperformance. |
| 132 | CapsGNN | 0.7538
±0.0417 | This paper |
| 164 | AWE | 0.7151
±0.0402 | This paper |
