{"task":"Node Classification","dataset":"Cora with Public Split: fixed 20 nodes per class","metric_names":["Accuracy"],"rows":[{"id":97163,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"OGC","metrics":{"Accuracy":"86.9%"},"paper_url":"https://arxiv.org/abs/2309.13599v2","paper_title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","paper_date":"2023-09-24","code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97164,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GCN-TV","metrics":{"Accuracy":"86.3%"},"paper_url":"https://arxiv.org/abs/2307.00222v1","paper_title":"Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion Functionals","paper_date":"2023-07-01","code_links":[{"title":"Dandy5721/GNN-PDE-COV","url":"https://github.com/Dandy5721/GNN-PDE-COV"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97165,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GCNII","metrics":{"Accuracy":"85.5%"},"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":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97166,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GRAND","metrics":{"Accuracy":"85.4 ± 0.4"},"paper_url":"https://arxiv.org/abs/2005.11079v4","paper_title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","paper_date":"2020-05-22","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grand"},{"title":"Grand20/grand","url":"https://github.com/Grand20/grand"},{"title":"zjunet/dropmessage","url":"https://github.com/zjunet/dropmessage"},{"title":"luckytiger123/dropmessage","url":"https://github.com/luckytiger123/dropmessage"},{"title":"hengruizhang98/GRAND","url":"https://github.com/hengruizhang98/GRAND"},{"title":"junzhuang-code/lindt","url":"https://github.com/junzhuang-code/lindt"},{"title":"junzhuang-code/graphss","url":"https://github.com/junzhuang-code/graphss"},{"title":"vapene/Graph-Random-Neural-Networks-for-Semi-Supervised-Learning-on-Graphs","url":"https://github.com/vapene/Graph-Random-Neural-Networks-for-Semi-Supervised-Learning-on-Graphs"},{"title":"MindSpore-scientific/code-1","url":"https://github.com/MindSpore-scientific/code-1/tree/main/rand_conv-master"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97167,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"CPF-ind-APPNP","metrics":{"Accuracy":"85.3%"},"paper_url":"https://arxiv.org/abs/2103.02885v1","paper_title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","paper_date":"2021-03-04","code_links":[{"title":"BUPT-GAMMA/CPF","url":"https://github.com/BUPT-GAMMA/CPF"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97168,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GCN","metrics":{"Accuracy":"85.1 ± 0.7"},"paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_date":"2024-06-13","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97169,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"AIR-GCN","metrics":{"Accuracy":"84.7%"},"paper_url":"https://arxiv.org/abs/1911.01731v3","paper_title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","paper_date":"2019-11-05","code_links":[{"title":"CRIPAC-DIG/GraphAIR","url":"https://github.com/CRIPAC-DIG/GraphAIR"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97170,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"H-GCN","metrics":{"Accuracy":"84.5%"},"paper_url":"https://arxiv.org/abs/1902.06667v4","paper_title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","paper_date":"2019-02-13","code_links":[{"title":"CRIPAC-DIG/H-GCN","url":"https://github.com/CRIPAC-DIG/H-GCN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97171,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"DAGNN (Ours)","metrics":{"Accuracy":"84.4 ± 0.5"},"paper_url":"https://arxiv.org/abs/2007.09296v1","paper_title":"Towards Deeper Graph Neural Networks","paper_date":"2020-07-18","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/dagnn"},{"title":"mengliu1998/DeeperGNN","url":"https://github.com/mengliu1998/DeeperGNN"},{"title":"divelab/DeeperGNN","url":"https://github.com/divelab/DeeperGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97172,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"G-APPNP","metrics":{"Accuracy":"84.31%"},"paper_url":"https://arxiv.org/abs/1910.12241v2","paper_title":"Pre-train and Learn: Preserve Global Information for Graph Neural Networks","paper_date":"2019-10-27","code_links":[{"title":"zhudanhao/g-gnn","url":"https://github.com/zhudanhao/g-gnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97173,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"SuperGAT MX","metrics":{"Accuracy":"84.3%"},"paper_url":"https://arxiv.org/abs/2204.04879v1","paper_title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","paper_date":"2022-04-11","code_links":[{"title":"pyg-team/pytorch_geometric","url":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/conv/supergat_conv.py"},{"title":"dongkwan-kim/SuperGAT","url":"https://github.com/dongkwan-kim/SuperGAT"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97174,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"DSGCN","metrics":{"Accuracy":"84.2%"},"paper_url":"https://arxiv.org/abs/2003.11702v1","paper_title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","paper_date":"2020-03-26","code_links":[{"title":"balcilar/Spectral-Designed-Graph-Convolutions","url":"https://github.com/balcilar/Spectral-Designed-Graph-Convolutions"},{"title":"sidneyarcidiacono/UnderstandingGCNs","url":"https://github.com/sidneyarcidiacono/UnderstandingGCNs"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97175,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"LDS-GNN","metrics":{"Accuracy":"84.1%"},"paper_url":"https://arxiv.org/abs/1903.11960v4","paper_title":"Learning Discrete Structures for Graph Neural Networks","paper_date":"2019-03-28","code_links":[{"title":"lucfra/LDS","url":"https://github.com/lucfra/LDS"},{"title":"lucfra/LDS-GNN","url":"https://github.com/lucfra/LDS-GNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97176,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GraphMix","metrics":{"Accuracy":"83.94 ± 0.57"},"paper_url":"https://arxiv.org/abs/1909.11715v3","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_date":"2019-09-25","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97177,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GraphMix (GCN)","metrics":{"Accuracy":"83.94 ± 0.57"},"paper_url":"https://arxiv.org/abs/1909.11715v3","paper_title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","paper_date":"2019-09-25","code_links":[{"title":"vikasverma1077/GraphMix","url":"https://github.com/vikasverma1077/GraphMix"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97178,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GCN+GAugO","metrics":{"Accuracy":"83.6 ± 0.5%"},"paper_url":"https://arxiv.org/abs/2006.06830v2","paper_title":"Data Augmentation for Graph Neural Networks","paper_date":"2020-06-11","code_links":[{"title":"zhao-tong/GAug","url":"https://github.com/zhao-tong/GAug"},{"title":"andyjzhao/wsdm23-gsr","url":"https://github.com/andyjzhao/wsdm23-gsr"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97179,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GGCM","metrics":{"Accuracy":"83.6%"},"paper_url":"https://arxiv.org/abs/2309.13599v2","paper_title":"From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited","paper_date":"2023-09-24","code_links":[{"title":"zhengwang100/ogc_ggcm","url":"https://github.com/zhengwang100/ogc_ggcm"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97180,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"Snowball (linear)","metrics":{"Accuracy":"83.26%"},"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":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97181,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GAT+PGN","metrics":{"Accuracy":"83.26 ± 0.69%"},"paper_url":"https://arxiv.org/abs/2306.09121v1","paper_title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","paper_date":"2023-06-15","code_links":[{"title":"foisunt/fmms-in-gnns","url":"https://github.com/foisunt/fmms-in-gnns"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97182,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"Snowball (tanh)","metrics":{"Accuracy":"83.19%"},"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":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97183,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"Truncated Krylov","metrics":{"Accuracy":"83.16%"},"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":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97184,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GEM","metrics":{"Accuracy":"83.05%"},"paper_url":"https://arxiv.org/abs/2305.19502v1","paper_title":"Graph Entropy Minimization for Semi-supervised Node Classification","paper_date":"2023-05-31","code_links":[{"title":"cf020031308/gem","url":"https://github.com/cf020031308/gem"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97185,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GAT","metrics":{"Accuracy":"83.0 ± 0.7%"},"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":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97186,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"G3NN","metrics":{"Accuracy":"82.9%"},"paper_url":"https://arxiv.org/abs/1905.10769v2","paper_title":"A Flexible Generative Framework for Graph-based Semi-supervised Learning","paper_date":"2019-05-26","code_links":[{"title":"jiaqima/G3NN","url":"https://github.com/jiaqima/G3NN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97187,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"SSP","metrics":{"Accuracy":"82.84 ± 0.87%"},"paper_url":"https://arxiv.org/abs/2008.09624v1","paper_title":"Optimization of Graph Neural Networks with Natural Gradient Descent","paper_date":"2020-08-21","code_links":[{"title":"russellizadi/ssp","url":"https://github.com/russellizadi/ssp"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97188,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"CoLinkDist","metrics":{"Accuracy":"81.39%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97189,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"CoLinkDistMLP","metrics":{"Accuracy":"81.19%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97190,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"LinkDist","metrics":{"Accuracy":"81.05%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97191,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"LinkDistMLP","metrics":{"Accuracy":"80.79%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97192,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"AdaLanczosNet","metrics":{"Accuracy":"80.4 ± 1.1"},"paper_url":"https://arxiv.org/abs/1901.01484v2","paper_title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","paper_date":"2019-01-06","code_links":[{"title":"lrjconan/LanczosNetwork","url":"https://github.com/lrjconan/LanczosNetwork"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97193,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"DCNN","metrics":{"Accuracy":"79.7%"},"paper_url":"http://arxiv.org/abs/1511.02136v6","paper_title":"Diffusion-Convolutional Neural Networks","paper_date":"2015-11-06","code_links":[{"title":"jcatw/dcnn","url":"https://github.com/jcatw/dcnn"},{"title":"RicardoZiTseng/dcnn-tensorflow","url":"https://github.com/RicardoZiTseng/dcnn-tensorflow"},{"title":"MindSpore-paper-code-3/code6","url":"https://github.com/MindSpore-paper-code-3/code6/tree/main/3dcnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97194,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"LanczosNet","metrics":{"Accuracy":"79.5 ± 1.8"},"paper_url":"https://arxiv.org/abs/1901.01484v2","paper_title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","paper_date":"2019-01-06","code_links":[{"title":"lrjconan/LanczosNetwork","url":"https://github.com/lrjconan/LanczosNetwork"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97195,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"ChebyNet","metrics":{"Accuracy":"78.0%"},"paper_url":"http://arxiv.org/abs/1606.09375v3","paper_title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","paper_date":"2016-06-30","code_links":[{"title":"mdeff/cnn_graph","url":"https://github.com/mdeff/cnn_graph"},{"title":"hazdzz/ChebyNet","url":"https://github.com/hazdzz/ChebyNet"},{"title":"selmiss/gp-tlstgcn","url":"https://github.com/selmiss/gp-tlstgcn"},{"title":"mdeff/paper-cnn-graph-nips2016","url":"https://github.com/mdeff/paper-cnn-graph-nips2016"},{"title":"ajbisberg/gcn","url":"https://github.com/ajbisberg/gcn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97196,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GGNN","metrics":{"Accuracy":"77.6%"},"paper_url":"http://arxiv.org/abs/1511.05493v4","paper_title":"Gated Graph Sequence Neural Networks","paper_date":"2015-11-17","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ggnn"},{"title":"Microsoft/gated-graph-neural-network-samples","url":"https://github.com/Microsoft/gated-graph-neural-network-samples"},{"title":"chingyaoc/ggnn.pytorch","url":"https://github.com/chingyaoc/ggnn.pytorch"},{"title":"JamesChuanggg/ggnn.pytorch","url":"https://github.com/JamesChuanggg/ggnn.pytorch"},{"title":"yujiali/ggnn","url":"https://github.com/yujiali/ggnn"},{"title":"messi-q/gnnscvuldetector","url":"https://github.com/messi-q/gnnscvuldetector"},{"title":"Microsoft/graph-partition-neural-network-samples","url":"https://github.com/Microsoft/graph-partition-neural-network-samples"},{"title":"bdqnghi/bi-tbcnn","url":"https://github.com/bdqnghi/bi-tbcnn"},{"title":"entslscheia/GGNN_Reasoning","url":"https://github.com/entslscheia/GGNN_Reasoning"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gated_graph_conv.py"},{"title":"aszot/ggnn","url":"https://github.com/aszot/ggnn"},{"title":"vntchain/gnnscvuldetector","url":"https://github.com/vntchain/gnnscvuldetector"},{"title":"fau-is/grm","url":"https://github.com/fau-is/grm"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97197,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GCN-FP","metrics":{"Accuracy":"74.6%"},"paper_url":"http://arxiv.org/abs/1509.09292v2","paper_title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","paper_date":"2015-09-30","code_links":[{"title":"HIPS/neural-fingerprint","url":"https://github.com/HIPS/neural-fingerprint"},{"title":"debbiemarkslab/neural-fingerprint-theano","url":"https://github.com/debbiemarkslab/neural-fingerprint-theano"},{"title":"nrel/m2p","url":"https://github.com/nrel/m2p"},{"title":"pgniewko/solubility","url":"https://github.com/pgniewko/solubility"},{"title":"kimisyo/simple-GCN","url":"https://github.com/kimisyo/simple-GCN"},{"title":"SystemicCypher/Neural-Molecule-Fingerprints","url":"https://github.com/SystemicCypher/Neural-Molecule-Fingerprints"},{"title":"Sarikaya-Lab-GEMSEC/Peptide_Graph_Autograd","url":"https://github.com/Sarikaya-Lab-GEMSEC/Peptide_Graph_Autograd"},{"title":"onakanob/Peptide_Graph_Autograd","url":"https://github.com/onakanob/Peptide_Graph_Autograd"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97198,"task":"Node Classification","parent_task":null,"dataset":"Cora with Public Split: fixed 20 nodes per class","model_name":"GraphSAGE","metrics":{"Accuracy":"74.5%"},"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":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}