{"task":"Graph Classification","dataset":"D&D","metric_names":["Accuracy"],"rows":[{"id":95935,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"U2GNN (Unsupervised)","metrics":{"Accuracy":"95.67%"},"paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_date":"2019-09-26","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95936,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"MEWISPool","metrics":{"Accuracy":"84.33%"},"paper_url":"https://arxiv.org/abs/2107.01410v1","paper_title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","paper_date":"2021-07-03","code_links":[{"title":"mewispool/mewispool","url":"https://github.com/mewispool/mewispool"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95937,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"ESA (Edge set attention, no positional encodings)","metrics":{"Accuracy":"83.529±1.743"},"paper_url":"https://arxiv.org/abs/2402.10793v2","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_date":"2024-02-16","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95938,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"DDGK","metrics":{"Accuracy":"83.14%"},"paper_url":"http://arxiv.org/abs/1904.09671v1","paper_title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","paper_date":"2019-04-21","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research/tree/master/graph_embedding/ddgk"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95939,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"Graph U-Nets","metrics":{"Accuracy":"82.43%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95940,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"DUGNN","metrics":{"Accuracy":"82.40%"},"paper_url":"https://arxiv.org/abs/1909.10086v3","paper_title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","paper_date":"2019-09-22","code_links":[{"title":"vermaMachineLearning/Universal-Graph-Embedding-Neural-Network","url":"https://github.com/vermaMachineLearning/Universal-Graph-Embedding-Neural-Network"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":95941,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"S2V (with 2 DiffPool)","metrics":{"Accuracy":"82.07%"},"paper_url":"http://arxiv.org/abs/1806.08804v4","paper_title":"Hierarchical Graph Representation Learning with Differentiable Pooling","paper_date":"2018-06-22","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool"},{"title":"RexYing/diffpool","url":"https://github.com/RexYing/diffpool"},{"title":"RexYing/graph-pooling","url":"https://github.com/RexYing/graph-pooling"},{"title":"AaltoPML/Rethinking-pooling-in-GNNs","url":"https://github.com/AaltoPML/Rethinking-pooling-in-GNNs"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"VoVAllen/diffpool","url":"https://github.com/VoVAllen/diffpool"},{"title":"Tioz90/GCN","url":"https://github.com/Tioz90/GCN"},{"title":"Tioz90/DiffPool","url":"https://github.com/Tioz90/DiffPool"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"chappers/graph-differential-pooling","url":"https://github.com/chappers/graph-differential-pooling"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"PasqualeAuriemma/GCN-DIFFPOOL","url":"https://github.com/PasqualeAuriemma/GCN-DIFFPOOL"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95942,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"WKPI-kmeans","metrics":{"Accuracy":"82.0%"},"paper_url":"https://arxiv.org/abs/1904.12189v2","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_date":"2019-04-27","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95943,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"hGANet","metrics":{"Accuracy":"81.71%"},"paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","paper_date":"2019-07-05","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":95944,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"HGP-SL","metrics":{"Accuracy":"80.96%"},"paper_url":"https://arxiv.org/abs/1911.05954v3","paper_title":"Hierarchical Graph Pooling with Structure Learning","paper_date":"2019-11-14","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hgp_sl"},{"title":"cszhangzhen/HGP-SL","url":"https://github.com/cszhangzhen/HGP-SL"},{"title":"gsl-benchmark/gslb","url":"https://github.com/gsl-benchmark/gslb"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95945,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"SEAL-SAGE","metrics":{"Accuracy":"80.88%"},"paper_url":"http://arxiv.org/abs/1904.05003v1","paper_title":"Semi-Supervised Graph Classification: A Hierarchical Graph Perspective","paper_date":"2019-04-10","code_links":[{"title":"benedekrozemberczki/SEAL-CI","url":"https://github.com/benedekrozemberczki/SEAL-CI"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95946,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GNN (DiffPool)","metrics":{"Accuracy":"80.64%"},"paper_url":"http://arxiv.org/abs/1806.08804v4","paper_title":"Hierarchical Graph Representation Learning with Differentiable Pooling","paper_date":"2018-06-22","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool"},{"title":"RexYing/diffpool","url":"https://github.com/RexYing/diffpool"},{"title":"RexYing/graph-pooling","url":"https://github.com/RexYing/graph-pooling"},{"title":"AaltoPML/Rethinking-pooling-in-GNNs","url":"https://github.com/AaltoPML/Rethinking-pooling-in-GNNs"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"VoVAllen/diffpool","url":"https://github.com/VoVAllen/diffpool"},{"title":"Tioz90/GCN","url":"https://github.com/Tioz90/GCN"},{"title":"Tioz90/DiffPool","url":"https://github.com/Tioz90/DiffPool"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"chappers/graph-differential-pooling","url":"https://github.com/chappers/graph-differential-pooling"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"PasqualeAuriemma/GCN-DIFFPOOL","url":"https://github.com/PasqualeAuriemma/GCN-DIFFPOOL"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95947,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"NERO","metrics":{"Accuracy":"80.45%"},"paper_url":"https://link.springer.com/chapter/10.1007/978-3-030-77964-1_18","paper_title":"Relation order histograms as a network embedding tool","paper_date":"2021-06-09","code_links":[{"title":"Prpht/NERO","url":"https://github.com/Prpht/NERO"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95948,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"U2GNN","metrics":{"Accuracy":"80.23%"},"paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_date":"2019-09-26","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95949,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"MAGPool","metrics":{"Accuracy":"79.83%"},"paper_url":"https://ieeexplore.ieee.org/document/10454077","paper_title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","paper_date":"2024-03-04","code_links":[{"title":"p-haddadian/MAGPool","url":"https://github.com/p-haddadian/MAGPool"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95950,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"WWL","metrics":{"Accuracy":"79.69%"},"paper_url":"https://arxiv.org/abs/1906.01277v2","paper_title":"Wasserstein Weisfeiler-Lehman Graph Kernels","paper_date":"2019-06-04","code_links":[{"title":"BorgwardtLab/WWL","url":"https://github.com/BorgwardtLab/WWL"},{"title":"wenbintum/wwl-gpr","url":"https://github.com/wenbintum/wwl-gpr"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95951,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GraphStar","metrics":{"Accuracy":"79.60%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95952,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"DGCNN","metrics":{"Accuracy":"79.37%"},"paper_url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/viewPaper/17146","paper_title":"An End-to-End Deep Learning Architecture for Graph Classification","paper_date":"2018-04-29","code_links":[{"title":"muhanzhang/DGCNN","url":"https://github.com/muhanzhang/DGCNN"},{"title":"Ki-Seki/DGCNN-updated","url":"https://github.com/Ki-Seki/DGCNN-updated"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95953,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"PNA","metrics":{"Accuracy":"78.992±4.407"},"paper_url":"https://arxiv.org/abs/2004.05718v5","paper_title":"Principal Neighbourhood Aggregation for Graph Nets","paper_date":"2020-04-12","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"Saro00/DGN","url":"https://github.com/Saro00/DGN"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/pna_conv.py"},{"title":"cvignac/SMP","url":"https://github.com/cvignac/SMP"},{"title":"asarigun/GraphMixerNetworks","url":"https://github.com/asarigun/GraphMixerNetworks"},{"title":"changminwu/expandergnn","url":"https://github.com/changminwu/expandergnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95954,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"Propagation kernels (pk)","metrics":{"Accuracy":"78.8%"},"paper_url":"https://doi.org/10.1007/s10994-015-5517-9","paper_title":"Propagation kernels: efficient graph kernels from propagated information","paper_date":"2019-02-01","code_links":[{"title":"marionmari/propagation_kernels","url":"https://github.com/marionmari/propagation_kernels"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95955,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GFN","metrics":{"Accuracy":"78.78%"},"paper_url":"https://arxiv.org/abs/1905.04579v3","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","paper_date":"2019-05-11","code_links":[{"title":"chentingpc/gfn","url":"https://github.com/chentingpc/gfn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95956,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"DGCNN (sum)","metrics":{"Accuracy":"78.72%"},"paper_url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/viewPaper/17146","paper_title":"An End-to-End Deep Learning Architecture for Graph Classification","paper_date":"2018-04-29","code_links":[{"title":"muhanzhang/DGCNN","url":"https://github.com/muhanzhang/DGCNN"},{"title":"Ki-Seki/DGCNN-updated","url":"https://github.com/Ki-Seki/DGCNN-updated"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95957,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GMT","metrics":{"Accuracy":"78.72%"},"paper_url":"https://arxiv.org/abs/2102.11533v4","paper_title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","paper_date":"2021-02-23","code_links":[{"title":"JinheonBaek/GMT","url":"https://github.com/JinheonBaek/GMT"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95958,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"Graph-JEPA","metrics":{"Accuracy":"78.64%"},"paper_url":"https://arxiv.org/abs/2309.16014v3","paper_title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","paper_date":"2023-09-27","code_links":[{"title":"geriskenderi/graph-jepa","url":"https://github.com/geriskenderi/graph-jepa"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95959,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GFN-light","metrics":{"Accuracy":"78.62%"},"paper_url":"https://arxiv.org/abs/1905.04579v3","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","paper_date":"2019-05-11","code_links":[{"title":"chentingpc/gfn","url":"https://github.com/chentingpc/gfn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95960,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"EigenGCN-3","metrics":{"Accuracy":"78.6%"},"paper_url":"https://arxiv.org/abs/1904.13107v2","paper_title":"Graph Convolutional Networks with EigenPooling","paper_date":"2019-04-30","code_links":[{"title":"alge24/eigenpooling","url":"https://github.com/alge24/eigenpooling"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95961,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"WEGL","metrics":{"Accuracy":"78.6%"},"paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","paper_date":"2020-06-16","code_links":[{"title":"navid-naderi/WEGL","url":"https://github.com/navid-naderi/WEGL"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95962,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"Weak-supervised ChebyNet","metrics":{"Accuracy":"78.36%"},"paper_url":"https://arxiv.org/abs/1905.02850v3","paper_title":"Understanding Attention and Generalization in Graph Neural Networks","paper_date":"2019-05-08","code_links":[{"title":"bknyaz/graph_nn","url":"https://github.com/bknyaz/graph_nn"},{"title":"bknyaz/graph_attention_pool","url":"https://github.com/bknyaz/graph_attention_pool"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95963,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"DropGIN","metrics":{"Accuracy":"78.151±3.711"},"paper_url":"https://arxiv.org/abs/2111.06283v1","paper_title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","paper_date":"2021-11-11","code_links":[{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95964,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GCN","metrics":{"Accuracy":"78.151±3.465"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95965,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GCAPS-CNN","metrics":{"Accuracy":"77.62%"},"paper_url":"http://arxiv.org/abs/1805.08090v4","paper_title":"Graph Capsule Convolutional Neural Networks","paper_date":"2018-05-21","code_links":[{"title":"vermaMachineLearning/Graph-Capsule-CNN-Networks","url":"https://github.com/vermaMachineLearning/Graph-Capsule-CNN-Networks"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95966,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"LDP + distance","metrics":{"Accuracy":"77.5%"},"paper_url":"https://arxiv.org/abs/1811.03508v3","paper_title":"A simple yet effective baseline for non-attributed graph classification","paper_date":"2018-11-08","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"Chen-Cai-OSU/LDP","url":"https://github.com/Chen-Cai-OSU/LDP"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95967,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GIN","metrics":{"Accuracy":"77.311±2.223"},"paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","paper_date":"2018-10-01","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95968,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"DGCNN","metrics":{"Accuracy":"77.21%"},"paper_url":"http://arxiv.org/abs/1712.03563v1","paper_title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","paper_date":"2017-12-10","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95969,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"ASAP","metrics":{"Accuracy":"76.87"},"paper_url":"https://arxiv.org/abs/1911.07979v3","paper_title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","paper_date":"2019-11-18","code_links":[{"title":"malllabiisc/ASAP","url":"https://github.com/malllabiisc/ASAP"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95970,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"DGCNN","metrics":{"Accuracy":"76.6%"},"paper_url":"https://arxiv.org/abs/1912.09893v3","paper_title":"A Fair Comparison of Graph Neural Networks for Graph Classification","paper_date":"2019-12-20","code_links":[{"title":"diningphil/gnn-comparison","url":"https://github.com/diningphil/gnn-comparison"},{"title":"diningphil/CGMM","url":"https://github.com/diningphil/CGMM"},{"title":"FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks","url":"https://github.com/FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"},{"title":"diningphil/icgmm","url":"https://github.com/diningphil/icgmm"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95971,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"SAGPool_h","metrics":{"Accuracy":"76.45%"},"paper_url":"https://arxiv.org/abs/1904.08082v4","paper_title":"Self-Attention Graph Pooling","paper_date":"2019-04-17","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sagpool"},{"title":"inyeoplee77/SAGPool","url":"https://github.com/inyeoplee77/SAGPool"},{"title":"walidgeuttala/Synthetic-Benchmark-for-Graph-Classification","url":"https://github.com/walidgeuttala/Synthetic-Benchmark-for-Graph-Classification"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95972,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"PSCN","metrics":{"Accuracy":"76.27%"},"paper_url":"http://arxiv.org/abs/1605.05273v4","paper_title":"Learning Convolutional Neural Networks for Graphs","paper_date":"2016-05-17","code_links":[{"title":"tvayer/PSCN","url":"https://github.com/tvayer/PSCN"},{"title":"CielAl/PatchySan","url":"https://github.com/CielAl/PatchySan"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95973,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"TREE-G","metrics":{"Accuracy":"76.2%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95974,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"SAGPool_g","metrics":{"Accuracy":"76.19%"},"paper_url":"https://arxiv.org/abs/1904.08082v4","paper_title":"Self-Attention Graph Pooling","paper_date":"2019-04-17","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sagpool"},{"title":"inyeoplee77/SAGPool","url":"https://github.com/inyeoplee77/SAGPool"},{"title":"walidgeuttala/Synthetic-Benchmark-for-Graph-Classification","url":"https://github.com/walidgeuttala/Synthetic-Benchmark-for-Graph-Classification"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95975,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"1-NMFPool","metrics":{"Accuracy":"76.0%"},"paper_url":"https://arxiv.org/abs/1909.03287v1","paper_title":"A Non-Negative Factorization approach to node pooling in Graph Convolutional Neural Networks","paper_date":"2019-09-07","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95976,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GATv2","metrics":{"Accuracy":"75.966±2.191"},"paper_url":"https://arxiv.org/abs/2105.14491v3","paper_title":"How Attentive are Graph Attention Networks?","paper_date":"2021-05-30","code_links":[{"title":"labmlai/annotated_deep_learning_paper_implementations","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations"},{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric/blob/master/torch_geometric/nn/conv/gatv2_conv.py"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/blob/master/python/dgl/nn/pytorch/conv/gatv2conv.py"},{"title":"tensorflow/gnn","url":"https://github.com/tensorflow/gnn/blob/main/tensorflow_gnn/docs/api_docs/python/gnn/keras/layers/GATv2.md"},{"title":"tech-srl/how_attentive_are_gats","url":"https://github.com/tech-srl/how_attentive_are_gats"},{"title":"machadoprx/GATv2-TensorFlow2","url":"https://github.com/machadoprx/GATv2-TensorFlow2"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/gatv2"},{"title":"briangodwinlim/sir-gcn","url":"https://github.com/briangodwinlim/sir-gcn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95977,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"LDP","metrics":{"Accuracy":"75.5%"},"paper_url":"https://arxiv.org/abs/1811.03508v3","paper_title":"A simple yet effective baseline for non-attributed graph classification","paper_date":"2018-11-08","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"Chen-Cai-OSU/LDP","url":"https://github.com/Chen-Cai-OSU/LDP"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95978,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"2-WL-GNN","metrics":{"Accuracy":"75.4"},"paper_url":"https://arxiv.org/abs/2007.00346v2","paper_title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","paper_date":"2020-07-01","code_links":[{"title":"Cortys/master-thesis","url":"https://github.com/Cortys/master-thesis"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95979,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"CapsGNN","metrics":{"Accuracy":"75.38%"},"paper_url":"https://openreview.net/forum?id=Byl8BnRcYm","paper_title":"Capsule Graph Neural Network","paper_date":"2019-05-01","code_links":[{"title":"benedekrozemberczki/CapsGNN","url":"https://github.com/benedekrozemberczki/CapsGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95980,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"BC + Capsules","metrics":{"Accuracy":"74.86%"},"paper_url":"http://arxiv.org/abs/1902.08399v1","paper_title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","paper_date":"2019-02-22","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95981,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"ECC (5 scores)","metrics":{"Accuracy":"74.1%"},"paper_url":"http://arxiv.org/abs/1704.02901v3","paper_title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","paper_date":"2017-04-10","code_links":[{"title":"rusty1s/pytorch_cluster","url":"https://github.com/rusty1s/pytorch_cluster"},{"title":"mys007/ecc","url":"https://github.com/mys007/ecc"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95982,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"TokenGT","metrics":{"Accuracy":"73.950±3.361"},"paper_url":"https://arxiv.org/abs/2207.02505v2","paper_title":"Pure Transformers are Powerful Graph Learners","paper_date":"2022-07-06","code_links":[{"title":"jw9730/tokengt","url":"https://github.com/jw9730/tokengt"},{"title":"luis-mueller/wl-transformers","url":"https://github.com/luis-mueller/wl-transformers"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95983,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"DGK","metrics":{"Accuracy":"73.50%"},"paper_url":"https://www.semanticscholar.org/paper/Deep-Graph-Kernels-Yanardag-Vishwanathan/8ccd0adb1a00358ede79f1d9bdcce472dc1cb8d4","paper_title":"Deep Graph Kernels","paper_date":"2015-08-10","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95984,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"GAT","metrics":{"Accuracy":"73.109±3.413"},"paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","paper_date":"2017-10-30","code_links":[{"title":"labmlai/annotated_deep_learning_paper_implementations","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gat"},{"title":"PetarV-/GAT","url":"https://github.com/PetarV-/GAT"},{"title":"Diego999/pyGAT","url":"https://github.com/Diego999/pyGAT"},{"title":"gordicaleksa/pytorch-GAT","url":"https://github.com/gordicaleksa/pytorch-GAT"},{"title":"shenweichen/GraphNeuralNetwork","url":"https://github.com/shenweichen/GraphNeuralNetwork"},{"title":"HazyResearch/hgcn","url":"https://github.com/HazyResearch/hgcn"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"danielegrattarola/keras-gat","url":"https://github.com/danielegrattarola/keras-gat"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/gnn/gat"},{"title":"Kaimaoge/IGNNK","url":"https://github.com/Kaimaoge/IGNNK"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zhao-tong/GNNs-easy-to-use","url":"https://github.com/zhao-tong/GNNs-easy-to-use"},{"title":"davidpicard/homm","url":"https://github.com/davidpicard/homm"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"snowkylin/gnn","url":"https://github.com/snowkylin/gnn"},{"title":"akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network","url":"https://github.com/akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"weiyangfb/PyTorchSparseGAT","url":"https://github.com/weiyangfb/PyTorchSparseGAT"},{"title":"HeapHop30/graph-attention-nets","url":"https://github.com/HeapHop30/graph-attention-nets"},{"title":"marblet/GNN_models_pytorch_geometric","url":"https://github.com/marblet/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch_geometric","url":"https://github.com/marble0117/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch","url":"https://github.com/marble0117/GNN_models_pytorch"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"ds4dm/sGat","url":"https://github.com/ds4dm/sGat"},{"title":"ds4dm/sparse-gcn","url":"https://github.com/ds4dm/sparse-gcn"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"marblet/gat-pytorch","url":"https://github.com/marblet/gat-pytorch"},{"title":"ydzhang-stormstout/HAT","url":"https://github.com/ydzhang-stormstout/HAT"},{"title":"gcucurull/jax-gat","url":"https://github.com/gcucurull/jax-gat"},{"title":"calciver/Graph-Attention-Networks","url":"https://github.com/calciver/Graph-Attention-Networks"},{"title":"shi27feng/transformers.satisfy","url":"https://github.com/shi27feng/transformers.satisfy"},{"title":"pengsl-lab/mssl","url":"https://github.com/pengsl-lab/mssl"},{"title":"pengsl-lab/mssl2drug","url":"https://github.com/pengsl-lab/mssl2drug"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"taishan1994/pytorch_gat","url":"https://github.com/taishan1994/pytorch_gat"},{"title":"wan2000/mc-mot","url":"https://github.com/wan2000/mc-mot"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"dmeoli/neuro-sat","url":"https://github.com/dmeoli/neuro-sat"},{"title":"liu6zijian/simplified-gcn-model","url":"https://github.com/liu6zijian/simplified-gcn-model"},{"title":"tatp22/pytorch-fast-GAT","url":"https://github.com/tatp22/pytorch-fast-GAT"},{"title":"noahtren/Graph-Attention-Networks-TensorFlow-2","url":"https://github.com/noahtren/Graph-Attention-Networks-TensorFlow-2"},{"title":"yururyuru00/GAT_pyG","url":"https://github.com/yururyuru00/GAT_pyG"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"gayanku/FDGATII","url":"https://github.com/gayanku/FDGATII"},{"title":"Yindong-Zhang/myGAT","url":"https://github.com/Yindong-Zhang/myGAT"},{"title":"giuseppefutia/link-prediction-code","url":"https://github.com/giuseppefutia/link-prediction-code"},{"title":"Aveek-Saha/Graph-Attention-Net","url":"https://github.com/Aveek-Saha/Graph-Attention-Net"},{"title":"BIG-S2/keras-gnm","url":"https://github.com/BIG-S2/keras-gnm"},{"title":"mlzxzhou/keras-gnm","url":"https://github.com/mlzxzhou/keras-gnm"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"abhilash1910/GraphAttentionNetworks","url":"https://github.com/abhilash1910/GraphAttentionNetworks"},{"title":"Kristof-Neys/GAT_Neo4j_DGL","url":"https://github.com/Kristof-Neys/GAT_Neo4j_DGL"},{"title":"ak24watch/Graph-Deeplearning-GAT","url":"https://github.com/ak24watch/Graph-Deeplearning-GAT"},{"title":"Negus25/GAT-Mindspore","url":"https://github.com/Negus25/GAT-Mindspore"},{"title":"ChengyuSun/gat","url":"https://github.com/ChengyuSun/gat"},{"title":"joaopedromattos/gnee","url":"https://github.com/joaopedromattos/gnee"},{"title":"mitya8128/experiments_notes","url":"https://github.com/mitya8128/experiments_notes"},{"title":"4pygmalion/GAT_tensorflow","url":"https://github.com/4pygmalion/GAT_tensorflow"},{"title":"vailatuts/SSFG-regularization","url":"https://github.com/vailatuts/SSFG-regularization"},{"title":"handasontam/GAT-with-edgewise-attention","url":"https://github.com/handasontam/GAT-with-edgewise-attention"},{"title":"Mind23-2/MindCode-4","url":"https://github.com/Mind23-2/MindCode-4/tree/main/gat"},{"title":"AngusMonroe/GAT-pytorch","url":"https://github.com/AngusMonroe/GAT-pytorch"},{"title":"fongyk/graph-attention","url":"https://github.com/fongyk/graph-attention"},{"title":"404nofound/gat","url":"https://github.com/404nofound/gat"},{"title":"ColdenChan/GAT_D","url":"https://github.com/ColdenChan/GAT_D"},{"title":"MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints","url":"https://github.com/MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints"},{"title":"bowu/GraphSearch","url":"https://github.com/bowu/GraphSearch"},{"title":"Messham87/COVID_GAT","url":"https://github.com/Messham87/COVID_GAT"},{"title":"zhangbo2008/GAT_network","url":"https://github.com/zhangbo2008/GAT_network"},{"title":"blueberryc/pyGAT","url":"https://github.com/blueberryc/pyGAT"},{"title":"anish-lu-yihe/SVRT-by-GAT","url":"https://github.com/anish-lu-yihe/SVRT-by-GAT"},{"title":"WantingZhao/my_GAT","url":"https://github.com/WantingZhao/my_GAT"},{"title":"dzb1998/pyGAT","url":"https://github.com/dzb1998/pyGAT"},{"title":"subercui/pyGConvAT","url":"https://github.com/subercui/pyGConvAT"},{"title":"YunseobShin/wiki_GAT","url":"https://github.com/YunseobShin/wiki_GAT"},{"title":"MindSpore-scientific-2/code-4","url":"https://github.com/MindSpore-scientific-2/code-4/tree/main/GR-HSTU"},{"title":"snownus/COOP","url":"https://github.com/snownus/COOP"},{"title":"ChengSashankh/trying-GAT","url":"https://github.com/ChengSashankh/trying-GAT"},{"title":"Anak2016/GAT","url":"https://github.com/Anak2016/GAT"},{"title":"whut2962575697/gat_sementic_segmentation","url":"https://github.com/whut2962575697/gat_sementic_segmentation"},{"title":"Anou9531/GAT","url":"https://github.com/Anou9531/GAT"},{"title":"PumpkinYing/GAT","url":"https://github.com/PumpkinYing/GAT"},{"title":"galkampel/HyperNetworks","url":"https://github.com/galkampel/HyperNetworks"},{"title":"tlmakinen/GAT-noise","url":"https://github.com/tlmakinen/GAT-noise"},{"title":"TyngJiunKuo/deep-learning-project","url":"https://github.com/TyngJiunKuo/deep-learning-project"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95985,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"NDP","metrics":{"Accuracy":"72%"},"paper_url":"https://arxiv.org/abs/1910.11436v3","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","paper_date":"2019-10-24","code_links":[{"title":"danielegrattarola/decimation-pooling","url":"https://github.com/danielegrattarola/decimation-pooling"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95986,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"AWE","metrics":{"Accuracy":"71.51%"},"paper_url":"http://arxiv.org/abs/1805.11921v3","paper_title":"Anonymous Walk Embeddings","paper_date":"2018-05-30","code_links":[{"title":"nd7141/AWE","url":"https://github.com/nd7141/AWE"},{"title":"paulmorio/geo2dr","url":"https://github.com/paulmorio/geo2dr"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95987,"task":"Graph Classification","parent_task":null,"dataset":"D&D","model_name":"SF + RFC","metrics":{"Accuracy":"24.6%"},"paper_url":"http://arxiv.org/abs/1810.09155v2","paper_title":"A Simple Baseline Algorithm for Graph Classification","paper_date":"2018-10-22","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"edouardpineau/A-simple-baseline-algorithm-for-graph-classification","url":"https://github.com/edouardpineau/A-simple-baseline-algorithm-for-graph-classification"},{"title":"edouardpineau/Using-Laplacian-Spectrum-as-Graph-Feature-Representation","url":"https://github.com/edouardpineau/Using-Laplacian-Spectrum-as-Graph-Feature-Representation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122704,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"U2GNN (Unsupervised)","metrics":{"Accuracy":"95.67%"},"paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_date":"2019-09-26","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122705,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"MEWISPool","metrics":{"Accuracy":"84.33%"},"paper_url":"https://arxiv.org/abs/2107.01410v1","paper_title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","paper_date":"2021-07-03","code_links":[{"title":"mewispool/mewispool","url":"https://github.com/mewispool/mewispool"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122706,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"ESA (Edge set attention, no positional encodings)","metrics":{"Accuracy":"83.529±1.743"},"paper_url":"https://arxiv.org/abs/2402.10793v2","paper_title":"An end-to-end attention-based approach for learning on graphs","paper_date":"2024-02-16","code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122707,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"DDGK","metrics":{"Accuracy":"83.14%"},"paper_url":"http://arxiv.org/abs/1904.09671v1","paper_title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","paper_date":"2019-04-21","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research/tree/master/graph_embedding/ddgk"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122708,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"Graph U-Nets","metrics":{"Accuracy":"82.43%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122709,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"DUGNN","metrics":{"Accuracy":"82.40%"},"paper_url":"https://arxiv.org/abs/1909.10086v3","paper_title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","paper_date":"2019-09-22","code_links":[{"title":"vermaMachineLearning/Universal-Graph-Embedding-Neural-Network","url":"https://github.com/vermaMachineLearning/Universal-Graph-Embedding-Neural-Network"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":122710,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"S2V (with 2 DiffPool)","metrics":{"Accuracy":"82.07%"},"paper_url":"http://arxiv.org/abs/1806.08804v4","paper_title":"Hierarchical Graph Representation Learning with Differentiable Pooling","paper_date":"2018-06-22","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool"},{"title":"RexYing/diffpool","url":"https://github.com/RexYing/diffpool"},{"title":"RexYing/graph-pooling","url":"https://github.com/RexYing/graph-pooling"},{"title":"AaltoPML/Rethinking-pooling-in-GNNs","url":"https://github.com/AaltoPML/Rethinking-pooling-in-GNNs"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"VoVAllen/diffpool","url":"https://github.com/VoVAllen/diffpool"},{"title":"Tioz90/GCN","url":"https://github.com/Tioz90/GCN"},{"title":"Tioz90/DiffPool","url":"https://github.com/Tioz90/DiffPool"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"chappers/graph-differential-pooling","url":"https://github.com/chappers/graph-differential-pooling"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"PasqualeAuriemma/GCN-DIFFPOOL","url":"https://github.com/PasqualeAuriemma/GCN-DIFFPOOL"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122711,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"WKPI-kmeans","metrics":{"Accuracy":"82.0%"},"paper_url":"https://arxiv.org/abs/1904.12189v2","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","paper_date":"2019-04-27","code_links":[{"title":"topology474/WKPI","url":"https://github.com/topology474/WKPI"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122712,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"hGANet","metrics":{"Accuracy":"81.71%"},"paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","paper_date":"2019-07-05","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":122713,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"HGP-SL","metrics":{"Accuracy":"80.96%"},"paper_url":"https://arxiv.org/abs/1911.05954v3","paper_title":"Hierarchical Graph Pooling with Structure Learning","paper_date":"2019-11-14","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hgp_sl"},{"title":"cszhangzhen/HGP-SL","url":"https://github.com/cszhangzhen/HGP-SL"},{"title":"gsl-benchmark/gslb","url":"https://github.com/gsl-benchmark/gslb"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122714,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"SEAL-SAGE","metrics":{"Accuracy":"80.88%"},"paper_url":"http://arxiv.org/abs/1904.05003v1","paper_title":"Semi-Supervised Graph Classification: A Hierarchical Graph Perspective","paper_date":"2019-04-10","code_links":[{"title":"benedekrozemberczki/SEAL-CI","url":"https://github.com/benedekrozemberczki/SEAL-CI"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122715,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GNN (DiffPool)","metrics":{"Accuracy":"80.64%"},"paper_url":"http://arxiv.org/abs/1806.08804v4","paper_title":"Hierarchical Graph Representation Learning with Differentiable Pooling","paper_date":"2018-06-22","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool"},{"title":"RexYing/diffpool","url":"https://github.com/RexYing/diffpool"},{"title":"RexYing/graph-pooling","url":"https://github.com/RexYing/graph-pooling"},{"title":"AaltoPML/Rethinking-pooling-in-GNNs","url":"https://github.com/AaltoPML/Rethinking-pooling-in-GNNs"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"VoVAllen/diffpool","url":"https://github.com/VoVAllen/diffpool"},{"title":"Tioz90/GCN","url":"https://github.com/Tioz90/GCN"},{"title":"Tioz90/DiffPool","url":"https://github.com/Tioz90/DiffPool"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"chappers/graph-differential-pooling","url":"https://github.com/chappers/graph-differential-pooling"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"PasqualeAuriemma/GCN-DIFFPOOL","url":"https://github.com/PasqualeAuriemma/GCN-DIFFPOOL"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122716,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"NERO","metrics":{"Accuracy":"80.45%"},"paper_url":"https://link.springer.com/chapter/10.1007/978-3-030-77964-1_18","paper_title":"Relation order histograms as a network embedding tool","paper_date":"2021-06-09","code_links":[{"title":"Prpht/NERO","url":"https://github.com/Prpht/NERO"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122717,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"U2GNN","metrics":{"Accuracy":"80.23%"},"paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_date":"2019-09-26","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122718,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"MAGPool","metrics":{"Accuracy":"79.83%"},"paper_url":"https://ieeexplore.ieee.org/document/10454077","paper_title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","paper_date":"2024-03-04","code_links":[{"title":"p-haddadian/MAGPool","url":"https://github.com/p-haddadian/MAGPool"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122719,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"WWL","metrics":{"Accuracy":"79.69%"},"paper_url":"https://arxiv.org/abs/1906.01277v2","paper_title":"Wasserstein Weisfeiler-Lehman Graph Kernels","paper_date":"2019-06-04","code_links":[{"title":"BorgwardtLab/WWL","url":"https://github.com/BorgwardtLab/WWL"},{"title":"wenbintum/wwl-gpr","url":"https://github.com/wenbintum/wwl-gpr"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122720,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GraphStar","metrics":{"Accuracy":"79.60%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122721,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"DGCNN","metrics":{"Accuracy":"79.37%"},"paper_url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/viewPaper/17146","paper_title":"An End-to-End Deep Learning Architecture for Graph Classification","paper_date":"2018-04-29","code_links":[{"title":"muhanzhang/DGCNN","url":"https://github.com/muhanzhang/DGCNN"},{"title":"Ki-Seki/DGCNN-updated","url":"https://github.com/Ki-Seki/DGCNN-updated"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122722,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"PNA","metrics":{"Accuracy":"78.992±4.407"},"paper_url":"https://arxiv.org/abs/2004.05718v5","paper_title":"Principal Neighbourhood Aggregation for Graph Nets","paper_date":"2020-04-12","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"Saro00/DGN","url":"https://github.com/Saro00/DGN"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/pna_conv.py"},{"title":"cvignac/SMP","url":"https://github.com/cvignac/SMP"},{"title":"asarigun/GraphMixerNetworks","url":"https://github.com/asarigun/GraphMixerNetworks"},{"title":"changminwu/expandergnn","url":"https://github.com/changminwu/expandergnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122723,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"Propagation kernels (pk)","metrics":{"Accuracy":"78.8%"},"paper_url":"https://doi.org/10.1007/s10994-015-5517-9","paper_title":"Propagation kernels: efficient graph kernels from propagated information","paper_date":"2019-02-01","code_links":[{"title":"marionmari/propagation_kernels","url":"https://github.com/marionmari/propagation_kernels"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122724,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GFN","metrics":{"Accuracy":"78.78%"},"paper_url":"https://arxiv.org/abs/1905.04579v3","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","paper_date":"2019-05-11","code_links":[{"title":"chentingpc/gfn","url":"https://github.com/chentingpc/gfn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122725,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"DGCNN (sum)","metrics":{"Accuracy":"78.72%"},"paper_url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/viewPaper/17146","paper_title":"An End-to-End Deep Learning Architecture for Graph Classification","paper_date":"2018-04-29","code_links":[{"title":"muhanzhang/DGCNN","url":"https://github.com/muhanzhang/DGCNN"},{"title":"Ki-Seki/DGCNN-updated","url":"https://github.com/Ki-Seki/DGCNN-updated"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122726,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GMT","metrics":{"Accuracy":"78.72%"},"paper_url":"https://arxiv.org/abs/2102.11533v4","paper_title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","paper_date":"2021-02-23","code_links":[{"title":"JinheonBaek/GMT","url":"https://github.com/JinheonBaek/GMT"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122727,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"Graph-JEPA","metrics":{"Accuracy":"78.64%"},"paper_url":"https://arxiv.org/abs/2309.16014v3","paper_title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","paper_date":"2023-09-27","code_links":[{"title":"geriskenderi/graph-jepa","url":"https://github.com/geriskenderi/graph-jepa"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122728,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GFN-light","metrics":{"Accuracy":"78.62%"},"paper_url":"https://arxiv.org/abs/1905.04579v3","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","paper_date":"2019-05-11","code_links":[{"title":"chentingpc/gfn","url":"https://github.com/chentingpc/gfn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122729,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"EigenGCN-3","metrics":{"Accuracy":"78.6%"},"paper_url":"https://arxiv.org/abs/1904.13107v2","paper_title":"Graph Convolutional Networks with EigenPooling","paper_date":"2019-04-30","code_links":[{"title":"alge24/eigenpooling","url":"https://github.com/alge24/eigenpooling"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122730,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"WEGL","metrics":{"Accuracy":"78.6%"},"paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","paper_date":"2020-06-16","code_links":[{"title":"navid-naderi/WEGL","url":"https://github.com/navid-naderi/WEGL"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122731,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"Weak-supervised ChebyNet","metrics":{"Accuracy":"78.36%"},"paper_url":"https://arxiv.org/abs/1905.02850v3","paper_title":"Understanding Attention and Generalization in Graph Neural Networks","paper_date":"2019-05-08","code_links":[{"title":"bknyaz/graph_nn","url":"https://github.com/bknyaz/graph_nn"},{"title":"bknyaz/graph_attention_pool","url":"https://github.com/bknyaz/graph_attention_pool"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122732,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"DropGIN","metrics":{"Accuracy":"78.151±3.711"},"paper_url":"https://arxiv.org/abs/2111.06283v1","paper_title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","paper_date":"2021-11-11","code_links":[{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122733,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GCN","metrics":{"Accuracy":"78.151±3.465"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122734,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GCAPS-CNN","metrics":{"Accuracy":"77.62%"},"paper_url":"http://arxiv.org/abs/1805.08090v4","paper_title":"Graph Capsule Convolutional Neural Networks","paper_date":"2018-05-21","code_links":[{"title":"vermaMachineLearning/Graph-Capsule-CNN-Networks","url":"https://github.com/vermaMachineLearning/Graph-Capsule-CNN-Networks"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122735,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"LDP + distance","metrics":{"Accuracy":"77.5%"},"paper_url":"https://arxiv.org/abs/1811.03508v3","paper_title":"A simple yet effective baseline for non-attributed graph classification","paper_date":"2018-11-08","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"Chen-Cai-OSU/LDP","url":"https://github.com/Chen-Cai-OSU/LDP"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122736,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GIN","metrics":{"Accuracy":"77.311±2.223"},"paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","paper_date":"2018-10-01","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122737,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"DGCNN","metrics":{"Accuracy":"77.21%"},"paper_url":"http://arxiv.org/abs/1712.03563v1","paper_title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","paper_date":"2017-12-10","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122738,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"ASAP","metrics":{"Accuracy":"76.87"},"paper_url":"https://arxiv.org/abs/1911.07979v3","paper_title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","paper_date":"2019-11-18","code_links":[{"title":"malllabiisc/ASAP","url":"https://github.com/malllabiisc/ASAP"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122739,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"DGCNN","metrics":{"Accuracy":"76.6%"},"paper_url":"https://arxiv.org/abs/1912.09893v3","paper_title":"A Fair Comparison of Graph Neural Networks for Graph Classification","paper_date":"2019-12-20","code_links":[{"title":"diningphil/gnn-comparison","url":"https://github.com/diningphil/gnn-comparison"},{"title":"diningphil/CGMM","url":"https://github.com/diningphil/CGMM"},{"title":"FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks","url":"https://github.com/FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"},{"title":"diningphil/icgmm","url":"https://github.com/diningphil/icgmm"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122740,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"SAGPool_h","metrics":{"Accuracy":"76.45%"},"paper_url":"https://arxiv.org/abs/1904.08082v4","paper_title":"Self-Attention Graph Pooling","paper_date":"2019-04-17","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sagpool"},{"title":"inyeoplee77/SAGPool","url":"https://github.com/inyeoplee77/SAGPool"},{"title":"walidgeuttala/Synthetic-Benchmark-for-Graph-Classification","url":"https://github.com/walidgeuttala/Synthetic-Benchmark-for-Graph-Classification"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122741,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"PSCN","metrics":{"Accuracy":"76.27%"},"paper_url":"http://arxiv.org/abs/1605.05273v4","paper_title":"Learning Convolutional Neural Networks for Graphs","paper_date":"2016-05-17","code_links":[{"title":"tvayer/PSCN","url":"https://github.com/tvayer/PSCN"},{"title":"CielAl/PatchySan","url":"https://github.com/CielAl/PatchySan"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122742,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"TREE-G","metrics":{"Accuracy":"76.2%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122743,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"SAGPool_g","metrics":{"Accuracy":"76.19%"},"paper_url":"https://arxiv.org/abs/1904.08082v4","paper_title":"Self-Attention Graph Pooling","paper_date":"2019-04-17","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sagpool"},{"title":"inyeoplee77/SAGPool","url":"https://github.com/inyeoplee77/SAGPool"},{"title":"walidgeuttala/Synthetic-Benchmark-for-Graph-Classification","url":"https://github.com/walidgeuttala/Synthetic-Benchmark-for-Graph-Classification"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122744,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"1-NMFPool","metrics":{"Accuracy":"76.0%"},"paper_url":"https://arxiv.org/abs/1909.03287v1","paper_title":"A Non-Negative Factorization approach to node pooling in Graph Convolutional Neural Networks","paper_date":"2019-09-07","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122745,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GATv2","metrics":{"Accuracy":"75.966±2.191"},"paper_url":"https://arxiv.org/abs/2105.14491v3","paper_title":"How Attentive are Graph Attention Networks?","paper_date":"2021-05-30","code_links":[{"title":"labmlai/annotated_deep_learning_paper_implementations","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations"},{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric/blob/master/torch_geometric/nn/conv/gatv2_conv.py"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/blob/master/python/dgl/nn/pytorch/conv/gatv2conv.py"},{"title":"tensorflow/gnn","url":"https://github.com/tensorflow/gnn/blob/main/tensorflow_gnn/docs/api_docs/python/gnn/keras/layers/GATv2.md"},{"title":"tech-srl/how_attentive_are_gats","url":"https://github.com/tech-srl/how_attentive_are_gats"},{"title":"machadoprx/GATv2-TensorFlow2","url":"https://github.com/machadoprx/GATv2-TensorFlow2"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/gatv2"},{"title":"briangodwinlim/sir-gcn","url":"https://github.com/briangodwinlim/sir-gcn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122746,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"LDP","metrics":{"Accuracy":"75.5%"},"paper_url":"https://arxiv.org/abs/1811.03508v3","paper_title":"A simple yet effective baseline for non-attributed graph classification","paper_date":"2018-11-08","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"Chen-Cai-OSU/LDP","url":"https://github.com/Chen-Cai-OSU/LDP"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122747,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"2-WL-GNN","metrics":{"Accuracy":"75.4"},"paper_url":"https://arxiv.org/abs/2007.00346v2","paper_title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","paper_date":"2020-07-01","code_links":[{"title":"Cortys/master-thesis","url":"https://github.com/Cortys/master-thesis"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122748,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"CapsGNN","metrics":{"Accuracy":"75.38%"},"paper_url":"https://openreview.net/forum?id=Byl8BnRcYm","paper_title":"Capsule Graph Neural Network","paper_date":"2019-05-01","code_links":[{"title":"benedekrozemberczki/CapsGNN","url":"https://github.com/benedekrozemberczki/CapsGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122749,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"BC + Capsules","metrics":{"Accuracy":"74.86%"},"paper_url":"http://arxiv.org/abs/1902.08399v1","paper_title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","paper_date":"2019-02-22","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122750,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"ECC (5 scores)","metrics":{"Accuracy":"74.1%"},"paper_url":"http://arxiv.org/abs/1704.02901v3","paper_title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","paper_date":"2017-04-10","code_links":[{"title":"rusty1s/pytorch_cluster","url":"https://github.com/rusty1s/pytorch_cluster"},{"title":"mys007/ecc","url":"https://github.com/mys007/ecc"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122751,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"TokenGT","metrics":{"Accuracy":"73.950±3.361"},"paper_url":"https://arxiv.org/abs/2207.02505v2","paper_title":"Pure Transformers are Powerful Graph Learners","paper_date":"2022-07-06","code_links":[{"title":"jw9730/tokengt","url":"https://github.com/jw9730/tokengt"},{"title":"luis-mueller/wl-transformers","url":"https://github.com/luis-mueller/wl-transformers"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122752,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"DGK","metrics":{"Accuracy":"73.50%"},"paper_url":"https://www.semanticscholar.org/paper/Deep-Graph-Kernels-Yanardag-Vishwanathan/8ccd0adb1a00358ede79f1d9bdcce472dc1cb8d4","paper_title":"Deep Graph Kernels","paper_date":"2015-08-10","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122753,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"GAT","metrics":{"Accuracy":"73.109±3.413"},"paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","paper_date":"2017-10-30","code_links":[{"title":"labmlai/annotated_deep_learning_paper_implementations","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gat"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gat"},{"title":"PetarV-/GAT","url":"https://github.com/PetarV-/GAT"},{"title":"Diego999/pyGAT","url":"https://github.com/Diego999/pyGAT"},{"title":"gordicaleksa/pytorch-GAT","url":"https://github.com/gordicaleksa/pytorch-GAT"},{"title":"shenweichen/GraphNeuralNetwork","url":"https://github.com/shenweichen/GraphNeuralNetwork"},{"title":"HazyResearch/hgcn","url":"https://github.com/HazyResearch/hgcn"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"danielegrattarola/keras-gat","url":"https://github.com/danielegrattarola/keras-gat"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/gnn/gat"},{"title":"Kaimaoge/IGNNK","url":"https://github.com/Kaimaoge/IGNNK"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zhao-tong/GNNs-easy-to-use","url":"https://github.com/zhao-tong/GNNs-easy-to-use"},{"title":"davidpicard/homm","url":"https://github.com/davidpicard/homm"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"snowkylin/gnn","url":"https://github.com/snowkylin/gnn"},{"title":"akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network","url":"https://github.com/akash18tripathi/MAGNET-Multi-Label-Text-Classi-cation-using-Attention-based-Graph-Neural-Network"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"weiyangfb/PyTorchSparseGAT","url":"https://github.com/weiyangfb/PyTorchSparseGAT"},{"title":"HeapHop30/graph-attention-nets","url":"https://github.com/HeapHop30/graph-attention-nets"},{"title":"marblet/GNN_models_pytorch_geometric","url":"https://github.com/marblet/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch_geometric","url":"https://github.com/marble0117/GNN_models_pytorch_geometric"},{"title":"marble0117/GNN_models_pytorch","url":"https://github.com/marble0117/GNN_models_pytorch"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"ds4dm/sGat","url":"https://github.com/ds4dm/sGat"},{"title":"ds4dm/sparse-gcn","url":"https://github.com/ds4dm/sparse-gcn"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"marblet/gat-pytorch","url":"https://github.com/marblet/gat-pytorch"},{"title":"ydzhang-stormstout/HAT","url":"https://github.com/ydzhang-stormstout/HAT"},{"title":"gcucurull/jax-gat","url":"https://github.com/gcucurull/jax-gat"},{"title":"calciver/Graph-Attention-Networks","url":"https://github.com/calciver/Graph-Attention-Networks"},{"title":"shi27feng/transformers.satisfy","url":"https://github.com/shi27feng/transformers.satisfy"},{"title":"pengsl-lab/mssl","url":"https://github.com/pengsl-lab/mssl"},{"title":"pengsl-lab/mssl2drug","url":"https://github.com/pengsl-lab/mssl2drug"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"taishan1994/pytorch_gat","url":"https://github.com/taishan1994/pytorch_gat"},{"title":"wan2000/mc-mot","url":"https://github.com/wan2000/mc-mot"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"dmeoli/neuro-sat","url":"https://github.com/dmeoli/neuro-sat"},{"title":"liu6zijian/simplified-gcn-model","url":"https://github.com/liu6zijian/simplified-gcn-model"},{"title":"tatp22/pytorch-fast-GAT","url":"https://github.com/tatp22/pytorch-fast-GAT"},{"title":"noahtren/Graph-Attention-Networks-TensorFlow-2","url":"https://github.com/noahtren/Graph-Attention-Networks-TensorFlow-2"},{"title":"yururyuru00/GAT_pyG","url":"https://github.com/yururyuru00/GAT_pyG"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"zhanglab-aim/cancer-net","url":"https://github.com/zhanglab-aim/cancer-net"},{"title":"gayanku/FDGATII","url":"https://github.com/gayanku/FDGATII"},{"title":"Yindong-Zhang/myGAT","url":"https://github.com/Yindong-Zhang/myGAT"},{"title":"giuseppefutia/link-prediction-code","url":"https://github.com/giuseppefutia/link-prediction-code"},{"title":"Aveek-Saha/Graph-Attention-Net","url":"https://github.com/Aveek-Saha/Graph-Attention-Net"},{"title":"BIG-S2/keras-gnm","url":"https://github.com/BIG-S2/keras-gnm"},{"title":"mlzxzhou/keras-gnm","url":"https://github.com/mlzxzhou/keras-gnm"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"abhilash1910/GraphAttentionNetworks","url":"https://github.com/abhilash1910/GraphAttentionNetworks"},{"title":"Kristof-Neys/GAT_Neo4j_DGL","url":"https://github.com/Kristof-Neys/GAT_Neo4j_DGL"},{"title":"ak24watch/Graph-Deeplearning-GAT","url":"https://github.com/ak24watch/Graph-Deeplearning-GAT"},{"title":"Negus25/GAT-Mindspore","url":"https://github.com/Negus25/GAT-Mindspore"},{"title":"ChengyuSun/gat","url":"https://github.com/ChengyuSun/gat"},{"title":"joaopedromattos/gnee","url":"https://github.com/joaopedromattos/gnee"},{"title":"mitya8128/experiments_notes","url":"https://github.com/mitya8128/experiments_notes"},{"title":"4pygmalion/GAT_tensorflow","url":"https://github.com/4pygmalion/GAT_tensorflow"},{"title":"vailatuts/SSFG-regularization","url":"https://github.com/vailatuts/SSFG-regularization"},{"title":"handasontam/GAT-with-edgewise-attention","url":"https://github.com/handasontam/GAT-with-edgewise-attention"},{"title":"Mind23-2/MindCode-4","url":"https://github.com/Mind23-2/MindCode-4/tree/main/gat"},{"title":"AngusMonroe/GAT-pytorch","url":"https://github.com/AngusMonroe/GAT-pytorch"},{"title":"fongyk/graph-attention","url":"https://github.com/fongyk/graph-attention"},{"title":"404nofound/gat","url":"https://github.com/404nofound/gat"},{"title":"ColdenChan/GAT_D","url":"https://github.com/ColdenChan/GAT_D"},{"title":"MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints","url":"https://github.com/MehmetBarutcu/Streaming-Algorithm-for-Monotone-k-Submodular-Maximization-with-Cardinality-Constraints"},{"title":"bowu/GraphSearch","url":"https://github.com/bowu/GraphSearch"},{"title":"Messham87/COVID_GAT","url":"https://github.com/Messham87/COVID_GAT"},{"title":"zhangbo2008/GAT_network","url":"https://github.com/zhangbo2008/GAT_network"},{"title":"blueberryc/pyGAT","url":"https://github.com/blueberryc/pyGAT"},{"title":"anish-lu-yihe/SVRT-by-GAT","url":"https://github.com/anish-lu-yihe/SVRT-by-GAT"},{"title":"WantingZhao/my_GAT","url":"https://github.com/WantingZhao/my_GAT"},{"title":"dzb1998/pyGAT","url":"https://github.com/dzb1998/pyGAT"},{"title":"subercui/pyGConvAT","url":"https://github.com/subercui/pyGConvAT"},{"title":"YunseobShin/wiki_GAT","url":"https://github.com/YunseobShin/wiki_GAT"},{"title":"MindSpore-scientific-2/code-4","url":"https://github.com/MindSpore-scientific-2/code-4/tree/main/GR-HSTU"},{"title":"snownus/COOP","url":"https://github.com/snownus/COOP"},{"title":"ChengSashankh/trying-GAT","url":"https://github.com/ChengSashankh/trying-GAT"},{"title":"Anak2016/GAT","url":"https://github.com/Anak2016/GAT"},{"title":"whut2962575697/gat_sementic_segmentation","url":"https://github.com/whut2962575697/gat_sementic_segmentation"},{"title":"Anou9531/GAT","url":"https://github.com/Anou9531/GAT"},{"title":"PumpkinYing/GAT","url":"https://github.com/PumpkinYing/GAT"},{"title":"galkampel/HyperNetworks","url":"https://github.com/galkampel/HyperNetworks"},{"title":"tlmakinen/GAT-noise","url":"https://github.com/tlmakinen/GAT-noise"},{"title":"TyngJiunKuo/deep-learning-project","url":"https://github.com/TyngJiunKuo/deep-learning-project"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122754,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"NDP","metrics":{"Accuracy":"72%"},"paper_url":"https://arxiv.org/abs/1910.11436v3","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","paper_date":"2019-10-24","code_links":[{"title":"danielegrattarola/decimation-pooling","url":"https://github.com/danielegrattarola/decimation-pooling"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122755,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"AWE","metrics":{"Accuracy":"71.51%"},"paper_url":"http://arxiv.org/abs/1805.11921v3","paper_title":"Anonymous Walk Embeddings","paper_date":"2018-05-30","code_links":[{"title":"nd7141/AWE","url":"https://github.com/nd7141/AWE"},{"title":"paulmorio/geo2dr","url":"https://github.com/paulmorio/geo2dr"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122756,"task":"Graph Classification","parent_task":"Classification","dataset":"D&D","model_name":"SF + RFC","metrics":{"Accuracy":"24.6%"},"paper_url":"http://arxiv.org/abs/1810.09155v2","paper_title":"A Simple Baseline Algorithm for Graph Classification","paper_date":"2018-10-22","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"edouardpineau/A-simple-baseline-algorithm-for-graph-classification","url":"https://github.com/edouardpineau/A-simple-baseline-algorithm-for-graph-classification"},{"title":"edouardpineau/Using-Laplacian-Spectrum-as-Graph-Feature-Representation","url":"https://github.com/edouardpineau/Using-Laplacian-Spectrum-as-Graph-Feature-Representation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}