{"task":"Node Classification","dataset":"Pubmed","metric_names":["Accuracy","Training Split","F1","Validation","Accuracy (%)","F1-Score","Inference Time (ms)"],"rows":[{"id":97315,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"NCGCN","metrics":{"Accuracy":"91.64 ± 0.53"},"paper_url":"https://arxiv.org/abs/2306.02285v6","paper_title":"Clarify Confused Nodes via Separated Learning","paper_date":"2023-06-04","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97316,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"NCSAGE","metrics":{"Accuracy":"91.55 ± 0.38"},"paper_url":"https://arxiv.org/abs/2306.02285v6","paper_title":"Clarify Confused Nodes via Separated Learning","paper_date":"2023-06-04","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97317,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"ACMII-Snowball-3","metrics":{"Accuracy":"91.31 ± 0.6"},"paper_url":"https://arxiv.org/abs/2109.05641v1","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","paper_date":"2021-09-12","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97318,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"ACM-GCN","metrics":{"Accuracy":"90.74 ± 0.5"},"paper_url":"https://arxiv.org/abs/2109.05641v1","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","paper_date":"2021-09-12","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97319,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Graph-MLP + SAF","metrics":{"Accuracy":"90.64 ± 0.46%"},"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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97320,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"ACMII-Snowball-2","metrics":{"Accuracy":"90.56 ± 0.39"},"paper_url":"https://arxiv.org/abs/2109.05641v1","paper_title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","paper_date":"2021-09-12","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97321,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"NodeNet","metrics":{"Accuracy":"90.21%"},"paper_url":"https://arxiv.org/abs/2006.09022v1","paper_title":"NodeNet: A Graph Regularised Neural Network for Node Classification","paper_date":"2020-06-16","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97322,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"CNMPGNN","metrics":{"Accuracy":"90.07± 0.43"},"paper_url":"https://ieeexplore.ieee.org/document/9606682","paper_title":"CN-Motifs Perceptive Graph Neural Networks","paper_date":"2021-11-15","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97323,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"CoLinkDist","metrics":{"Accuracy":"89.58%"},"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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97324,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"CoLinkDistMLP","metrics":{"Accuracy":"89.53%"},"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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97325,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"SSP","metrics":{"Accuracy":"89.36 ± 0.57"},"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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97326,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"3ference","metrics":{"Accuracy":"88.90"},"paper_url":"https://www.mdpi.com/2227-7390/10/8/1262/htm","paper_title":"Inferring from References with Differences for Semi-Supervised Node Classification on Graphs","paper_date":"2022-04-11","code_links":[{"title":"cf020031308/3ference","url":"https://github.com/cf020031308/3ference"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97327,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"SplineCNN","metrics":{"Accuracy":"88.88%"},"paper_url":"http://arxiv.org/abs/1711.08920v2","paper_title":"SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels","paper_date":"2017-11-24","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"rusty1s/pytorch_spline_conv","url":"https://github.com/rusty1s/pytorch_spline_conv"},{"title":"abhilash1910/SpectralEmbeddings","url":"https://github.com/abhilash1910/SpectralEmbeddings"},{"title":"MikelBros/Deep_Spammer_Detection_GCN","url":"https://github.com/MikelBros/Deep_Spammer_Detection_GCN"},{"title":"mikel-brostrom/Deep_Spammer_Detection_GCN","url":"https://github.com/mikel-brostrom/Deep_Spammer_Detection_GCN"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97328,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"LinkDist","metrics":{"Accuracy":"88.86%"},"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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97329,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"LinkDistMLP","metrics":{"Accuracy":"88.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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97330,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GCN + Mixup","metrics":{"Accuracy":"87.9%"},"paper_url":"https://wangywust.github.io/Paper/2021mix.pdf","paper_title":"Mixup for Node and Graph Classification","paper_date":"2021-06-01","code_links":[{"title":"vanoracai/MixupForGraph","url":"https://github.com/vanoracai/MixupForGraph"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97331,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GCN-LPA","metrics":{"Accuracy":"87.8 ± 0.6"},"paper_url":"https://arxiv.org/abs/2002.06755v1","paper_title":"Unifying Graph Convolutional Neural Networks and Label Propagation","paper_date":"2020-02-17","code_links":[{"title":"hwwang55/GCN-LPA","url":"https://github.com/hwwang55/GCN-LPA"},{"title":"achalagarwal/gcn-lpa","url":"https://github.com/achalagarwal/gcn-lpa"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97332,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"CGT","metrics":{"Accuracy":"86.86±0.12"},"paper_url":"https://arxiv.org/abs/2312.16788v1","paper_title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","paper_date":"2023-12-28","code_links":[{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97333,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GRACE","metrics":{"Accuracy":"86.7 ± 0.1"},"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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97334,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"CT-Layer (PE)","metrics":{"Accuracy":"86.07"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97335,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GNN RH-U","metrics":{"Accuracy":"86%"},"paper_url":"https://arxiv.org/abs/1906.12269v1","paper_title":"Certifiable Robustness and Robust Training for Graph Convolutional Networks","paper_date":"2019-06-28","code_links":[{"title":"danielzuegner/robust-gcn","url":"https://github.com/danielzuegner/robust-gcn"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97336,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"MMA","metrics":{"Accuracy":"86.00%"},"paper_url":"https://openreview.net/forum?id=hZ3b8CskgC","paper_title":"Multi-Mask Aggregators for Graph Neural Networks","paper_date":"2022-11-24","code_links":[{"title":"asarigun/mma","url":"https://github.com/asarigun/mma"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97337,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"DFNet-ATT","metrics":{"Accuracy":"85.2 ± 0.3"},"paper_url":"https://arxiv.org/abs/1910.10866v5","paper_title":"DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters","paper_date":"2019-10-24","code_links":[{"title":"wokas36/DFNets","url":"https://github.com/wokas36/DFNets"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97338,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GResNet(LoopyNet)","metrics":{"Accuracy":"83.0%"},"paper_url":"https://arxiv.org/abs/1909.05729v2","paper_title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","paper_date":"2019-09-12","code_links":[{"title":"anonymous-sourcecode/GResNet","url":"https://github.com/anonymous-sourcecode/GResNet"},{"title":"jwzhanggy/GResNet","url":"https://github.com/jwzhanggy/GResNet"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97339,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"PA-GNN","metrics":{"Accuracy":"82.92 ± 0.13"},"paper_url":"https://arxiv.org/abs/1908.07558v3","paper_title":"Transferring Robustness for Graph Neural Network Against Poisoning Attacks","paper_date":"2019-08-20","code_links":[{"title":"tangxianfeng/PA-GNN","url":"https://github.com/tangxianfeng/PA-GNN"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97340,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GResNet(GAT)","metrics":{"Accuracy":"82.2%"},"paper_url":"https://arxiv.org/abs/1909.05729v2","paper_title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","paper_date":"2019-09-12","code_links":[{"title":"anonymous-sourcecode/GResNet","url":"https://github.com/anonymous-sourcecode/GResNet"},{"title":"jwzhanggy/GResNet","url":"https://github.com/jwzhanggy/GResNet"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97341,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"TGCL+ResNet","metrics":{"Accuracy":"81.92±0.13"},"paper_url":"https://arxiv.org/abs/2110.13798v3","paper_title":"Deeper-GXX: Deepening Arbitrary GNNs","paper_date":"2021-10-26","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97342,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"DSGCN","metrics":{"Accuracy":"81.9%","Training Split":"fixed 20 per class"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97343,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GResNet(GCN)","metrics":{"Accuracy":"81.7%"},"paper_url":"https://arxiv.org/abs/1909.05729v2","paper_title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","paper_date":"2019-09-12","code_links":[{"title":"anonymous-sourcecode/GResNet","url":"https://github.com/anonymous-sourcecode/GResNet"},{"title":"jwzhanggy/GResNet","url":"https://github.com/jwzhanggy/GResNet"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97344,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"LoopyNet","metrics":{"Accuracy":"81.2%"},"paper_url":"https://arxiv.org/abs/1909.05729v2","paper_title":"GResNet: Graph Residual Network for Reviving Deep GNNs from Suspended Animation","paper_date":"2019-09-12","code_links":[{"title":"anonymous-sourcecode/GResNet","url":"https://github.com/anonymous-sourcecode/GResNet"},{"title":"jwzhanggy/GResNet","url":"https://github.com/jwzhanggy/GResNet"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97345,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"MixHop","metrics":{"Accuracy":"80.8%","Training Split":"20 per node","Validation":"YES"},"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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97346,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"MTGAE","metrics":{"Accuracy":"80.40%","Training Split":"20 per node","Validation":"YES"},"paper_url":"http://arxiv.org/abs/1811.02798v1","paper_title":"Multi-Task Graph Autoencoders","paper_date":"2018-11-07","code_links":[{"title":"vuptran/graph-representation-learning","url":"https://github.com/vuptran/graph-representation-learning"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97347,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"HGCN","metrics":{"Accuracy":"80.3%"},"paper_url":"https://arxiv.org/abs/1910.12933v1","paper_title":"Hyperbolic Graph Convolutional Neural Networks","paper_date":"2019-10-28","code_links":[{"title":"HazyResearch/hgcn","url":"https://github.com/HazyResearch/hgcn"},{"title":"CUAI/Riemannian-Residual-Neural-Networks","url":"https://github.com/CUAI/Riemannian-Residual-Neural-Networks"},{"title":"ydtydr/hyla","url":"https://github.com/ydtydr/hyla"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97348,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Cleora","metrics":{"Accuracy":"80.2"},"paper_url":"https://arxiv.org/abs/2102.02302v1","paper_title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","paper_date":"2021-02-03","code_links":[{"title":"Synerise/cleora","url":"https://github.com/Synerise/cleora"},{"title":"Synerise/booking-challenge","url":"https://github.com/Synerise/booking-challenge"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97349,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"SPF-GCN","metrics":{"Accuracy":"80.0%"},"paper_url":"https://arxiv.org/abs/1907.02586v1","paper_title":"Structure fusion based on graph convolutional networks for semi-supervised classification","paper_date":"2019-07-02","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97350,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"JK (Heat Diffusion)","metrics":{"Accuracy":"79.95%"},"paper_url":"https://arxiv.org/abs/1911.05485v6","paper_title":"Diffusion Improves Graph Learning","paper_date":"2019-10-28","code_links":[{"title":"klicperajo/gdc","url":"https://github.com/klicperajo/gdc"},{"title":"jhngjng/naq-pytorch","url":"https://github.com/jhngjng/naq-pytorch"},{"title":"hazdzz/GDC","url":"https://github.com/hazdzz/GDC"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97351,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"AdaGCN","metrics":{"Accuracy":"79.76 ± 0.27"},"paper_url":"https://arxiv.org/abs/1908.05081v3","paper_title":"AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models","paper_date":"2019-08-14","code_links":[{"title":"datake/AdaGCN","url":"https://github.com/datake/AdaGCN"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":97352,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"APPNP","metrics":{"Accuracy":"79.73 ± 0.31","Validation":"YES"},"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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":97353,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GOCN","metrics":{"Accuracy":"79.7%"},"paper_url":"https://arxiv.org/abs/1904.11883v2","paper_title":"Robust Graph Data Learning via Latent Graph Convolutional Representation","paper_date":"2019-04-26","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97354,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"AGNN-w/o share","metrics":{"Accuracy":"79.7 ± 0.4%"},"paper_url":"https://arxiv.org/abs/1909.03184v2","paper_title":"Auto-GNN: Neural Architecture Search of Graph Neural Networks","paper_date":"2019-09-07","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97355,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GraphNAS","metrics":{"Accuracy":"79.6 ± 0.4%"},"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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97356,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Graph U-Nets","metrics":{"Accuracy":"79.6 ± 0.2%"},"paper_url":"https://arxiv.org/abs/1905.05178v1","paper_title":"Graph U-Nets","paper_date":"2019-05-11","code_links":[{"title":"HongyangGao/gunet","url":"https://github.com/HongyangGao/gunet"},{"title":"HongyangGao/Graph-U-Nets","url":"https://github.com/HongyangGao/Graph-U-Nets"},{"title":"hujilin1229/gUNet","url":"https://github.com/hujilin1229/gUNet"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97357,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"LGCN sub","metrics":{"Accuracy":"79.5%"},"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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97358,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"N-GCN","metrics":{"Accuracy":"79.5%"},"paper_url":"http://arxiv.org/abs/1802.08888v1","paper_title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","paper_date":"2018-02-24","code_links":[{"title":"samihaija/mixhop","url":"https://github.com/samihaija/mixhop"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97359,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"DifNet","metrics":{"Accuracy":"79.5%"},"paper_url":"https://arxiv.org/abs/2001.07922v1","paper_title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","paper_date":"2020-01-22","code_links":[{"title":"jwzhanggy/DifNet","url":"https://github.com/jwzhanggy/DifNet"},{"title":"anonymous-sourcecode/DifNN","url":"https://github.com/anonymous-sourcecode/DifNN"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97360,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"alpha-LoNGAE","metrics":{"Accuracy":"79.40%"},"paper_url":"http://arxiv.org/abs/1802.08352v2","paper_title":"Learning to Make Predictions on Graphs with Autoencoders","paper_date":"2018-02-23","code_links":[{"title":"vuptran/graph-representation-learning","url":"https://github.com/vuptran/graph-representation-learning"},{"title":"Trent-tangtao/embedding","url":"https://github.com/Trent-tangtao/embedding"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97361,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"APPNP","metrics":{"Accuracy":"79.4 ± 2.2"},"paper_url":"http://arxiv.org/abs/1903.02428v3","paper_title":"Fast Graph Representation Learning with PyTorch Geometric","paper_date":"2019-03-06","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"leojklarner/gauche","url":"https://github.com/leojklarner/gauche"},{"title":"ncfrey/litmatter","url":"https://github.com/ncfrey/litmatter"},{"title":"long-9621/splinecnn","url":"https://github.com/long-9621/splinecnn"},{"title":"luxtu/OCTA-graph","url":"https://github.com/luxtu/OCTA-graph"},{"title":"NMADALI97/French-web-domain-classification","url":"https://github.com/NMADALI97/French-web-domain-classification"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97362,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Graphite","metrics":{"Accuracy":"79.3 ± 0.03"},"paper_url":"https://arxiv.org/abs/1803.10459v4","paper_title":"Graphite: Iterative Generative Modeling of Graphs","paper_date":"2018-03-28","code_links":[{"title":"ermongroup/graphite","url":"https://github.com/ermongroup/graphite"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97363,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"SF-GCN","metrics":{"Accuracy":"79.3%"},"paper_url":"https://arxiv.org/abs/1907.02586v1","paper_title":"Structure fusion based on graph convolutional networks for semi-supervised classification","paper_date":"2019-07-02","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97364,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Graph-Bert","metrics":{"Accuracy":"79.3%"},"paper_url":"https://arxiv.org/abs/2001.05140v2","paper_title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","paper_date":"2020-01-15","code_links":[{"title":"jwzhanggy/Graph-Bert","url":"https://github.com/jwzhanggy/Graph-Bert"},{"title":"anonymous-sourcecode/Graph-Bert","url":"https://github.com/anonymous-sourcecode/Graph-Bert"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97365,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GWNN","metrics":{"Accuracy":"79.1%"},"paper_url":"http://arxiv.org/abs/1904.07785v1","paper_title":"Graph Wavelet Neural Network","paper_date":"2019-04-12","code_links":[{"title":"benedekrozemberczki/GraphWaveletNeuralNetwork","url":"https://github.com/benedekrozemberczki/GraphWaveletNeuralNetwork"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97366,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"SDRF","metrics":{"Accuracy":"79.10±0.11"},"paper_url":"https://arxiv.org/abs/2111.14522v3","paper_title":"Understanding over-squashing and bottlenecks on graphs via curvature","paper_date":"2021-11-29","code_links":[{"title":"jctops/understanding-oversquashing","url":"https://github.com/jctops/understanding-oversquashing"},{"title":"josephjwilson/cayley_graph_propagation","url":"https://github.com/josephjwilson/cayley_graph_propagation"},{"title":"harel147/REFine","url":"https://github.com/harel147/REFine"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97367,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GAT","metrics":{"Accuracy":"79.0 ± 0.3%","F1-Score":"79.0","Training Split":"fixed 20 per node","Validation":"YES"},"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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97368,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GCN","metrics":{"Accuracy":"79.0"},"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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97369,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Caps2NE","metrics":{"Accuracy":"78.45%"},"paper_url":"https://arxiv.org/abs/1911.04822v2","paper_title":"A Capsule Network-based Model for Learning Node Embeddings","paper_date":"2019-11-12","code_links":[{"title":"daiquocnguyen/Caps2NE","url":"https://github.com/daiquocnguyen/Caps2NE"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97370,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"G3NN","metrics":{"Accuracy":"78.4%","Training Split":"20 per node with early stopping set","Validation":"YES"},"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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97371,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"TREE-G","metrics":{"Accuracy":"78.0"},"paper_url":"https://arxiv.org/abs/2207.02760v5","paper_title":"TREE-G: Decision Trees Contesting Graph Neural Networks","paper_date":"2022-07-06","code_links":[{"title":"mayabechlerspeicher/tree-g","url":"https://github.com/mayabechlerspeicher/tree-g"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97372,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GCN + AdaGraph (AG)","metrics":{"Accuracy":"77.4 ± 0.2"},"paper_url":"https://arxiv.org/abs/1909.03211v2","paper_title":"Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View","paper_date":"2019-09-07","code_links":[],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97373,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Graph InfoClust (GIC)","metrics":{"Accuracy":"77.4 ± 1.9"},"paper_url":"https://arxiv.org/abs/2009.06946v1","paper_title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","paper_date":"2020-09-15","code_links":[{"title":"cmavro/Graph-InfoClust-GIC","url":"https://github.com/cmavro/Graph-InfoClust-GIC"},{"title":"cmavro/HeMI","url":"https://github.com/cmavro/HeMI"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97374,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GraphStar","metrics":{"Accuracy":"77.2%"},"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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97375,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Planetoid*","metrics":{"Accuracy":"77.2%"},"paper_url":"http://arxiv.org/abs/1603.08861v2","paper_title":"Revisiting Semi-Supervised Learning with Graph Embeddings","paper_date":"2016-03-29","code_links":[{"title":"tkipf/gcn","url":"https://github.com/tkipf/gcn"},{"title":"kimiyoung/planetoid","url":"https://github.com/kimiyoung/planetoid"},{"title":"DeepGraphLearning/GMNN","url":"https://github.com/DeepGraphLearning/GMNN"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"iMoonLab/DHGNN","url":"https://github.com/iMoonLab/DHGNN"},{"title":"agiresearch/InstructGLM","url":"https://github.com/agiresearch/InstructGLM"},{"title":"ZhuangCY/Coding-NN","url":"https://github.com/ZhuangCY/Coding-NN"},{"title":"ZhuangCY/DGCN","url":"https://github.com/ZhuangCY/DGCN"},{"title":"dfdazac/dgi","url":"https://github.com/dfdazac/dgi"},{"title":"jiangboahu/glcn-tf","url":"https://github.com/jiangboahu/glcn-tf"},{"title":"tkipf/ica","url":"https://github.com/tkipf/ica"},{"title":"plusross/grcn","url":"https://github.com/plusross/grcn"},{"title":"Maysir/GRCN","url":"https://github.com/Maysir/GRCN"},{"title":"firojalam/domain-adaptation","url":"https://github.com/firojalam/domain-adaptation"},{"title":"venomouscyanide/s3grl","url":"https://github.com/venomouscyanide/s3grl"},{"title":"wokas36/DFNets","url":"https://github.com/wokas36/DFNets"},{"title":"asarigun/nfc-gcn","url":"https://github.com/asarigun/nfc-gcn"},{"title":"asarigun/la-gcn-pytorch","url":"https://github.com/asarigun/la-gcn-pytorch"},{"title":"asarigun/nfc","url":"https://github.com/asarigun/nfc"},{"title":"venomouscyanide/s3grl_ogb","url":"https://github.com/venomouscyanide/s3grl_ogb"},{"title":"venomouscyanide/S3GRL_OGB","url":"https://github.com/venomouscyanide/S3GRL_OGB"},{"title":"asarigun/la-gcn-tensorflow","url":"https://github.com/asarigun/la-gcn-tensorflow"},{"title":"BingYu94860/HGNN-Node-Classification","url":"https://github.com/BingYu94860/HGNN-Node-Classification"},{"title":"ajbisberg/gcn","url":"https://github.com/ajbisberg/gcn"},{"title":"mipot101/GNM-Implementations","url":"https://github.com/mipot101/GNM-Implementations"},{"title":"bepping/non-oversmoothing-gcns","url":"https://github.com/bepping/non-oversmoothing-gcns"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97376,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"DGI","metrics":{"Accuracy":"76.8 ± 0.6%"},"paper_url":"http://arxiv.org/abs/1809.10341v2","paper_title":"Deep Graph Infomax","paper_date":"2018-09-27","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/dgi"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/dgi"},{"title":"PetarV-/DGI","url":"https://github.com/PetarV-/DGI"},{"title":"zpeng27/GMI","url":"https://github.com/zpeng27/GMI"},{"title":"dfdazac/dgi","url":"https://github.com/dfdazac/dgi"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"Sean-Bin-Yang/Path-InfoMax","url":"https://github.com/Sean-Bin-Yang/Path-InfoMax"},{"title":"Sam131112/Deep-Graph-Infomax-Implementation","url":"https://github.com/Sam131112/Deep-Graph-Infomax-Implementation"},{"title":"ngminhhieu/DGI","url":"https://github.com/ngminhhieu/DGI"},{"title":"SpaceLearner/DisenGraphRep","url":"https://github.com/SpaceLearner/DisenGraphRep"},{"title":"wwwyyun/HDGI","url":"https://github.com/wwwyyun/HDGI"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97377,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"GLNN","metrics":{"Accuracy":"75.42 ± 2.31"},"paper_url":"https://arxiv.org/abs/2110.08727v2","paper_title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","paper_date":"2021-10-17","code_links":[{"title":"snap-research/graphless-neural-networks","url":"https://github.com/snap-research/graphless-neural-networks"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97378,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"ChebNet","metrics":{"Accuracy":"74.4%"},"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\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":590696,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"Wasserstein-Rubinstein","metrics":{"Accuracy":"74.4"},"paper_url":"https://paperswithcode.com/paper/graph-attention-specialized-expert-fusion-model-for-node-classification-based-on-cora-and-pubmed-datasets","paper_title":"Graph Attention Specialized Expert Fusion Model for Node Classification: Based on Cora and Pubmed Datasets","paper_date":"2025-07-21","code_links":[],"metrics_order":null,"area":null,"uses_additional_data":null,"source":"auto","tags":[]},{"id":97379,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"CT-Layer","metrics":{"Accuracy":"68.19"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97380,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"DANMF","metrics":{"Accuracy":"63.93%"},"paper_url":"https://dl.acm.org/citation.cfm?id=3271697","paper_title":"Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection","paper_date":"2018-10-22","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/DANMF","url":"https://github.com/benedekrozemberczki/DANMF"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97381,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"PairE","metrics":{"F1":"88.57"},"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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97382,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"ClusterGCN","metrics":{"F1":"79.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":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97383,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"PathNet","metrics":{"Accuracy (%)":"88.92"},"paper_url":"https://www.ijcai.org/proceedings/2022/310","paper_title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","paper_date":"2022-07-20","code_links":[{"title":"zjunet/PathNet","url":"https://github.com/zjunet/PathNet"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97384,"task":"Node Classification","parent_task":null,"dataset":"Pubmed","model_name":"FIT-GNN","metrics":{"Inference Time (ms)":"0.0018"},"paper_url":"https://arxiv.org/abs/2410.15001v2","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_date":"2024-10-19","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"metrics_order":"[\"Accuracy\", \"Training Split\", \"F1\", \"Validation\", \"Accuracy (%)\", \"F1-Score\", \"Inference Time (ms)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}