Node Classification On Wisconsin 60 20 20

評価指標

1:1 Accuracy

評価結果

このベンチマークにおける各モデルのパフォーマンス結果

モデル名
1:1 Accuracy
Paper TitleRepository
FAGCN89.75 ± 6.37Beyond Low-frequency Information in Graph Convolutional Networks-
ACM-Snowball-396.62 ± 1.86Revisiting Heterophily For Graph Neural Networks-
APPNP92.00 ± 3.59Predict then Propagate: Graph Neural Networks meet Personalized PageRank-
GCNII*89.12 ± 3.06Simple and Deep Graph Convolutional Networks-
ACMII-Snowball-397.00 ± 2.63Revisiting Heterophily For Graph Neural Networks-
GCN75.5 ± 2.92Semi-Supervised Classification with Graph Convolutional Networks-
ACM-GCN+96.5 ± 2.08Revisiting Heterophily For Graph Neural Networks-
Snowball-369.5 ± 5.01Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks-
HH-GCN79.8 ± 4.30Half-Hop: A graph upsampling approach for slowing down message passing-
Geom-GCN*64.12Geom-GCN: Geometric Graph Convolutional Networks-
ACM-GCNII*94.37 ± 2.81Revisiting Heterophily For Graph Neural Networks-
ACMII-Snowball-296.63 ± 2.24Revisiting Heterophily For Graph Neural Networks-
ACM-GCNII94.63 ± 2.96Revisiting Heterophily For Graph Neural Networks-
ACMII-GCN+96.75 ± 1.79Revisiting Heterophily For Graph Neural Networks-
ACM-Snowball-296.38 ± 2.59Revisiting Heterophily For Graph Neural Networks-
SGC-274.75 ± 2.89Simplifying Graph Convolutional Networks-
HH-GraphSAGE85.88 ± 3.99Half-Hop: A graph upsampling approach for slowing down message passing-
HH-GAT83.53 ± 3.84Half-Hop: A graph upsampling approach for slowing down message passing-
H2GCN87.5 ± 1.77Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs-
GraphSAGE64.85 ± 5.14Inductive Representation Learning on Large Graphs-
0 of 35 row(s) selected.
Node Classification On Wisconsin 60 20 20 | SOTA | HyperAI超神経