Node Classification On Texas 60 20 20 Random

1:1 Accuracy

평가 결과

이 벤치마크에서 각 모델의 성능 결과

		Paper Title
ACM-GCN++	96.56 ± 2	Revisiting Heterophily For Graph Neural Networks
ACM-Snowball-2	95.74 ± 2.22	Revisiting Heterophily For Graph Neural Networks
ACMII-GCN+	95.41 ± 2.82	Revisiting Heterophily For Graph Neural Networks
ACMII-Snowball-2	95.25 ± 1.55	Revisiting Heterophily For Graph Neural Networks
ACMII-GCN	95.08 ± 2.07	Revisiting Heterophily For Graph Neural Networks
ACM-GCN+	94.92 ± 2.79	Revisiting Heterophily For Graph Neural Networks
ACMII-Snowball-3	94.75 ± 3.09	Revisiting Heterophily For Graph Neural Networks
ACMII-GCN++	94.75 ± 2.91	Revisiting Heterophily For Graph Neural Networks
ACM-Snowball-3	94.75 ± 2.41	Revisiting Heterophily For Graph Neural Networks
NFGNN	94.03±0.82	Node-oriented Spectral Filtering for Graph Neural Networks
ACM-SGC-1	93.61 ± 1.55	Revisiting Heterophily For Graph Neural Networks
ACM-SGC-2	93.44 ± 2.54	Revisiting Heterophily For Graph Neural Networks
ACM-GCNII*	93.28 ± 2.79	Revisiting Heterophily For Graph Neural Networks
BernNet	93.12 ± 0.65	BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation
GPRGNN	92.92 ± 0.61	Adaptive Universal Generalized PageRank Graph Neural Network
ACM-GCNII	92.46 ± 1.97	Revisiting Heterophily For Graph Neural Networks
MLP-2	92.26 ± 0.71	Revisiting Heterophily For Graph Neural Networks
APPNP	91.18 ± 0.70	Predict then Propagate: Graph Neural Networks meet Personalized PageRank
FAGCN	88.85 ± 4.39	Beyond Low-frequency Information in Graph Convolutional Networks
GCNII*	88.52 ± 3.02	Simple and Deep Graph Convolutional Networks

0 of 36 row(s) selected.