{"task":"Node Classification","dataset":"PPI","metric_names":["F1","Micro-F1","Micro F1","Macro-F1"],"rows":[{"id":96942,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"g2-MLP","metrics":{"F1":"99.71"},"paper_url":"https://www.jstage.jst.go.jp/article/pjsai/JSAI2022/0/JSAI2022_1G4OS22a03/_article/-char/ja/","paper_title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","paper_date":"2022-07-11","code_links":[{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96943,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GCNII*","metrics":{"F1":"99.56"},"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":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96944,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GraphSAINT","metrics":{"F1":"99.50"},"paper_url":"https://arxiv.org/abs/1907.04931v4","paper_title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","paper_date":"2019-07-10","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/graphsaint"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"thudm/graphmae2","url":"https://github.com/thudm/graphmae2"},{"title":"GraphSAINT/GraphACT","url":"https://github.com/GraphSAINT/GraphACT"},{"title":"lt610/GraphSaint","url":"https://github.com/lt610/GraphSaint"},{"title":"xingsumq/us-defake","url":"https://github.com/xingsumq/us-defake"},{"title":"hyeamykim/GCN-related-works","url":"https://github.com/hyeamykim/GCN-related-works"},{"title":"maysambehmanesh/SGCL","url":"https://github.com/maysambehmanesh/SGCL"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96945,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"SGAS","metrics":{"F1":"99.46"},"paper_url":"https://arxiv.org/abs/1912.00195v2","paper_title":"SGAS: Sequential Greedy Architecture Search","paper_date":"2019-11-30","code_links":[{"title":"lightaime/sgas","url":"https://github.com/lightaime/sgas"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96946,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"DenseMRGCN-14","metrics":{"F1":"99.43"},"paper_url":"https://arxiv.org/abs/1910.06849v3","paper_title":"DeepGCNs: Making GCNs Go as Deep as CNNs","paper_date":"2019-10-15","code_links":[{"title":"lightaime/deep_gcns_torch","url":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb"},{"title":"lightaime/deep_gcns_torch","url":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb_eff/ogbn_arxiv_dgl"},{"title":"lightaime/deep_gcns_torch","url":"https://github.com/lightaime/deep_gcns_torch"},{"title":"lightaime/deep_gcns","url":"https://github.com/lightaime/deep_gcns"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96947,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"ResMRGCN-28","metrics":{"F1":"99.41"},"paper_url":"https://arxiv.org/abs/1910.06849v3","paper_title":"DeepGCNs: Making GCNs Go as Deep as CNNs","paper_date":"2019-10-15","code_links":[{"title":"lightaime/deep_gcns_torch","url":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb"},{"title":"lightaime/deep_gcns_torch","url":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb_eff/ogbn_arxiv_dgl"},{"title":"lightaime/deep_gcns_torch","url":"https://github.com/lightaime/deep_gcns_torch"},{"title":"lightaime/deep_gcns","url":"https://github.com/lightaime/deep_gcns"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96948,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GraphStar","metrics":{"F1":"99.4"},"paper_url":"https://arxiv.org/abs/1906.12330v1","paper_title":"Graph Star Net for Generalized Multi-Task Learning","paper_date":"2019-06-21","code_links":[{"title":"graph-star-team/graph_star","url":"https://github.com/graph-star-team/graph_star"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96949,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GCN + SAF","metrics":{"F1":"99.38 ± 0.01%"},"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":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96950,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"Cluster-GCN","metrics":{"F1":"99.36"},"paper_url":"https://arxiv.org/abs/1905.07953v2","paper_title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","paper_date":"2019-05-20","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/cluster_gcn"},{"title":"benedekrozemberczki/ClusterGCN","url":"https://github.com/benedekrozemberczki/ClusterGCN"},{"title":"qitianwu/nodeformer","url":"https://github.com/qitianwu/nodeformer"},{"title":"NIRVANALAN/ClusterGCN_google-reseach","url":"https://github.com/NIRVANALAN/ClusterGCN_google-reseach"},{"title":"zhengjingwei/cluster_GCN","url":"https://github.com/zhengjingwei/cluster_GCN"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96951,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GAT + PGN","metrics":{"F1":"99.34 ± 0.02%"},"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":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96952,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"DSGCN","metrics":{"F1":"99.09 ± 0.03"},"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":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96953,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GaAN","metrics":{"F1":"98.7"},"paper_url":"http://arxiv.org/abs/1803.07294v1","paper_title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs","paper_date":"2018-03-20","code_links":[{"title":"jennyzhang0215/GaAN","url":"https://github.com/jennyzhang0215/GaAN"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96954,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GraphNAS","metrics":{"F1":"98.6 ± 0.1"},"paper_url":"https://arxiv.org/abs/1904.09981v2","paper_title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","paper_date":"2019-04-22","code_links":[{"title":"GraphNAS/GraphNAS-simple","url":"https://github.com/GraphNAS/GraphNAS-simple"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96955,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"JK-LSTM","metrics":{"F1":"97.6"},"paper_url":"http://arxiv.org/abs/1806.03536v2","paper_title":"Representation Learning on Graphs with Jumping Knowledge Networks","paper_date":"2018-06-09","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/jknet"},{"title":"shinkyuy/representation_learning_on_graphs_with_jumping_knowledge_networks","url":"https://github.com/shinkyuy/representation_learning_on_graphs_with_jumping_knowledge_networks"},{"title":"mori97/JKNet-dgl","url":"https://github.com/mori97/JKNet-dgl"},{"title":"xnuohz/jknet-dgl","url":"https://github.com/xnuohz/jknet-dgl"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96956,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"VQ-GNN (GAT)","metrics":{"F1":"97.37"},"paper_url":"https://arxiv.org/abs/2110.14363v1","paper_title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","paper_date":"2021-10-27","code_links":[{"title":"devnkong/VQ-GNN","url":"https://github.com/devnkong/VQ-GNN"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96957,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GAT","metrics":{"F1":"97.3"},"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":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96958,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"SIGN","metrics":{"F1":"96.50"},"paper_url":"https://arxiv.org/abs/2004.11198v3","paper_title":"SIGN: Scalable Inception Graph Neural Networks","paper_date":"2020-04-23","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sign"},{"title":"twitter-research/sign","url":"https://github.com/twitter-research/sign"},{"title":"facebookresearch/NARS","url":"https://github.com/facebookresearch/NARS"},{"title":"basiralab/falcon","url":"https://github.com/basiralab/falcon"},{"title":"MindSpore-paper-code-2/code400","url":"https://github.com/MindSpore-paper-code-2/code400/tree/main/Inception/inceptionv4"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96959,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"ClusterGCN","metrics":{"F1":"92.9"},"paper_url":"https://arxiv.org/abs/1905.07953v2","paper_title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","paper_date":"2019-05-20","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/cluster_gcn"},{"title":"benedekrozemberczki/ClusterGCN","url":"https://github.com/benedekrozemberczki/ClusterGCN"},{"title":"qitianwu/nodeformer","url":"https://github.com/qitianwu/nodeformer"},{"title":"NIRVANALAN/ClusterGCN_google-reseach","url":"https://github.com/NIRVANALAN/ClusterGCN_google-reseach"},{"title":"zhengjingwei/cluster_GCN","url":"https://github.com/zhengjingwei/cluster_GCN"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96960,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"LGCN","metrics":{"F1":"77.2"},"paper_url":"http://arxiv.org/abs/1808.03965v1","paper_title":"Large-Scale Learnable Graph Convolutional Networks","paper_date":"2018-08-12","code_links":[{"title":"divelab/lgcn","url":"https://github.com/divelab/lgcn"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96961,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GRACE","metrics":{"F1":"66.2","Micro-F1":"66.2"},"paper_url":"https://arxiv.org/abs/2006.04131v2","paper_title":"Deep Graph Contrastive Representation Learning","paper_date":"2020-06-07","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grace"},{"title":"CRIPAC-DIG/GRACE","url":"https://github.com/CRIPAC-DIG/GRACE"},{"title":"ycremar/DIG-SSL","url":"https://github.com/ycremar/DIG-SSL"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96962,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"GraphSAGE","metrics":{"F1":"61.2"},"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":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96963,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"PairE","metrics":{"Micro F1":"94.83"},"paper_url":"https://arxiv.org/abs/2203.01564v1","paper_title":"Graph Representation Learning Beyond Node and Homophily","paper_date":"2022-03-03","code_links":[{"title":"syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily","url":"https://github.com/syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96964,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"node2vec","metrics":{"Macro-F1":"0.1791"},"paper_url":"http://arxiv.org/abs/1607.00653v1","paper_title":"node2vec: Scalable Feature Learning for Networks","paper_date":"2016-07-03","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/node2vec"},{"title":"shenweichen/GraphEmbedding","url":"https://github.com/shenweichen/GraphEmbedding"},{"title":"aditya-grover/node2vec","url":"https://github.com/aditya-grover/node2vec"},{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"eliorc/node2vec","url":"https://github.com/eliorc/node2vec"},{"title":"rusty1s/pytorch_cluster","url":"https://github.com/rusty1s/pytorch_cluster"},{"title":"cvg/scrstudio","url":"https://github.com/cvg/scrstudio"},{"title":"monarch-initiative/embiggen","url":"https://github.com/monarch-initiative/embiggen"},{"title":"TheJacksonLaboratory/N2V","url":"https://github.com/TheJacksonLaboratory/N2V"},{"title":"icd-codex/icd-codex","url":"https://github.com/icd-codex/icd-codex"},{"title":"razrLeLe/fastwalk","url":"https://github.com/razrLeLe/fastwalk"},{"title":"urielsinger/ctdne","url":"https://github.com/urielsinger/ctdne"},{"title":"thibaudmartinez/node2vec","url":"https://github.com/thibaudmartinez/node2vec"},{"title":"olety/TIMLinUCB","url":"https://github.com/olety/TIMLinUCB"},{"title":"fahrbach/icml-2020-faster-graph-embeddings","url":"https://github.com/fahrbach/icml-2020-faster-graph-embeddings"},{"title":"Nina-Konovalova/TSP-RL-Skoltech_project","url":"https://github.com/Nina-Konovalova/TSP-RL-Skoltech_project"},{"title":"urielsinger/fairwalk","url":"https://github.com/urielsinger/fairwalk"},{"title":"Robotmurlock/Deepwalk-and-Node2vec","url":"https://github.com/Robotmurlock/Deepwalk-and-Node2vec"},{"title":"printfer/CS6490_NetworkSecurity_FinalProject","url":"https://github.com/printfer/CS6490_NetworkSecurity_FinalProject"},{"title":"WiktorJ/msnode2vec","url":"https://github.com/WiktorJ/msnode2vec"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96965,"task":"Node Classification","parent_task":null,"dataset":"PPI","model_name":"DeepWalk","metrics":{"Macro-F1":"0.1768"},"paper_url":"http://arxiv.org/abs/1607.00653v1","paper_title":"node2vec: Scalable Feature Learning for Networks","paper_date":"2016-07-03","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/node2vec"},{"title":"shenweichen/GraphEmbedding","url":"https://github.com/shenweichen/GraphEmbedding"},{"title":"aditya-grover/node2vec","url":"https://github.com/aditya-grover/node2vec"},{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"eliorc/node2vec","url":"https://github.com/eliorc/node2vec"},{"title":"rusty1s/pytorch_cluster","url":"https://github.com/rusty1s/pytorch_cluster"},{"title":"cvg/scrstudio","url":"https://github.com/cvg/scrstudio"},{"title":"monarch-initiative/embiggen","url":"https://github.com/monarch-initiative/embiggen"},{"title":"TheJacksonLaboratory/N2V","url":"https://github.com/TheJacksonLaboratory/N2V"},{"title":"icd-codex/icd-codex","url":"https://github.com/icd-codex/icd-codex"},{"title":"razrLeLe/fastwalk","url":"https://github.com/razrLeLe/fastwalk"},{"title":"urielsinger/ctdne","url":"https://github.com/urielsinger/ctdne"},{"title":"thibaudmartinez/node2vec","url":"https://github.com/thibaudmartinez/node2vec"},{"title":"olety/TIMLinUCB","url":"https://github.com/olety/TIMLinUCB"},{"title":"fahrbach/icml-2020-faster-graph-embeddings","url":"https://github.com/fahrbach/icml-2020-faster-graph-embeddings"},{"title":"Nina-Konovalova/TSP-RL-Skoltech_project","url":"https://github.com/Nina-Konovalova/TSP-RL-Skoltech_project"},{"title":"urielsinger/fairwalk","url":"https://github.com/urielsinger/fairwalk"},{"title":"Robotmurlock/Deepwalk-and-Node2vec","url":"https://github.com/Robotmurlock/Deepwalk-and-Node2vec"},{"title":"printfer/CS6490_NetworkSecurity_FinalProject","url":"https://github.com/printfer/CS6490_NetworkSecurity_FinalProject"},{"title":"WiktorJ/msnode2vec","url":"https://github.com/WiktorJ/msnode2vec"}],"metrics_order":"[\"F1\", \"Micro-F1\", \"Micro F1\", \"Macro-F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}