HyperAI

Node Classification On Cornell 60 20 20

المقاييس

1:1 Accuracy

النتائج

نتائج أداء النماذج المختلفة على هذا المعيار القياسي

اسم النموذج
1:1 Accuracy
Paper TitleRepository
HH-GAT72.7 ± 4.26Half-Hop: A graph upsampling approach for slowing down message passing
ACM-SGC-293.77 ± 2.17Revisiting Heterophily For Graph Neural Networks
GAT76.00 ± 1.01Graph Attention Networks
GraphSAGE71.41 ± 1.24Inductive Representation Learning on Large Graphs
Snowball-382.95 ± 2.1Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks
ACM-GCN94.75 ± 3.8Revisiting Heterophily For Graph Neural Networks
GCN82.46 ± 3.11Semi-Supervised Classification with Graph Convolutional Networks
HH-GraphSAGE74.6 ± 6.06Half-Hop: A graph upsampling approach for slowing down message passing
GCNII*90.49 ± 4.45Simple and Deep Graph Convolutional Networks
ACM-GCN++93.93 ± 1.05Revisiting Heterophily For Graph Neural Networks
ACMII-GCN95.9 ± 1.83Revisiting Heterophily For Graph Neural Networks
ACM-GCN+94.92 ± 2.79Revisiting Heterophily For Graph Neural Networks
ACM-Snowball-295.08 ± 3.11Revisiting Heterophily For Graph Neural Networks
ACM-GCNII*93.44 ± 2.74Revisiting Heterophily For Graph Neural Networks
MLP-291.30 ± 0.70Revisiting Heterophily For Graph Neural Networks
SGC-170.98 ± 8.39Simplifying Graph Convolutional Networks
FAGCN88.03 ± 5.6Beyond Low-frequency Information in Graph Convolutional Networks
SGC-272.62 ± 9.92Simplifying Graph Convolutional Networks
H2GCN86.23 ± 4.71Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs
Geom-GCN*60.81Geom-GCN: Geometric Graph Convolutional Networks
0 of 36 row(s) selected.