paper
-with-
me
Papers
Browse State-of-the-Art
Datasets
Methods
AI Agents
Trends
Digest
🌙
Graph Classification
벤치마크
Graph Classification on REDDIT-B
24개 결과 ·
⬇ CSV
·
JSON
Accuracy
56.73
65.83
74.94
84.05
93.15
2018-10
2026-09
GIN-0 — 92.4 (2018-10-01)
GIN-0 — 92.4 (2018-10-01)
DiffPool — 92.1 (2019-03-06)
DiffPool — 92.1 (2019-03-06)
δ-2-LWL — 89.0 (2019-04-02)
δ-2-LWL — 89.0 (2019-04-02)
ApproxRepSet — 80.3 (2019-04-03)
ApproxRepSet — 80.3 (2019-04-03)
GAT-GC (f-Scaled) — 92.57 (2019-07-04)
GAT-GC (f-Scaled) — 92.57 (2019-07-04)
NDP — 84.3 (2019-10-24)
NDP — 84.3 (2019-10-24)
GraphSAGE — 84.3 (2019-12-20)
GraphSAGE — 84.3 (2019-12-20)
WEGL — 92.0 (2020-06-16)
WEGL — 92.0 (2020-06-16)
2-WL-GNN — 89.4 (2020-07-01)
2-WL-GNN — 89.4 (2020-07-01)
CRaWl — 93.15 (2021-02-17)
CRaWl — 93.15 (2021-02-17)
Local Topological Profile (LTP) — 91.1 (2023-05-01)
Local Topological Profile (LTP) — 91.1 (2023-05-01)
Graph-JEPA — 56.73 (2023-09-27)
Graph-JEPA — 56.73 (2023-09-27)
GIN-0 — 92.4 (2018-10-01)
GAT-GC (f-Scaled) — 92.57 (2019-07-04)
CRaWl — 93.15 (2021-02-17)
2018-10-01 — GIN-0: Accuracy 92.4
2019-07-04 — GAT-GC (f-Scaled): Accuracy 92.57
2021-02-17 — CRaWl: Accuracy 93.15
Rank
Model
Accuracy
Accuracy (10-fold)
Paper
Code
Year
1
CRaWl
93.15
–
Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing
toenshoff/CRaWl
2021
2
GAT-GC (f-Scaled)
92.57
–
Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation
zetayue/CPA
2019
3
GIN-0
92.4
–
How Powerful are Graph Neural Networks?
dmlc/dgl
·
dmlc/dgl
·
weihua916/powerful-gnns
·
+16
2018
4
DiffPool
92.1
–
Fast Graph Representation Learning with PyTorch Geometric
rusty1s/pytorch_geometric
·
leojklarner/gauche
·
ncfrey/litmatter
·
+3
2019
5
WEGL
92
–
Wasserstein Embedding for Graph Learning
navid-naderi/WEGL
2020
6
Local Topological Profile (LTP)
91.1 ± 1.0
91.1 ± 1.0
Strengthening structural baselines for graph classification using Local Topological Profile
j-adamczyk/ltp
2023
7
2-WL-GNN
89.4
–
A Novel Higher-order Weisfeiler-Lehman Graph Convolution
Cortys/master-thesis
2020
8
δ-2-LWL
89.0
–
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
chrsmrrs/sparsewl
2019
9
NDP
84.3
–
Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling
danielegrattarola/decimation-pooling
2019
9
GraphSAGE
84.3
–
A Fair Comparison of Graph Neural Networks for Graph Classification
diningphil/gnn-comparison
·
diningphil/CGMM
·
FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks
·
+2
2019
11
ApproxRepSet
80.3
–
Rep the Set: Neural Networks for Learning Set Representations
giannisnik/repset
2019
12
Graph-JEPA
56.73
–
Graph-level Representation Learning with Joint-Embedding Predictive Architectures
geriskenderi/graph-jepa
2023
13
CRaWl
93.15
–
Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing
toenshoff/CRaWl
2021
14
GAT-GC (f-Scaled)
92.57
–
Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation
zetayue/CPA
2019
15
GIN-0
92.4
–
How Powerful are Graph Neural Networks?
dmlc/dgl
·
dmlc/dgl
·
weihua916/powerful-gnns
·
+16
2018
16
DiffPool
92.1
–
Fast Graph Representation Learning with PyTorch Geometric
rusty1s/pytorch_geometric
·
leojklarner/gauche
·
ncfrey/litmatter
·
+3
2019
17
WEGL
92
–
Wasserstein Embedding for Graph Learning
navid-naderi/WEGL
2020
18
Local Topological Profile (LTP)
91.1 ± 1.0
91.1 ± 1.0
Strengthening structural baselines for graph classification using Local Topological Profile
j-adamczyk/ltp
2023
19
2-WL-GNN
89.4
–
A Novel Higher-order Weisfeiler-Lehman Graph Convolution
Cortys/master-thesis
2020
20
δ-2-LWL
89.0
–
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
chrsmrrs/sparsewl
2019
1–20 / 24
다음 →
페이지당
10
20
50
100