Disentangled Generative Graph Representation Learning
Abstract
Generative graph models have recently emerged as a powerful paradigm in self-supervised learning for graph representation tasks, demonstrating remarkable potential in capturing complex structural and feature information. Despite their promise, most existing Generative Graph Representation Learning (GRL) methods treat the entire graph as a monolithic entity, employing random masking strategies across the entire structure. This approach often neglects the intricate interplay between different substructures of the graph, leading to entangled representations. Such entanglement can reduce the robustness of learned models and limit their ability to produce reliable outputs. To address these limitations, this paper presents DiGGR (Disentangled Generative Graph Representation Learning), a novel self-supervised learning framework designed to disentangle latent factors in graph representations. DiGGR introduces a disentanglement-driven approach to guide graph mask modeling, enabling the framework to learn distinct latent factors that better capture the underlying structure of graphs. By incorporating these latent factors into an end-to-end joint learning process, DiGGR enhances the clarity and structural alignment of the learned representations, while also improving their robustness and generalization across tasks. The effectiveness of DiGGR is validated through extensive experiments on 15 public datasets spanning three distinct graph learning tasks. The results consistently demonstrate that DiGGR outperforms a wide range of previous self-supervised methods, highlighting its superior ability to learn meaningful, disentangled representations. These findings underscore the potential of DiGGR to advance the state of the art in Generative GRL research.
Benchmark Results
Tested on 13 datasets 43 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 | |
| 44 | GAT | 0.8897
±0.0014 best reported | best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 130 | BGRL | 0.8730
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 134 | GRACE | 0.8720
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 156 | MVGRL | 0.8680
±0.0050 best reported | best at pub: ENGAGE: Explanation Guided Data Augmentation for Graph Representation Learning (2023) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 177 | DGI | 0.8630
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 228 | DiGGR | 0.8496
±0.0032 | This paper |
| 238 | GiGaMAE | 0.8472
±0.0047 | This paper |
| 245 | Bandana | 0.8462
±0.0037 | This paper |
| 248 | CCA-SSG | 0.8460
±0.0070 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) Difference within reported uncertainty; not counted as underperformance. |
| 252 | GraphMAE2 | 0.8450
±0.0060 | This paper |
| 275 | VEPM | 0.8430
±0.0010 | This paper |
| 276 | SEEGERA | 0.8430
±0.0040 | This paper |
| 280 | GraphMAE | 0.8420
±0.0040 | prev best: Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights (NeurIPS 2024) |
| 297 | IPGDN | 0.8410 | This paper |
| 299 | SFA_BT | 0.8410
±0.0001 | This paper |
| 335 | DisenGCN | 0.8370 | prev best: Adversarial Graph Disentanglement with Component-specific Aggregation (2021) Improvement within reported uncertainty; not highlighted. |
| 369 | InfoGCL | 0.8350
±0.0030 | This paper |
| 400 | MA-GCL | 0.8330
±0.0040 | This paper |
| 630 | VGAE | 0.8059
±0.0035 best reported | best at pub: Decoupled Self-supervised Learning for Non-Homophilou Graphs (2022) |
| 654 | GAE | 0.8011
±0.0022 best reported | best at pub: Graph Masked Autoencoders with Transformers (2022) |
| 724 | MLP | 0.7768 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 35 | GAT | 0.8080
±0.0026 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 44 | GCN | 0.8033
±0.0088 best reported | best at pub: NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification (2024) |
| 61 | GraphSAGE | 0.7923
±0.0053 | |
| 66 | DGI | 0.7890
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 87 | MVGRL | 0.7808
±0.0006 best reported | |
| 136 | BGRL | 0.7600
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 165 | CCA-SSG | 0.7540
±0.0100 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 201 | GRACE | 0.7450
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 209 | GraphMAE | 0.7436 best reported | best at pub: Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights (NeurIPS 2024) |
| 231 | IPGDN | 0.7400 | This paper |
| 233 | DiGGR | 0.7398
±0.0027 | This paper |
| 249 | SFA_BT | 0.7373
±0.0003 | This paper |
| 267 | DisenGCN | 0.7360
±0.0080 best reported | best at pub: Adversarial Graph Disentanglement with Component-specific Aggregation (2021) Difference within reported uncertainty; not counted as underperformance. |
| 268 | MA-GCL | 0.7360
±0.0010 | This paper |
| 269 | Bandana | 0.7360
±0.0016 | This paper |
| 273 | InfoGCL | 0.7350
±0.0040 | This paper |
| 286 | GraphMAE2 | 0.7340
±0.0030 | This paper |
| 328 | SEEGERA | 0.7300
±0.0080 | prev best: Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning (2023) Improvement within reported uncertainty; not highlighted. |
| 350 | MLP | 0.7289
±0.0010 | |
| 398 | VEPM | 0.7250
±0.0010 | This paper |
| 426 | GiGaMAE | 0.7231
±0.0050 | This paper |
| 625 | VGAE | 0.6990
±0.0057 best reported | best at pub: Decoupled Self-supervised Learning for Non-Homophilou Graphs (2022) |
| 739 | GAE | 0.6639
±0.0024 best reported | best at pub: Decoupled Self-supervised Learning for Non-Homophilou Graphs (2022) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 best reported | best at pub: Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning (ICLR 2024) |
| 20 | GAT | 0.9233
±0.0018 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 136 | CCA-SSG | 0.8840
±0.0060 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 144 | BGRL | 0.8830
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 194 | GRACE | 0.8730
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 196 | MVGRL | 0.8725
±0.0012 best reported | |
| 204 | DGI | 0.8708
±0.0017 best reported | |
| 210 | MLP | 0.8690
±0.0074 | |
| 232 | GraphMAE | 0.8594
±0.0016 best reported | |
| 239 | SFA_BT | 0.8563
±0.0007 | This paper |
| 290 | Bandana | 0.8353
±0.0051 | This paper |
| 291 | MA-GCL | 0.8350
±0.0040 | This paper |
| 299 | VGAE | 0.8307
±0.0029 best reported | best at pub: Decoupled Self-supervised Learning for Non-Homophilou Graphs (2022) |
| 300 | SEEGERA | 0.8301
±0.0032 best reported | |
| 304 | GAE | 0.8294
±0.0031 best reported | best at pub: Multi-View Graph Representation Learning Beyond Homophily (2023) |
| 319 | VEPM | 0.8240
±0.0020 | This paper |
| 350 | GraphMAE2 | 0.8140
±0.0050 | This paper |
| 357 | DiGGR | 0.8130
±0.0026 | This paper |
| 361 | IPGDN | 0.8120 | This paper |
| 406 | DisenGCN | 0.8050 | This paper |
| 575 | InfoGCL | 0.7910
±0.0020 | This paper |
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | GAMLP(JK) | 0.9982
±0.0001 | |
| 2 | GraphCON-GCN | 0.9960 | |
| 3 | GCNII | 0.9953
±0.0001 | |
| 21 | GCN | 0.9850 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) |
| 57 | GAT | 0.9732
±0.0032 best reported | best at pub: HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption (2023) Difference within reported uncertainty; not counted as underperformance. |
| 92 | GIN | 0.8724
±0.0002 | |
| 102 | DiGGR | 0.7830
±0.0071 | This paper |
| 114 | GraphMAE | 0.7450
±0.0029 | This paper |
| 117 | BGRL | 0.7363
±0.0016 | This paper |
| 119 | CCA-SSG | 0.7334
±0.0017 | This paper |
| 126 | GRACE | 0.6971
±0.0017 | This paper |
| 148 | DGI | 0.6380
±0.0020 | This paper |
| 173 | MLP | 0.4620 |
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 | |
| 37 | VEPM | 0.9360
±0.0340 | This paper |
| 39 | GIN | 0.9330
±0.0290 best reported | best at pub: ProtGNN: Towards Self-Explaining Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 57 | DisenSemi | 0.9260
±0.0060 | This paper |
| 63 | GCN | 0.9220
±0.0440 | |
| 70 | DGCL | 0.9210
±0.0080 | This paper |
| 105 | InfoGCL | 0.9120
±0.0130 | This paper |
| 159 | WL | 0.9040
±0.0570 best reported | best at pub: How Powerful are $K$-hop Message Passing Graph Neural Networks (NeurIPS 2022) |
| 199 | MVGRL | 0.8993
±0.0616 best reported | best at pub: Improving Expressivity of GNNs with Subgraph-specific Factor Embedded Normalization (KDD 2023) Difference within reported uncertainty; not counted as underperformance. |
| 226 | GraphMAE2 | 0.8960
±0.0030 best reported | best at pub: UGMAE: A Unified Framework for Graph Masked Autoencoders (2024) best today: CORE: Contrastive Masked Feature Reconstruction on Graphs (2025) |
| 228 | GAE | 0.8950
±0.0150 best reported | best at pub: Omni-Granular Ego-Semantic Propagation for Self-Supervised Graph Representation Learning (ICML 2022) best today: Revisiting Graph Autoencoders as Implicit Contrastive Learners (KDD 2024) |
| 239 | DiffPool | 0.8940
±0.0460 best reported | best at pub: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 257 | InfoGraph | 0.8930
±0.0514 best reported | best at pub: Improving Expressivity of GNNs with Subgraph-specific Factor Embedded Normalization (KDD 2023) Difference within reported uncertainty; not counted as underperformance. |
| 258 | GraphMAE | 0.8930
±0.0110 best reported | best at pub: GraphMAE: Self-Supervised Masked Graph Autoencoders (KDD 2022) best today: Revisiting Graph Autoencoders as Implicit Contrastive Learners (KDD 2024) Difference within reported uncertainty; not counted as underperformance. |
| 296 | DiGGR | 0.8872
±0.0103 | This paper |
| 302 | AutoGCL | 0.8864
±0.0108 | This paper |
| 351 | JOAO | 0.8770
±0.0080 best reported | best at pub: Graph Self-Supervised Learning: A Survey (2021) best today: Learning Graph Augmentations to Learn Graph Representations (2022) Difference within reported uncertainty; not counted as underperformance. |
| 354 | GraphCL | 0.8766
±0.0103 best reported | best at pub: Graph Masked Autoencoders with Transformers (2022) Difference within reported uncertainty; not counted as underperformance. |
| 365 | DGK | 0.8744
±0.0272 | This paper |
| 403 | MLP | 0.8660
±0.0495 | |
| 407 | graph2vec | 0.8644
±0.0125 best reported | best at pub: Graph Masked Autoencoders with Transformers (2022) Difference within reported uncertainty; not counted as underperformance. |
| 475 | VGAE | 0.8440
±0.0060 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 3 | GCN | 0.9727 | |
| 12 | WL | 0.8590
±0.0010 best reported | best at pub: Propagation Kernels (2014) |
| 42 | VEPM | 0.8390
±0.0180 | This paper |
| 104 | GraphCL | 0.8250
±0.0013 best reported | best at pub: Label-invariant Augmentation for Semi-Supervised Graph Classification (NeurIPS 2022) |
| 116 | GraphMAE2 | 0.8230
±0.0090 best reported | best at pub: UGMAE: A Unified Framework for Graph Masked Autoencoders (2024) best today: Revisiting Graph Autoencoders as Implicit Contrastive Learners (KDD 2024) |
| 133 | AutoGCL | 0.8200
±0.0029 | This paper |
| 131 | GraphSAGE | 0.8200
±0.0100 | |
| 139 | DGCL | 0.8190
±0.0020 | This paper |
| 167 | DiGGR | 0.8123
±0.0040 | This paper |
| 200 | GraphMAE | 0.8042
±0.0035 best reported | best at pub: GraphMAE: Self-Supervised Masked Graph Autoencoders (KDD 2022) best today: Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations (2025) Difference within reported uncertainty; not counted as underperformance. |
| 210 | DGK | 0.8031
±0.0046 | This paper |
| 215 | InfoGCL | 0.8020
±0.0060 | This paper |
| 236 | GAE | 0.7978
±0.0017 best reported | best at pub: Label-invariant Augmentation for Semi-Supervised Graph Classification (NeurIPS 2022) |
| 270 | DisenSemi | 0.7890
±0.0040 | This paper |
| 301 | JOAO | 0.7840
±0.0050 best reported | best at pub: Omni-Granular Ego-Semantic Propagation for Self-Supervised Graph Representation Learning (ICML 2022) Difference within reported uncertainty; not counted as underperformance. |
| 338 | InfoGraph | 0.7750
±0.0074 best reported | best at pub: Graph Masked Autoencoders with Transformers (2022) Difference within reported uncertainty; not counted as underperformance. |
| 406 | graph2vec | 0.7540
±0.0120 best reported | best at pub: InfoGCL: Information-Aware Graph Contrastive Learning (NeurIPS 2021) Difference within reported uncertainty; not counted as underperformance. |
| 441 | VGAE | 0.7370
±0.0030 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9410
±0.0330 | |
| 2 | GRDL | 0.8260
±0.0120 | |
| 3 | GMN | 0.8225 | |
| 7 | DiffPool | 0.8161
±0.0232 best reported | |
| 13 | VEPM | 0.8050
±0.0280 | This paper |
| 32 | GIN | 0.7880
±0.0410 best reported | best at pub: Permutation-Invariant graph partitioning: How graph neural networks capture structural interactions? (2023) Difference within reported uncertainty; not counted as underperformance. |
| 41 | DisenSemi | 0.7840
±0.0050 | This paper |
| 67 | SAGE | 0.7726
±0.0228 | |
| 149 | MLP | 0.7600
±0.0320 | |
| 178 | DGK | 0.7568
±0.0054 best reported | best at pub: Graph Capsule Convolutional Neural Networks (ICML 2018) best today: Hierarchical Graph Capsule Network (AAAI 2020) |
| 190 | WL | 0.7560
±0.0040 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) |
| 213 | GraphMAE | 0.7530
±0.0039 | This paper |
| 265 | GraphCL | 0.7489
±0.0065 best reported | best at pub: Graph Masked Autoencoders with Transformers (2022) Difference within reported uncertainty; not counted as underperformance. |
| 268 | GraphMAE2 | 0.7486
±0.0034 | This paper |
| 283 | JOAO | 0.7460
±0.0040 best reported | best at pub: GPS: graph contrastive learning via multi-scale augmented views from adversarial pooling (2024) best today: Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition (WWW 2025) Difference within reported uncertainty; not counted as underperformance. |
| 294 | InfoGraph | 0.7444
±0.0031 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9792 | |
| 2 | MSH-GNN | 0.9640
±0.0070 | |
| 3 | CoCN | 0.8722
±0.0013 | |
| 10 | GraphMAE2 | 0.8410
±0.0030 best reported | best at pub: UGMAE: A Unified Framework for Graph Masked Autoencoders (2024) best today: CORE: Contrastive Masked Feature Reconstruction on Graphs (2025) |
| 12 | DiGGR | 0.8376
±0.0370 | This paper |
| 22 | GraphMAE | 0.8270
±0.0100 best reported | best at pub: GraphMAE: Self-Supervised Masked Graph Autoencoders (KDD 2022) best today: Revisiting Graph Autoencoders as Implicit Contrastive Learners (KDD 2024) |
| 23 | GCN | 0.8260
±0.0220 | |
| 30 | GIN | 0.8220
±0.0210 best reported | best at pub: Scalable Expressiveness through Preprocessed Graph Perturbations (2024) Difference within reported uncertainty; not counted as underperformance. |
| 33 | DiffPool | 0.8213
±0.0043 best reported | best at pub: Scalable Graph Compressed Convolutions (2024) Difference within reported uncertainty; not counted as underperformance. |
| 54 | DisenSemi | 0.8150
±0.0030 | This paper |
| 72 | DGCL | 0.8120
±0.0030 | This paper |
| 75 | GCC | 0.8110 best reported | best at pub: Graph Self-Supervised Learning: A Survey (2021) |
| 80 | GraphCL | 0.8108
±0.0017 best reported | best at pub: Label-invariant Augmentation for Semi-Supervised Graph Classification (NeurIPS 2022) |
| 126 | InfoGCL | 0.8001
±0.0132 best reported | best at pub: InfoGCL: Information-Aware Graph Contrastive Learning (NeurIPS 2021) best today: Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations (2025) Difference within reported uncertainty; not counted as underperformance. |
| 146 | InfoGraph | 0.7940 best reported | best at pub: CogDL: A Comprehensive Library for Graph Deep Learning (WWW 2021) |
| 151 | MLP | 0.7920
±0.0240 | |
| 204 | AutoGCL | 0.7716
±0.0148 best reported | best at pub: GIMM: InfoMin-Max for Automated Graph Contrastive Learning (2023) best today: Unifying Graph Contrastive Learning via Graph Message Augmentation (2024) |
| 248 | JOAO | 0.7535
±0.0093 best reported | best at pub: Spectral Augmentation for Self-Supervised Learning on Graphs (ICLR 2022) |
| 274 | DGK | 0.7310
±0.0030 best reported | best at pub: Wasserstein Embedding for Graph Learning (ICLR 2020) best today: InfoGCL: Information-Aware Graph Contrastive Learning (NeurIPS 2021) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSNN | 0.7790
±0.0360 | |
| 2 | SIN | 0.7560
±0.0320 | |
| 3 | CIN | 0.7560
±0.0370 | |
| 5 | GIN | 0.7510
±0.0510 | |
| 18 | H_d | 0.5477
±0.0263 | This paper |
| 19 | H_d + H_g | 0.5469
±0.0206 | This paper |
| 40 | H_g | 0.5162
±0.0061 | This paper |
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9672
±0.0147 | |
| 2 | DoG | 0.9660
±0.0210 | |
| 3 | GPF-plus | 0.9583
±0.0419 | |
| 34 | MLP | 0.9230
±0.0070 | |
| 52 | LRGNN | 0.9027
±0.0449 | This paper |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 60 | MUSE | 0.8973
±0.0279 | This paper |
| 101 | GREET | 0.8703
±0.0236 | This paper |
| 111 | OGNN | 0.8622
±0.0412 | This paper |
| 125 | DiGGR | 0.8595
±0.0671 | This paper |
| 325 | LINKX | 0.7460
±0.0837 | This paper |
| 331 | GraphMAE | 0.7432
±0.0456 | prev best: Cross-Domain Graph Data Scaling: A Showcase with Diffusion Models (NeurIPS 2024) |
| 359 | DSSL | 0.7273
±0.0402 best reported | |
| 383 | GraphACL | 0.7108
±0.0034 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 24 | MLP | 0.9136
±0.0070 | |
| 41 | DiGGR | 0.8838
±0.0684 | This paper |
| 51 | OGNN | 0.8703
±0.0473 | This paper |
| 65 | LRGNN | 0.8648
±0.0565 | This paper |
| 88 | GREET | 0.8514
±0.0487 | This paper |
| 123 | LINKX | 0.8346
±0.0061 best reported | best at pub: Differentiable Cluster Graph Neural Network (2024) Difference within reported uncertainty; not counted as underperformance. |
| 138 | SAGE | 0.8269 | |
| 155 | MUSE | 0.8216
±0.0342 | This paper |
| 231 | GraphMAE | 0.7514
±0.0965 | prev best: Cross-Domain Graph Data Scaling: A Showcase with Diffusion Models (NeurIPS 2024) |
| 289 | DSSL | 0.6928
±0.0601 best reported | |
| 384 | GraphACL | 0.5933
±0.0148 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | This paper |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 42 | MLP | 0.4026
±0.0108 | |
| 68 | GraphSAGE | 0.3899
±0.0085 | |
| 79 | MUSE | 0.3855
±0.0134 | This paper |
| 93 | OGNN | 0.3799
±0.0100 | This paper |
| 117 | LRGNN | 0.3734
±0.0178 | This paper |
| 158 | GREET | 0.3655
±0.0101 | This paper |
| 180 | LINKX | 0.3610
±0.0155 | This paper |
| 299 | GraphMAE | 0.3215
±0.0133 best reported | best at pub: Cross-Domain Graph Data Scaling: A Showcase with Diffusion Models (NeurIPS 2024) best today: Frequency-Corrupt Based Graph Self-Supervised Learning (WWW 2026) |
| 351 | GraphACL | 0.3003
±0.0013 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DMD++ | 0.9190
±0.0260 | |
| 2 | F-GREAD-BS | 0.9059
±0.0380 | |
| 3 | APPNP | 0.9010
±0.0350 | |
| 16 | MUSE | 0.8824
±0.0320 | This paper |
| 17 | LRGNN | 0.8823
±0.0354 | This paper |
| 21 | OGNN | 0.8804
±0.0363 | This paper |
| 26 | DiGGR | 0.8725
±0.0441 | This paper |
| 37 | MLP | 0.8629
±0.0450 | |
| 45 | GREET | 0.8490
±0.0448 | This paper |
| 63 | GCN | 0.8310
±0.0320 | |
| 97 | LINKX | 0.7549
±0.0572 | This paper |
| 104 | GraphMAE | 0.7471
±0.0883 | This paper |
| 134 | GraphACL | 0.6922
±0.0040 | This paper |
