Node Classification On Non Homophilic 10

Metrics

1:1 Accuracy

Results

Performance results of various models on this benchmark

		Paper Title
NLMLP	37.9 ± 1.3	Non-Local Graph Neural Networks
O(d)-NSD	37.81 ± 1.15	Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs
Gen-NSD	37.80 ± 1.22	Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs
Diag-NSD	37.79 ± 1.01	Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs
GloGNN++	37.70 ± 1.40	Finding Global Homophily in Graph Neural Networks When Meeting Heterophily
GGCN	37.54 ± 1.56	Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks
GCNII	37.44 ± 1.30	Simple and Deep Graph Convolutional Networks
GloGNN	37.35 ± 1.30	Finding Global Homophily in Graph Neural Networks When Meeting Heterophily
ACM-GCN++	37.31 ± 1.09	Revisiting Heterophily For Graph Neural Networks
ACMII-GCN++	37.09 ± 1.32	Revisiting Heterophily For Graph Neural Networks
Deformable GCN	37.07±0.79	Deformable Graph Convolutional Networks
ACM-GCN	36.63 ± 0.84	Revisiting Heterophily For Graph Neural Networks
WRGAT	36.53 ± 0.77	Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns
ACMII-GCN	36.31 ± 1.2	Revisiting Heterophily For Graph Neural Networks
ACM-GCN+	36.26 ± 1.34	Revisiting Heterophily For Graph Neural Networks
ACMII-GCN+	36.14 ± 1.44	Revisiting Heterophily For Graph Neural Networks
LINKX	36.10 ± 1.55	Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
ACM-SGC-2	36.04 ± 0.83	Revisiting Heterophily For Graph Neural Networks
H2GCN	35.70 ± 1.00	Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs
ACM-SGC-1	35.49 ± 1.06	Revisiting Heterophily For Graph Neural Networks

0 of 26 row(s) selected.

Command Palette

Node Classification On Non Homophilic 10

Metrics

Results