{"task":"Graph Classification","dataset":"IMDb-M","metric_names":["Accuracy","Accuracy (10-fold)"],"rows":[{"id":95264,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"U2GNN (Unsupervised)","metrics":{"Accuracy":"89.2%"},"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":95265,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"TFGW ADJ (L=2)","metrics":{"Accuracy":"56.8%"},"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":95266,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"TREE-G","metrics":{"Accuracy":"56.4%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95267,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"MEWISPool","metrics":{"Accuracy":"56.23%"},"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":95268,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"DUGNN","metrics":{"Accuracy":"56.10%"},"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":95269,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"G_ResNet","metrics":{"Accuracy":"54.53%"},"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":95270,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"sGIN","metrics":{"Accuracy":"54.52%"},"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":95271,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"GIUNet","metrics":{"Accuracy":"54%"},"paper_url":"https://www.sciencedirect.com/science/article/abs/pii/S0957417423017827#preview-section-abstract","paper_title":"Graph isomorphism UNet","paper_date":"2023-08-23","code_links":[{"title":"aramiracle/GIUNet","url":"https://github.com/aramiracle/GIUNet"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95272,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"U2GNN","metrics":{"Accuracy":"53.60%"},"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":95273,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"SEG-BERT","metrics":{"Accuracy":"53.4%"},"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":95274,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"GIN-0","metrics":{"Accuracy":"52.3%"},"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":95275,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"WEGL","metrics":{"Accuracy":"52%"},"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":95276,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"GFN","metrics":{"Accuracy":"51.80%"},"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":95277,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"1-WL Kernel","metrics":{"Accuracy":"51.5%"},"paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","paper_date":"2018-10-04","code_links":[{"title":"chrsmrrs/k-gnn","url":"https://github.com/chrsmrrs/k-gnn"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95278,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"DropGIN","metrics":{"Accuracy":"51.4%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95279,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"GFN-light","metrics":{"Accuracy":"51.20%"},"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":95280,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"UGraphEmb-F","metrics":{"Accuracy":"50.97%"},"paper_url":"https://arxiv.org/abs/1904.01098v2","paper_title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","paper_date":"2019-04-01","code_links":[{"title":"yunshengb/UGraphEmb","url":"https://github.com/yunshengb/UGraphEmb"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95281,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"Graph-JEPA","metrics":{"Accuracy":"50.69%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95282,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"GMT","metrics":{"Accuracy":"50.66%"},"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":95283,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"GDL","metrics":{"Accuracy":"50.64%"},"paper_url":"https://arxiv.org/abs/2102.06555v2","paper_title":"Online Graph Dictionary Learning","paper_date":"2021-02-12","code_links":[{"title":"cedricvincentcuaz/GDL","url":"https://github.com/cedricvincentcuaz/GDL"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95284,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"δ-2-LWL","metrics":{"Accuracy":"50.5%"},"paper_url":"https://arxiv.org/abs/1904.01543v3","paper_title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","paper_date":"2019-04-02","code_links":[{"title":"chrsmrrs/sparsewl","url":"https://github.com/chrsmrrs/sparsewl"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95285,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"CapsGNN","metrics":{"Accuracy":"50.27%"},"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":95286,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"UGraphEmb","metrics":{"Accuracy":"50.06%"},"paper_url":"https://arxiv.org/abs/1904.01098v2","paper_title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","paper_date":"2019-04-01","code_links":[{"title":"yunshengb/UGraphEmb","url":"https://github.com/yunshengb/UGraphEmb"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95287,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"Local Topological Profile (LTP)","metrics":{"Accuracy":"50.0 ± 4.6","Accuracy (10-fold)":"50.0 ± 4.6"},"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":95288,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"PPGN","metrics":{"Accuracy":"50%"},"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":95289,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"InfoGraph","metrics":{"Accuracy":"49.69%"},"paper_url":"https://arxiv.org/abs/1908.01000v3","paper_title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","paper_date":"2019-07-31","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/infograph"},{"title":"fanyun-sun/InfoGraph","url":"https://github.com/fanyun-sun/InfoGraph"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"hengruizhang98/InfoGraph","url":"https://github.com/hengruizhang98/InfoGraph"},{"title":"ycremar/DIG-SSL","url":"https://github.com/ycremar/DIG-SSL"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95290,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"k-GNN","metrics":{"Accuracy":"49.5%"},"paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","paper_date":"2018-10-04","code_links":[{"title":"chrsmrrs/k-gnn","url":"https://github.com/chrsmrrs/k-gnn"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95291,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"WKPI-kcenters","metrics":{"Accuracy":"49.5%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95292,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"hGANet","metrics":{"Accuracy":"49.06%"},"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":95293,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"ApproxRepSet","metrics":{"Accuracy":"48.92%"},"paper_url":"https://arxiv.org/abs/1904.01962v2","paper_title":"Rep the Set: Neural Networks for Learning Set Representations","paper_date":"2019-04-03","code_links":[{"title":"giannisnik/repset","url":"https://github.com/giannisnik/repset"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95294,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"DGCNN","metrics":{"Accuracy":"47.83%"},"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":95295,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"GraphSAGE","metrics":{"Accuracy":"47.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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95296,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"DGK","metrics":{"Accuracy":"44.55%"},"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":95297,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"SPI-GCN","metrics":{"Accuracy":"44.13%"},"paper_url":"https://hal.archives-ouvertes.fr/hal-02093451/","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","paper_date":"2019-04-08","code_links":[],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95298,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"DGCNN (sum)","metrics":{"Accuracy":"42.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":95299,"task":"Graph Classification","parent_task":null,"dataset":"IMDb-M","model_name":"G-Tuning","metrics":{"Accuracy (10-fold)":"51.80"},"paper_url":"https://arxiv.org/abs/2312.13583v1","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_date":"2023-12-21","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122033,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"U2GNN (Unsupervised)","metrics":{"Accuracy":"89.2%"},"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":122034,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"TFGW ADJ (L=2)","metrics":{"Accuracy":"56.8%"},"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":122035,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"TREE-G","metrics":{"Accuracy":"56.4%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122036,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"MEWISPool","metrics":{"Accuracy":"56.23%"},"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":122037,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"DUGNN","metrics":{"Accuracy":"56.10%"},"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":122038,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"G_ResNet","metrics":{"Accuracy":"54.53%"},"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":122039,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"sGIN","metrics":{"Accuracy":"54.52%"},"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":122040,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"GIUNet","metrics":{"Accuracy":"54%"},"paper_url":"https://www.sciencedirect.com/science/article/abs/pii/S0957417423017827#preview-section-abstract","paper_title":"Graph isomorphism UNet","paper_date":"2023-08-23","code_links":[{"title":"aramiracle/GIUNet","url":"https://github.com/aramiracle/GIUNet"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122041,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"U2GNN","metrics":{"Accuracy":"53.60%"},"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":122042,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"SEG-BERT","metrics":{"Accuracy":"53.4%"},"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":122043,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"GIN-0","metrics":{"Accuracy":"52.3%"},"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":122044,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"WEGL","metrics":{"Accuracy":"52%"},"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":122045,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"GFN","metrics":{"Accuracy":"51.80%"},"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":122046,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"1-WL Kernel","metrics":{"Accuracy":"51.5%"},"paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","paper_date":"2018-10-04","code_links":[{"title":"chrsmrrs/k-gnn","url":"https://github.com/chrsmrrs/k-gnn"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122047,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"DropGIN","metrics":{"Accuracy":"51.4%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122048,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"GFN-light","metrics":{"Accuracy":"51.20%"},"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":122049,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"UGraphEmb-F","metrics":{"Accuracy":"50.97%"},"paper_url":"https://arxiv.org/abs/1904.01098v2","paper_title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","paper_date":"2019-04-01","code_links":[{"title":"yunshengb/UGraphEmb","url":"https://github.com/yunshengb/UGraphEmb"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122050,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"Graph-JEPA","metrics":{"Accuracy":"50.69%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122051,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"GMT","metrics":{"Accuracy":"50.66%"},"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":122052,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"GDL","metrics":{"Accuracy":"50.64%"},"paper_url":"https://arxiv.org/abs/2102.06555v2","paper_title":"Online Graph Dictionary Learning","paper_date":"2021-02-12","code_links":[{"title":"cedricvincentcuaz/GDL","url":"https://github.com/cedricvincentcuaz/GDL"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122053,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"δ-2-LWL","metrics":{"Accuracy":"50.5%"},"paper_url":"https://arxiv.org/abs/1904.01543v3","paper_title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","paper_date":"2019-04-02","code_links":[{"title":"chrsmrrs/sparsewl","url":"https://github.com/chrsmrrs/sparsewl"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122054,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"CapsGNN","metrics":{"Accuracy":"50.27%"},"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":122055,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"UGraphEmb","metrics":{"Accuracy":"50.06%"},"paper_url":"https://arxiv.org/abs/1904.01098v2","paper_title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","paper_date":"2019-04-01","code_links":[{"title":"yunshengb/UGraphEmb","url":"https://github.com/yunshengb/UGraphEmb"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122056,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"Local Topological Profile (LTP)","metrics":{"Accuracy":"50.0 ± 4.6","Accuracy (10-fold)":"50.0 ± 4.6"},"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":122057,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"PPGN","metrics":{"Accuracy":"50%"},"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":122058,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"InfoGraph","metrics":{"Accuracy":"49.69%"},"paper_url":"https://arxiv.org/abs/1908.01000v3","paper_title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","paper_date":"2019-07-31","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/infograph"},{"title":"fanyun-sun/InfoGraph","url":"https://github.com/fanyun-sun/InfoGraph"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"hengruizhang98/InfoGraph","url":"https://github.com/hengruizhang98/InfoGraph"},{"title":"ycremar/DIG-SSL","url":"https://github.com/ycremar/DIG-SSL"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122059,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"k-GNN","metrics":{"Accuracy":"49.5%"},"paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","paper_date":"2018-10-04","code_links":[{"title":"chrsmrrs/k-gnn","url":"https://github.com/chrsmrrs/k-gnn"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122060,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"WKPI-kcenters","metrics":{"Accuracy":"49.5%"},"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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122061,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"hGANet","metrics":{"Accuracy":"49.06%"},"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":122062,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"ApproxRepSet","metrics":{"Accuracy":"48.92%"},"paper_url":"https://arxiv.org/abs/1904.01962v2","paper_title":"Rep the Set: Neural Networks for Learning Set Representations","paper_date":"2019-04-03","code_links":[{"title":"giannisnik/repset","url":"https://github.com/giannisnik/repset"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122063,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"DGCNN","metrics":{"Accuracy":"47.83%"},"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":122064,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"GraphSAGE","metrics":{"Accuracy":"47.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\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122065,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"DGK","metrics":{"Accuracy":"44.55%"},"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":122066,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"SPI-GCN","metrics":{"Accuracy":"44.13%"},"paper_url":"https://hal.archives-ouvertes.fr/hal-02093451/","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","paper_date":"2019-04-08","code_links":[],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122067,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"DGCNN (sum)","metrics":{"Accuracy":"42.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":122068,"task":"Graph Classification","parent_task":"Classification","dataset":"IMDb-M","model_name":"G-Tuning","metrics":{"Accuracy (10-fold)":"51.80"},"paper_url":"https://arxiv.org/abs/2312.13583v1","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","paper_date":"2023-12-21","code_links":[{"title":"zjunet/G-Tuning","url":"https://github.com/zjunet/G-Tuning"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}