HyperAI

Node Classification On Pubmed 48 32 20 Fixed

Metrics

1:1 Accuracy

Results

Performance results of various models on this benchmark

Model Name
1:1 Accuracy
Paper TitleRepository
GCNII90.15 ± 0.43Simple and Deep Graph Convolutional Networks
GloGNN89.62 ± 0.35Finding Global Homophily in Graph Neural Networks When Meeting Heterophily
Diag-NSD89.42 ± 0.43Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs
NLGAT 88.2 ± 0.3Non-Local Graph Neural Networks
ACMII-GCN+89.78 ± 0.49Revisiting Heterophily For Graph Neural Networks
ACM-GCN+89.82 ± 0.41Revisiting Heterophily For Graph Neural Networks
MixHop85.31 ± 0.61MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing
Gen-NSD89.33 ± 0.35Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs
GloGNN++89.24 ± 0.39Finding Global Homophily in Graph Neural Networks When Meeting Heterophily
O(d)-NSD89.49 ± 0.40Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs
ACM-GCN++89.65 ± 0.58Revisiting Heterophily For Graph Neural Networks
ACM-SGC-289.01 ± 0.6Revisiting Heterophily For Graph Neural Networks
WRGAT88.52 ± 0.92Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns
LINKX87.86 ± 0.77Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
GGCN89.15 ± 0.37Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks
Geom-GCN89.95 ± 0.47Geom-GCN: Geometric Graph Convolutional Networks
ACMII-GCN89.89 ± 0.43Revisiting Heterophily For Graph Neural Networks
GPRGCN87.54 ± 0.38Adaptive Universal Generalized PageRank Graph Neural Network
NLMLP 88.2 ± 0.5Non-Local Graph Neural Networks
H2GCN89.49 ± 0.38Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs
0 of 26 row(s) selected.