Semi-Supervised Hierarchical Graph Classification
Abstract
Node classification and graph classification are two graph learning problems that predict the class label of a node and the class label of a graph respectively. A node of a graph usually represents a real-world entity, e.g., a user in a social network, or a document in a document citation network. In this work, we consider a more challenging but practically useful setting, in which a node itself is a graph instance. This leads to a hierarchical graph perspective which arises in many domains such as social network, biological network and document collection. We study the node classification problem in the hierarchical graph where a ``node'' is a graph instance. As labels are usually limited, we design a novel semi-supervised solution named SEAL-CI. SEAL-CI adopts an iterative framework that takes turns to update two modules, one working at the graph instance level and the other at the hierarchical graph level. To enforce a consistency among different levels of hierarchical graph, we propose the Hierarchical Graph Mutual Information (HGMI) and further present a way to compute HGMI with theoretical guarantee. We demonstrate the effectiveness of this hierarchical graph modeling and the proposed SEAL-CI method on text and social network data.
Benchmark Results
Tested on 2 datasets 2 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
TU Dortmund
| # | 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 | |
| 67 | SAGE | 0.7726
±0.0228 | This paper |
| 149 | MLP | 0.7600
±0.0320 | |
| 161 | PSCN | 0.7589
±0.0276 | prev best: Orthogonal Graph Neural Networks (AAAI 2021) Improvement within reported uncertainty; not highlighted. |
| 164 | SP | 0.7580
±0.0050 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) Difference within reported uncertainty; not counted as underperformance. |
| 190 | WL | 0.7560
±0.0040 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) |
| 302 | RW | 0.7422
±0.0042 | This paper |
| 350 | graph2vec | 0.7330
±0.0205 | This paper |
| 425 | GK | 0.7167
±0.0055 | This paper |
| # | 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 | This paper |
| 25 | WL | 0.7978
±0.0036 best reported | best at pub: Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs (2017) best today: Graph Learning with Distributional Edge Layouts (2024) |
| 43 | GCN | 0.7912
±0.0307 | |
| 63 | GK | 0.7845
±0.0026 | This paper |
| 101 | PSCN | 0.7712
±0.0241 | This paper |
