{"task":"Graph Classification","dataset":"COLLAB","metric_names":["Accuracy","Accuracy (10-fold)"],"rows":[{"id":95662,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"U2GNN (Unsupervised)","metrics":{"Accuracy":"95.62%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95663,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"TFGW ADJ (L=2)","metrics":{"Accuracy":"84.3%"},"paper_url":"https://arxiv.org/abs/2205.15733v1","paper_title":"Template based Graph Neural Network with Optimal Transport Distances","paper_date":"2022-05-31","code_links":[{"title":"cedricvincentcuaz/TFGW","url":"https://github.com/cedricvincentcuaz/TFGW"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95664,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"DUGNN","metrics":{"Accuracy":"84.20%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":95665,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"G_DenseNet","metrics":{"Accuracy":"83.16%"},"paper_url":"http://arxiv.org/abs/1807.02653v1","paper_title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","paper_date":"2018-07-07","code_links":[],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95666,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GFN","metrics":{"Accuracy":"81.50%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95667,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"PPGN","metrics":{"Accuracy":"81.38%"},"paper_url":"https://arxiv.org/abs/1905.11136v4","paper_title":"Provably Powerful Graph Networks","paper_date":"2019-05-27","code_links":[{"title":"hadarser/ProvablyPowerfulGraphNetworks_torch","url":"https://github.com/hadarser/ProvablyPowerfulGraphNetworks_torch"},{"title":"hadarser/ProvablyPowerfulGraphNetworks","url":"https://github.com/hadarser/ProvablyPowerfulGraphNetworks"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95668,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GFN-light","metrics":{"Accuracy":"81.34%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95669,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"FactorGCN","metrics":{"Accuracy":"81.2%","Accuracy (10-fold)":"81.2%"},"paper_url":"https://arxiv.org/abs/2010.05421v1","paper_title":"Factorizable Graph Convolutional Networks","paper_date":"2020-10-12","code_links":[{"title":"ihollywhy/FactorGCN.PyTorch","url":"https://github.com/ihollywhy/FactorGCN.PyTorch"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95670,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GMT","metrics":{"Accuracy":"80.74%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95671,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"sGIN","metrics":{"Accuracy":"80.71%"},"paper_url":"https://arxiv.org/abs/1905.08509v4","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_date":"2019-05-21","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95672,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GCN","metrics":{"Accuracy":"80.6%"},"paper_url":"http://arxiv.org/abs/1903.02428v3","paper_title":"Fast Graph Representation Learning with PyTorch Geometric","paper_date":"2019-03-06","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"leojklarner/gauche","url":"https://github.com/leojklarner/gauche"},{"title":"ncfrey/litmatter","url":"https://github.com/ncfrey/litmatter"},{"title":"long-9621/splinecnn","url":"https://github.com/long-9621/splinecnn"},{"title":"luxtu/OCTA-graph","url":"https://github.com/luxtu/OCTA-graph"},{"title":"NMADALI97/French-web-domain-classification","url":"https://github.com/NMADALI97/French-web-domain-classification"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95673,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"Self-supervised GraphMAE","metrics":{"Accuracy":"80.32%"},"paper_url":"https://arxiv.org/abs/2205.10803v3","paper_title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","paper_date":"2022-05-22","code_links":[{"title":"thudm/graphmae","url":"https://github.com/thudm/graphmae"},{"title":"thudm/graphmae2","url":"https://github.com/thudm/graphmae2"},{"title":"wehos/cellt","url":"https://github.com/wehos/cellt"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95674,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GIN-0","metrics":{"Accuracy":"80.2%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95675,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"WEGL","metrics":{"Accuracy":"79.8%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95676,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"MEWISPool","metrics":{"Accuracy":"79.66%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95677,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"CapsGNN","metrics":{"Accuracy":"79.62%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95678,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"Local Topological Profile (LTP)","metrics":{"Accuracy":"79.4 ± 2.5","Accuracy (10-fold)":"79.4 ± 2.5"},"paper_url":"https://arxiv.org/abs/2305.00724v1","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","paper_date":"2023-05-01","code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95679,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"NDP","metrics":{"Accuracy":"79.1%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95680,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"SEG-BERT","metrics":{"Accuracy":"78.42%"},"paper_url":"https://arxiv.org/abs/2002.03283v1","paper_title":"Segmented Graph-Bert for Graph Instance Modeling","paper_date":"2020-02-09","code_links":[{"title":"jwzhanggy/SEG-BERT","url":"https://github.com/jwzhanggy/SEG-BERT"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95681,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"U2GNN","metrics":{"Accuracy":"77.84%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95682,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"R-GIN + PANDA","metrics":{"Accuracy":"77.8%"},"paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_date":"2024-06-06","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95683,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"Graph U-Nets","metrics":{"Accuracy":"77.56%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95684,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"hGANet","metrics":{"Accuracy":"77.48%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95685,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GNN (DiffPool)","metrics":{"Accuracy":"75.48%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95686,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GIN + PANDA","metrics":{"Accuracy":"75.11%"},"paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_date":"2024-06-06","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95687,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GraphSAGE","metrics":{"Accuracy":"73.9%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95688,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"DGCNN","metrics":{"Accuracy":"73.76%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95689,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"DGK","metrics":{"Accuracy":"73.09%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95690,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"DiffWire","metrics":{"Accuracy":"72.24%"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95691,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"2D CNN","metrics":{"Accuracy":"71.76%"},"paper_url":"https://arxiv.org/abs/1708.02218v4","paper_title":"Graph Classification with 2D Convolutional Neural Networks","paper_date":"2017-07-29","code_links":[],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95692,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"R-GCN + PANDA","metrics":{"Accuracy":"71.4%"},"paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_date":"2024-06-06","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95693,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"CT-Layer","metrics":{"Accuracy":"69.87%"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95694,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"DGCNN (sum)","metrics":{"Accuracy":"69.45%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95695,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GCN + PANDA","metrics":{"Accuracy":"68.4%"},"paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_date":"2024-06-06","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95696,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"DGCNN","metrics":{"Accuracy":"68.34%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95697,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"Weak-supervised ChebyNet","metrics":{"Accuracy":"66.97%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95698,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GAP-Layer (Ncut)","metrics":{"Accuracy":"65.89%"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95699,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"1-NMFPool","metrics":{"Accuracy":"65.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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95700,"task":"Graph Classification","parent_task":null,"dataset":"COLLAB","model_name":"GAP-Layer (Rcut)","metrics":{"Accuracy":"64.47%"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122431,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"U2GNN (Unsupervised)","metrics":{"Accuracy":"95.62%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122432,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"TFGW ADJ (L=2)","metrics":{"Accuracy":"84.3%"},"paper_url":"https://arxiv.org/abs/2205.15733v1","paper_title":"Template based Graph Neural Network with Optimal Transport Distances","paper_date":"2022-05-31","code_links":[{"title":"cedricvincentcuaz/TFGW","url":"https://github.com/cedricvincentcuaz/TFGW"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122433,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"DUGNN","metrics":{"Accuracy":"84.20%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":122434,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"G_DenseNet","metrics":{"Accuracy":"83.16%"},"paper_url":"http://arxiv.org/abs/1807.02653v1","paper_title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","paper_date":"2018-07-07","code_links":[],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122435,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GFN","metrics":{"Accuracy":"81.50%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122436,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"PPGN","metrics":{"Accuracy":"81.38%"},"paper_url":"https://arxiv.org/abs/1905.11136v4","paper_title":"Provably Powerful Graph Networks","paper_date":"2019-05-27","code_links":[{"title":"hadarser/ProvablyPowerfulGraphNetworks_torch","url":"https://github.com/hadarser/ProvablyPowerfulGraphNetworks_torch"},{"title":"hadarser/ProvablyPowerfulGraphNetworks","url":"https://github.com/hadarser/ProvablyPowerfulGraphNetworks"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122437,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GFN-light","metrics":{"Accuracy":"81.34%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122438,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"FactorGCN","metrics":{"Accuracy":"81.2%","Accuracy (10-fold)":"81.2%"},"paper_url":"https://arxiv.org/abs/2010.05421v1","paper_title":"Factorizable Graph Convolutional Networks","paper_date":"2020-10-12","code_links":[{"title":"ihollywhy/FactorGCN.PyTorch","url":"https://github.com/ihollywhy/FactorGCN.PyTorch"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122439,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GMT","metrics":{"Accuracy":"80.74%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122440,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"sGIN","metrics":{"Accuracy":"80.71%"},"paper_url":"https://arxiv.org/abs/1905.08509v4","paper_title":"Mutual Information Maximization in Graph Neural Networks","paper_date":"2019-05-21","code_links":[{"title":"CODE-SUBMIT/Graph_Neighborhood_1","url":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1"},{"title":"CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network","url":"https://github.com/CODE-SUBMIT/Neighborhood-Enlargement-in-Graph-Network"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122441,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GCN","metrics":{"Accuracy":"80.6%"},"paper_url":"http://arxiv.org/abs/1903.02428v3","paper_title":"Fast Graph Representation Learning with PyTorch Geometric","paper_date":"2019-03-06","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"leojklarner/gauche","url":"https://github.com/leojklarner/gauche"},{"title":"ncfrey/litmatter","url":"https://github.com/ncfrey/litmatter"},{"title":"long-9621/splinecnn","url":"https://github.com/long-9621/splinecnn"},{"title":"luxtu/OCTA-graph","url":"https://github.com/luxtu/OCTA-graph"},{"title":"NMADALI97/French-web-domain-classification","url":"https://github.com/NMADALI97/French-web-domain-classification"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122442,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"Self-supervised GraphMAE","metrics":{"Accuracy":"80.32%"},"paper_url":"https://arxiv.org/abs/2205.10803v3","paper_title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","paper_date":"2022-05-22","code_links":[{"title":"thudm/graphmae","url":"https://github.com/thudm/graphmae"},{"title":"thudm/graphmae2","url":"https://github.com/thudm/graphmae2"},{"title":"wehos/cellt","url":"https://github.com/wehos/cellt"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122443,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GIN-0","metrics":{"Accuracy":"80.2%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122444,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"WEGL","metrics":{"Accuracy":"79.8%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122445,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"MEWISPool","metrics":{"Accuracy":"79.66%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122446,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"CapsGNN","metrics":{"Accuracy":"79.62%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122447,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"Local Topological Profile (LTP)","metrics":{"Accuracy":"79.4 ± 2.5","Accuracy (10-fold)":"79.4 ± 2.5"},"paper_url":"https://arxiv.org/abs/2305.00724v1","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","paper_date":"2023-05-01","code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122448,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"NDP","metrics":{"Accuracy":"79.1%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122449,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"SEG-BERT","metrics":{"Accuracy":"78.42%"},"paper_url":"https://arxiv.org/abs/2002.03283v1","paper_title":"Segmented Graph-Bert for Graph Instance Modeling","paper_date":"2020-02-09","code_links":[{"title":"jwzhanggy/SEG-BERT","url":"https://github.com/jwzhanggy/SEG-BERT"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122450,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"U2GNN","metrics":{"Accuracy":"77.84%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122451,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"R-GIN + PANDA","metrics":{"Accuracy":"77.8%"},"paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_date":"2024-06-06","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122452,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"Graph U-Nets","metrics":{"Accuracy":"77.56%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122453,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"hGANet","metrics":{"Accuracy":"77.48%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122454,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GNN (DiffPool)","metrics":{"Accuracy":"75.48%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122455,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GIN + PANDA","metrics":{"Accuracy":"75.11%"},"paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_date":"2024-06-06","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122456,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GraphSAGE","metrics":{"Accuracy":"73.9%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122457,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"DGCNN","metrics":{"Accuracy":"73.76%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122458,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"DGK","metrics":{"Accuracy":"73.09%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122459,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"DiffWire","metrics":{"Accuracy":"72.24%"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122460,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"2D CNN","metrics":{"Accuracy":"71.76%"},"paper_url":"https://arxiv.org/abs/1708.02218v4","paper_title":"Graph Classification with 2D Convolutional Neural Networks","paper_date":"2017-07-29","code_links":[],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122461,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"R-GCN + PANDA","metrics":{"Accuracy":"71.4%"},"paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_date":"2024-06-06","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122462,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"CT-Layer","metrics":{"Accuracy":"69.87%"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122463,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"DGCNN (sum)","metrics":{"Accuracy":"69.45%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122464,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GCN + PANDA","metrics":{"Accuracy":"68.4%"},"paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","paper_date":"2024-06-06","code_links":[{"title":"jeongwhanchoi/panda","url":"https://github.com/jeongwhanchoi/panda"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122465,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"DGCNN","metrics":{"Accuracy":"68.34%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122466,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"Weak-supervised ChebyNet","metrics":{"Accuracy":"66.97%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122467,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GAP-Layer (Ncut)","metrics":{"Accuracy":"65.89%"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122468,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"1-NMFPool","metrics":{"Accuracy":"65.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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122469,"task":"Graph Classification","parent_task":"Classification","dataset":"COLLAB","model_name":"GAP-Layer (Rcut)","metrics":{"Accuracy":"64.47%"},"paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","paper_date":"2022-06-15","code_links":[{"title":"ellisalicante/GraphRewiring-Tutorial","url":"https://github.com/ellisalicante/GraphRewiring-Tutorial"},{"title":"AdrianArnaiz/DiffWire","url":"https://github.com/AdrianArnaiz/DiffWire"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}