{"task":"Node Classification","dataset":"Squirrel (60%/20%/20% random splits)","metric_names":["1:1 Accuracy"],"rows":[{"id":96482,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"GNNDLD","metrics":{"1:1 Accuracy":"77.72±0.84 "},"paper_url":"https://www.scitepress.org/Papers/2024/123214/","paper_title":"GNNDLD: Graph Neural Network with Directional Label Distribution","paper_date":"2024-02-26","code_links":[],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96483,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACMII-GCN++","metrics":{"1:1 Accuracy":"69.98 ± 1.53"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96484,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACMII-GCN+","metrics":{"1:1 Accuracy":"69.81 ± 1.11"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96485,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACM-GCN+","metrics":{"1:1 Accuracy":"69.26 ± 1.11"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96486,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACM-GCN++","metrics":{"1:1 Accuracy":"68.56 ± 1.33"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96487,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"NFGNN","metrics":{"1:1 Accuracy":"58.9±0.35"},"paper_url":"https://arxiv.org/abs/2212.03654v3","paper_title":"Node-oriented Spectral Filtering for Graph Neural Networks","paper_date":"2022-12-07","code_links":[{"title":"SsGood/NFGNN","url":"https://github.com/SsGood/NFGNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96488,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACM-Snowball-2","metrics":{"1:1 Accuracy":"55.97 ± 2.03"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96489,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACM-Snowball-3","metrics":{"1:1 Accuracy":"55.73 ± 2.39"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96490,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACMII-GCN","metrics":{"1:1 Accuracy":"54.53 ± 2.09"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96491,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACMII-Snowball-2","metrics":{"1:1 Accuracy":"53.48 ± 0.6"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96492,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"GCN+JK","metrics":{"1:1 Accuracy":"53.40 ± 1.90"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96493,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACMII-Snowball-3","metrics":{"1:1 Accuracy":"52.31 ± 1.57"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96494,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":" GAT+JK","metrics":{"1:1 Accuracy":"52.28 ± 3.61"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96495,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"BernNet","metrics":{"1:1 Accuracy":"51.35 ± 0.73"},"paper_url":"https://arxiv.org/abs/2106.10994v3","paper_title":"BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation","paper_date":"2021-06-21","code_links":[{"title":"ivam-he/BernNet","url":"https://github.com/ivam-he/BernNet"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96496,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"GPRGNN","metrics":{"1:1 Accuracy":"49.93 ± 0.53"},"paper_url":"https://arxiv.org/abs/2006.07988v6","paper_title":"Adaptive Universal Generalized PageRank Graph Neural Network","paper_date":"2020-06-14","code_links":[{"title":"jianhao2016/GPRGNN","url":"https://github.com/jianhao2016/GPRGNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96497,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"Snowball-3","metrics":{"1:1 Accuracy":"48.25 ± 0.94"},"paper_url":"https://arxiv.org/abs/1906.02174v3","paper_title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","paper_date":"2019-06-05","code_links":[{"title":"PwnerHarry/Stronger_GCN","url":"https://github.com/PwnerHarry/Stronger_GCN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96498,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"Snowball-2","metrics":{"1:1 Accuracy":"47.88 ± 1.23"},"paper_url":"https://arxiv.org/abs/1906.02174v3","paper_title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","paper_date":"2019-06-05","code_links":[{"title":"PwnerHarry/Stronger_GCN","url":"https://github.com/PwnerHarry/Stronger_GCN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96499,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"SGC-1","metrics":{"1:1 Accuracy":"47.62 ± 1.27"},"paper_url":"https://arxiv.org/abs/1902.07153v2","paper_title":"Simplifying Graph Convolutional Networks","paper_date":"2019-02-19","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sgc"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/sgc"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/sgc"},{"title":"Tiiiger/SGC","url":"https://github.com/Tiiiger/SGC"},{"title":"ydtydr/hyla","url":"https://github.com/ydtydr/hyla"},{"title":"changminwu/expandergnn","url":"https://github.com/changminwu/expandergnn"},{"title":"hazdzz/SGC","url":"https://github.com/hazdzz/SGC"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96500,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"HH-GCN","metrics":{"1:1 Accuracy":"47.19 ± 1.21"},"paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_date":"2023-08-17","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96501,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACM-SGC-1","metrics":{"1:1 Accuracy":"46.4 ± 1.13"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96502,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"HH-GAT","metrics":{"1:1 Accuracy":"46.35 ± 1.86"},"paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_date":"2023-08-17","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96503,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"HH-GraphSAGE","metrics":{"1:1 Accuracy":"45.25 ± 1.52"},"paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","paper_date":"2023-08-17","code_links":[{"title":"nerdslab/halfhop","url":"https://github.com/nerdslab/halfhop"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96504,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"GCN","metrics":{"1:1 Accuracy":"44.76 ± 1.39"},"paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","paper_date":"2016-09-09","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gcn"},{"title":"tkipf/gcn","url":"https://github.com/tkipf/gcn"},{"title":"tkipf/pygcn","url":"https://github.com/tkipf/pygcn"},{"title":"tkipf/keras-gcn","url":"https://github.com/tkipf/keras-gcn"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"deepchem/moleculenet","url":"https://github.com/deepchem/moleculenet"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"tk-rusch/graphcon","url":"https://github.com/tk-rusch/graphcon"},{"title":"jiangboahu/glcn-tf","url":"https://github.com/jiangboahu/glcn-tf"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"mahsa91/RA-GCN","url":"https://github.com/mahsa91/RA-GCN"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"emartinezs44/SparkGCN","url":"https://github.com/emartinezs44/SparkGCN"},{"title":"yanhuchen/quantum-graph-convolutional-network","url":"https://github.com/yanhuchen/quantum-graph-convolutional-network"},{"title":"HamzaGbada/GCN-Numpy","url":"https://github.com/HamzaGbada/GCN-Numpy"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"cybermonic/cage-4-submission","url":"https://github.com/cybermonic/cage-4-submission"},{"title":"mahsa91/GKD","url":"https://github.com/mahsa91/GKD"},{"title":"selmiss/gp-tlstgcn","url":"https://github.com/selmiss/gp-tlstgcn"},{"title":"hazdzz/GCN","url":"https://github.com/hazdzz/GCN"},{"title":"abi-kothapalli/minimumdominatingsets","url":"https://github.com/abi-kothapalli/minimumdominatingsets"},{"title":"tuananh0305/GCN_ANOMALY_DETECTION","url":"https://github.com/tuananh0305/GCN_ANOMALY_DETECTION"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"negarhdr/PGCN","url":"https://github.com/negarhdr/PGCN"},{"title":"ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS","url":"https://github.com/ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS"},{"title":"bcsrn/gcn","url":"https://github.com/bcsrn/gcn"},{"title":"yCobanoglu/infinite-width-gnns","url":"https://github.com/yCobanoglu/infinite-width-gnns"},{"title":"sunxiaobei/mindspore_gallery","url":"https://github.com/sunxiaobei/mindspore_gallery/tree/main/grl/gcn"},{"title":"kiharalab/gnn_pocket","url":"https://github.com/kiharalab/gnn_pocket"},{"title":"ykrmm/sota_gnn","url":"https://github.com/ykrmm/sota_gnn"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/ascend_gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/gpu_gcn"},{"title":"30Aniket/Graph-Convolutional-Networks-GCNs","url":"https://github.com/30Aniket/Graph-Convolutional-Networks-GCNs"},{"title":"zhiqiang00/Hon-GCN","url":"https://github.com/zhiqiang00/Hon-GCN"},{"title":"clin366/pygcn","url":"https://github.com/clin366/pygcn"},{"title":"nieci2024/pyglcn","url":"https://github.com/nieci2024/pyglcn"},{"title":"mahendrathapa/graph-convolution-network","url":"https://github.com/mahendrathapa/graph-convolution-network"},{"title":"yangjun1994/CAGCN","url":"https://github.com/yangjun1994/CAGCN"},{"title":"darnbi/pygcn","url":"https://github.com/darnbi/pygcn"},{"title":"1075225782/GCN","url":"https://github.com/1075225782/GCN"},{"title":"udlf/wsef","url":"https://github.com/udlf/wsef"},{"title":"thanhtrunghuynh93/pygcn","url":"https://github.com/thanhtrunghuynh93/pygcn"},{"title":"KimMeen/GCN","url":"https://github.com/KimMeen/GCN"},{"title":"LouisDumont/GCN---re-implementation","url":"https://github.com/LouisDumont/GCN---re-implementation"},{"title":"bepping/non-oversmoothing-gcns","url":"https://github.com/bepping/non-oversmoothing-gcns"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"},{"title":"HoganZhang/pygcn_python3","url":"https://github.com/HoganZhang/pygcn_python3"},{"title":"asif-salim/GCN-Graph_Convolutional_Network","url":"https://github.com/asif-salim/GCN-Graph_Convolutional_Network"},{"title":"2023-MindSpore-1/ms-code-11","url":"https://github.com/2023-MindSpore-1/ms-code-11/tree/main/gcn"},{"title":"ajbisberg/gcn","url":"https://github.com/ajbisberg/gcn"},{"title":"lipingcoding/pygcn","url":"https://github.com/lipingcoding/pygcn"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96505,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"GAT","metrics":{"1:1 Accuracy":"42.72 ± 0.33"},"paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","paper_date":"2017-10-30","code_links":[{"title":"labmlai/annotated_deep_learning_paper_implementations","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gat"},{"title":"PetarV-/GAT","url":"https://github.com/PetarV-/GAT"},{"title":"Diego999/pyGAT","url":"https://github.com/Diego999/pyGAT"},{"title":"gordicaleksa/pytorch-GAT","url":"https://github.com/gordicaleksa/pytorch-GAT"},{"title":"shenweichen/GraphNeuralNetwork","url":"https://github.com/shenweichen/GraphNeuralNetwork"},{"title":"HazyResearch/hgcn","url":"https://github.com/HazyResearch/hgcn"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"danielegrattarola/keras-gat","url":"https://github.com/danielegrattarola/keras-gat"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/gnn/gat"},{"title":"Kaimaoge/IGNNK","url":"https://github.com/Kaimaoge/IGNNK"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zhao-tong/GNNs-easy-to-use","url":"https://github.com/zhao-tong/GNNs-easy-to-use"},{"title":"davidpicard/homm","url":"https://github.com/davidpicard/homm"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"snowkylin/gnn","url":"https://github.com/snowkylin/gnn"},{"title":"akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network","url":"https://github.com/akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"weiyangfb/PyTorchSparseGAT","url":"https://github.com/weiyangfb/PyTorchSparseGAT"},{"title":"HeapHop30/graph-attention-nets","url":"https://github.com/HeapHop30/graph-attention-nets"},{"title":"marblet/GNN_models_pytorch_geometric","url":"https://github.com/marblet/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch_geometric","url":"https://github.com/marble0117/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch","url":"https://github.com/marble0117/GNN_models_pytorch"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"ds4dm/sGat","url":"https://github.com/ds4dm/sGat"},{"title":"ds4dm/sparse-gcn","url":"https://github.com/ds4dm/sparse-gcn"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"marblet/gat-pytorch","url":"https://github.com/marblet/gat-pytorch"},{"title":"ydzhang-stormstout/HAT","url":"https://github.com/ydzhang-stormstout/HAT"},{"title":"gcucurull/jax-gat","url":"https://github.com/gcucurull/jax-gat"},{"title":"calciver/Graph-Attention-Networks","url":"https://github.com/calciver/Graph-Attention-Networks"},{"title":"shi27feng/transformers.satisfy","url":"https://github.com/shi27feng/transformers.satisfy"},{"title":"pengsl-lab/mssl","url":"https://github.com/pengsl-lab/mssl"},{"title":"pengsl-lab/mssl2drug","url":"https://github.com/pengsl-lab/mssl2drug"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"taishan1994/pytorch_gat","url":"https://github.com/taishan1994/pytorch_gat"},{"title":"wan2000/mc-mot","url":"https://github.com/wan2000/mc-mot"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"dmeoli/neuro-sat","url":"https://github.com/dmeoli/neuro-sat"},{"title":"liu6zijian/simplified-gcn-model","url":"https://github.com/liu6zijian/simplified-gcn-model"},{"title":"tatp22/pytorch-fast-GAT","url":"https://github.com/tatp22/pytorch-fast-GAT"},{"title":"noahtren/Graph-Attention-Networks-TensorFlow-2","url":"https://github.com/noahtren/Graph-Attention-Networks-TensorFlow-2"},{"title":"yururyuru00/GAT_pyG","url":"https://github.com/yururyuru00/GAT_pyG"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"gayanku/FDGATII","url":"https://github.com/gayanku/FDGATII"},{"title":"Yindong-Zhang/myGAT","url":"https://github.com/Yindong-Zhang/myGAT"},{"title":"giuseppefutia/link-prediction-code","url":"https://github.com/giuseppefutia/link-prediction-code"},{"title":"Aveek-Saha/Graph-Attention-Net","url":"https://github.com/Aveek-Saha/Graph-Attention-Net"},{"title":"BIG-S2/keras-gnm","url":"https://github.com/BIG-S2/keras-gnm"},{"title":"mlzxzhou/keras-gnm","url":"https://github.com/mlzxzhou/keras-gnm"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"abhilash1910/GraphAttentionNetworks","url":"https://github.com/abhilash1910/GraphAttentionNetworks"},{"title":"Kristof-Neys/GAT_Neo4j_DGL","url":"https://github.com/Kristof-Neys/GAT_Neo4j_DGL"},{"title":"ak24watch/Graph-Deeplearning-GAT","url":"https://github.com/ak24watch/Graph-Deeplearning-GAT"},{"title":"Negus25/GAT-Mindspore","url":"https://github.com/Negus25/GAT-Mindspore"},{"title":"ChengyuSun/gat","url":"https://github.com/ChengyuSun/gat"},{"title":"joaopedromattos/gnee","url":"https://github.com/joaopedromattos/gnee"},{"title":"mitya8128/experiments_notes","url":"https://github.com/mitya8128/experiments_notes"},{"title":"4pygmalion/GAT_tensorflow","url":"https://github.com/4pygmalion/GAT_tensorflow"},{"title":"vailatuts/SSFG-regularization","url":"https://github.com/vailatuts/SSFG-regularization"},{"title":"handasontam/GAT-with-edgewise-attention","url":"https://github.com/handasontam/GAT-with-edgewise-attention"},{"title":"Mind23-2/MindCode-4","url":"https://github.com/Mind23-2/MindCode-4/tree/main/gat"},{"title":"AngusMonroe/GAT-pytorch","url":"https://github.com/AngusMonroe/GAT-pytorch"},{"title":"fongyk/graph-attention","url":"https://github.com/fongyk/graph-attention"},{"title":"404nofound/gat","url":"https://github.com/404nofound/gat"},{"title":"ColdenChan/GAT_D","url":"https://github.com/ColdenChan/GAT_D"},{"title":"MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints","url":"https://github.com/MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints"},{"title":"bowu/GraphSearch","url":"https://github.com/bowu/GraphSearch"},{"title":"Messham87/COVID_GAT","url":"https://github.com/Messham87/COVID_GAT"},{"title":"zhangbo2008/GAT_network","url":"https://github.com/zhangbo2008/GAT_network"},{"title":"blueberryc/pyGAT","url":"https://github.com/blueberryc/pyGAT"},{"title":"anish-lu-yihe/SVRT-by-GAT","url":"https://github.com/anish-lu-yihe/SVRT-by-GAT"},{"title":"WantingZhao/my_GAT","url":"https://github.com/WantingZhao/my_GAT"},{"title":"dzb1998/pyGAT","url":"https://github.com/dzb1998/pyGAT"},{"title":"subercui/pyGConvAT","url":"https://github.com/subercui/pyGConvAT"},{"title":"YunseobShin/wiki_GAT","url":"https://github.com/YunseobShin/wiki_GAT"},{"title":"MindSpore-scientific-2/code-4","url":"https://github.com/MindSpore-scientific-2/code-4/tree/main/GR-HSTU"},{"title":"snownus/COOP","url":"https://github.com/snownus/COOP"},{"title":"ChengSashankh/trying-GAT","url":"https://github.com/ChengSashankh/trying-GAT"},{"title":"Anak2016/GAT","url":"https://github.com/Anak2016/GAT"},{"title":"whut2962575697/gat_sementic_segmentation","url":"https://github.com/whut2962575697/gat_sementic_segmentation"},{"title":"Anou9531/GAT","url":"https://github.com/Anou9531/GAT"},{"title":"PumpkinYing/GAT","url":"https://github.com/PumpkinYing/GAT"},{"title":"galkampel/HyperNetworks","url":"https://github.com/galkampel/HyperNetworks"},{"title":"tlmakinen/GAT-noise","url":"https://github.com/tlmakinen/GAT-noise"},{"title":"TyngJiunKuo/deep-learning-project","url":"https://github.com/TyngJiunKuo/deep-learning-project"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96506,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"FAGCN","metrics":{"1:1 Accuracy":"42.24 ± 1.2"},"paper_url":"https://arxiv.org/abs/2101.00797v1","paper_title":"Beyond Low-frequency Information in Graph Convolutional Networks","paper_date":"2021-01-04","code_links":[{"title":"bdy9527/FAGCN","url":"https://github.com/bdy9527/FAGCN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96507,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"GraphSAGE","metrics":{"1:1 Accuracy":"41.26 ± 0.26"},"paper_url":"http://arxiv.org/abs/1706.02216v4","paper_title":"Inductive Representation Learning on Large Graphs","paper_date":"2017-06-07","code_links":[{"title":"pyg-team/pytorch_geometric","url":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/models/basic_gnn.py"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/graphsage"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"williamleif/GraphSAGE","url":"https://github.com/williamleif/GraphSAGE"},{"title":"stellargraph/stellargraph","url":"https://github.com/stellargraph/stellargraph"},{"title":"twjiang/graphSAGE-pytorch","url":"https://github.com/twjiang/graphSAGE-pytorch"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"weiyinwei/mmgcn","url":"https://github.com/weiyinwei/mmgcn"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"weiyinwei/huign","url":"https://github.com/weiyinwei/huign"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"pmlg/pytorch_GCN","url":"https://github.com/pmlg/pytorch_GCN"},{"title":"chatterjeeayan/upna","url":"https://github.com/chatterjeeayan/upna"},{"title":"Arvidsmile/InductiveDialogueGraph","url":"https://github.com/Arvidsmile/InductiveDialogueGraph"},{"title":"silent-code/deep-trace","url":"https://github.com/silent-code/deep-trace"},{"title":"erfmah/answering_graph_queries","url":"https://github.com/erfmah/answering_graph_queries"},{"title":"hmcreamer/hackRice19","url":"https://github.com/hmcreamer/hackRice19"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96508,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"SGC-2","metrics":{"1:1 Accuracy":"41.25 ± 1.4"},"paper_url":"https://arxiv.org/abs/1902.07153v2","paper_title":"Simplifying Graph Convolutional Networks","paper_date":"2019-02-19","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sgc"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/sgc"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/sgc"},{"title":"Tiiiger/SGC","url":"https://github.com/Tiiiger/SGC"},{"title":"ydtydr/hyla","url":"https://github.com/ydtydr/hyla"},{"title":"changminwu/expandergnn","url":"https://github.com/changminwu/expandergnn"},{"title":"hazdzz/SGC","url":"https://github.com/hazdzz/SGC"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96509,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACM-SGC-2","metrics":{"1:1 Accuracy":"40.91 ± 1.39"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96510,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACM-GCNII","metrics":{"1:1 Accuracy":"40.9 ± 1.58"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96511,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"GCNII","metrics":{"1:1 Accuracy":"38.81 ± 1.97"},"paper_url":"https://arxiv.org/abs/2007.02133v1","paper_title":"Simple and Deep Graph Convolutional Networks","paper_date":"2020-07-04","code_links":[{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv"},{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"tyxxzjpdez/GCNII-DropGroups","url":"https://github.com/tyxxzjpdez/GCNII-DropGroups"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96512,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"ACM-GCNII*","metrics":{"1:1 Accuracy":"38.32 ± 1.5"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96513,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"GCNII*","metrics":{"1:1 Accuracy":"38.31 ±  1.3"},"paper_url":"https://arxiv.org/abs/2007.02133v1","paper_title":"Simple and Deep Graph Convolutional Networks","paper_date":"2020-07-04","code_links":[{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv"},{"title":"chennnM/GCNII","url":"https://github.com/chennnM/GCNII"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"tyxxzjpdez/GCNII-DropGroups","url":"https://github.com/tyxxzjpdez/GCNII-DropGroups"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96514,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"Geom-GCN*","metrics":{"1:1 Accuracy":"38.14"},"paper_url":"https://arxiv.org/abs/2002.05287v2","paper_title":"Geom-GCN: Geometric Graph Convolutional Networks","paper_date":"2020-02-13","code_links":[{"title":"bingzhewei/geom-gcn","url":"https://github.com/bingzhewei/geom-gcn"},{"title":"graphdml-uiuc-jlu/geom-gcn","url":"https://github.com/graphdml-uiuc-jlu/geom-gcn"},{"title":"alexfanjn/geomgcn_pyg","url":"https://github.com/alexfanjn/geomgcn_pyg"},{"title":"KAIDI3270/Geom_GCN_pytorch_implementation","url":"https://github.com/KAIDI3270/Geom_GCN_pytorch_implementation"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96515,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"APPNP","metrics":{"1:1 Accuracy":"34.77 ± 0.34"},"paper_url":"https://arxiv.org/abs/1810.05997v6","paper_title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","paper_date":"2018-10-14","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/appnp"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/appnp"},{"title":"benedekrozemberczki/APPNP","url":"https://github.com/benedekrozemberczki/APPNP"},{"title":"klicperajo/ppnp","url":"https://github.com/klicperajo/ppnp"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/appnp"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96516,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"MLP-2","metrics":{"1:1 Accuracy":"31.28 ± 0.27"},"paper_url":"https://arxiv.org/abs/2210.07606v1","paper_title":"Revisiting Heterophily For Graph Neural Networks","paper_date":"2022-10-14","code_links":[{"title":"SitaoLuan/ACM-GNN","url":"https://github.com/SitaoLuan/ACM-GNN"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96517,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"H2GCN","metrics":{"1:1 Accuracy":"30.39 ± 1.22"},"paper_url":"https://arxiv.org/abs/2006.11468v2","paper_title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","paper_date":"2020-06-20","code_links":[{"title":"GemsLab/H2GCN","url":"https://github.com/GemsLab/H2GCN"},{"title":"GitEventhandler/H2GCN-PyTorch","url":"https://github.com/GitEventhandler/H2GCN-PyTorch"},{"title":"sxwee/GNNsIMPL","url":"https://github.com/sxwee/GNNsIMPL/tree/main/H2GCN"},{"title":"kdd-submitter/on_local_aggregation","url":"https://github.com/kdd-submitter/on_local_aggregation"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96518,"task":"Node Classification","parent_task":null,"dataset":"Squirrel (60%/20%/20% random splits)","model_name":"MixHop","metrics":{"1:1 Accuracy":"24.55 ± 2.60"},"paper_url":"https://arxiv.org/abs/1905.00067v3","paper_title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","paper_date":"2019-04-30","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/mixhop"},{"title":"benedekrozemberczki/MixHop-and-N-GCN","url":"https://github.com/benedekrozemberczki/MixHop-and-N-GCN"},{"title":"samihaija/mixhop","url":"https://github.com/samihaija/mixhop"}],"metrics_order":"[\"1:1 Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}