paper-with-me

Node Classification 벤치마크

Node Classification on Amazon Computers

12개 결과 · ⬇ CSV · JSON

Accuracy

88.85 90.16 91.47 92.78 94.09 2021-06 2026-11 LinkDist — 89.49 (2021-06-16) LinkDistMLP — 89.44 (2021-06-16) CoLinkDist — 89.42 (2021-06-16) CoLinkDistMLP — 88.85 (2021-06-16) 3ference — 90.74 (2022-04-11) CGT — 91.45 (2023-12-28) GAT — 94.09 (2024-06-13) GCN — 93.99 (2024-06-13) GraphSAGE — 93.25 (2024-06-13) GNNMoE(GCN-like P) — 92.17 (2024-12-11) GNNMoE(GAT-like P) — 91.98 (2024-12-11) GNNMoE(SAGE-like P) — 91.85 (2024-12-11) LinkDist — 89.49 (2021-06-16) 3ference — 90.74 (2022-04-11) CGT — 91.45 (2023-12-28) GAT — 94.09 (2024-06-13)
RankModel Accuracy PaperCodeYear
1 GAT 94.09±0.37 Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification LUOyk1999/tunedGNN 2024
2 GCN 93.99±0.12 Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification LUOyk1999/tunedGNN 2024
3 GraphSAGE 93.25±0.14 Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification LUOyk1999/tunedGNN 2024
4 GNNMoE(GCN-like P) 92.17±0.50 Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification GISec-Team/GNNMoE 2024
5 GNNMoE(GAT-like P) 91.98±0.46 Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification GISec-Team/GNNMoE 2024
6 GNNMoE(SAGE-like P) 91.85±0.39 Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification GISec-Team/GNNMoE 2024
7 CGT 91.45±0.58 Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures nslab-cuk/community-aware-graph-transformer 2023
8 3ference 90.74% Inferring from References with Differences for Semi-Supervised Node Classification on Graphs cf020031308/3ference 2022
9 LinkDist 89.49% Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages cf020031308/LinkDist · cf020031308/LinkDist 2021
10 LinkDistMLP 89.44% Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages cf020031308/LinkDist · cf020031308/LinkDist 2021
11 CoLinkDist 89.42% Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages cf020031308/LinkDist · cf020031308/LinkDist 2021
12 CoLinkDistMLP 88.85% Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages cf020031308/LinkDist · cf020031308/LinkDist 2021
1–12 / 12 페이지당 10 20 50 100