OpenCodePapers
node-classification-on-amazon-computers-1
Node Classification
Results over time
Click legend items to toggle metrics. Hover points for model names.
Leaderboard
Show papers without code
Paper
Code
Accuracy
↕
ModelName
ReleaseDate
↕
Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification
✓ Link
94.09±0.37
GAT
2024-06-13
Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification
✓ Link
93.99±0.12
GCN
2024-06-13
Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification
✓ Link
93.25±0.14
GraphSAGE
2024-06-13
Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification
✓ Link
92.17±0.50
GNNMoE(GCN-like P)
2024-12-11
Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification
✓ Link
91.98±0.46
GNNMoE(GAT-like P)
2024-12-11
Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification
✓ Link
91.85±0.39
GNNMoE(SAGE-like P)
2024-12-11
Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures
✓ Link
91.45±0.58
CGT
2023-12-28
Inferring from References with Differences for Semi-Supervised Node Classification on Graphs
✓ Link
90.74%
3ference
2022-04-11
Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages
✓ Link
89.49%
LinkDist
2021-06-16
Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages
✓ Link
89.44%
LinkDistMLP
2021-06-16
Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages
✓ Link
89.42%
CoLinkDist
2021-06-16
Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages
✓ Link
88.85%
CoLinkDistMLP
2021-06-16