{"task":"Graph Classification","dataset":"PTC","metric_names":["Accuracy"],"rows":[{"id":95319,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"U2GNN (Unsupervised)","metrics":{"Accuracy":"91.81%"},"paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_date":"2019-09-26","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95320,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"GIUNet","metrics":{"Accuracy":"85.7%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95321,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"GIC","metrics":{"Accuracy":"77.64%"},"paper_url":"http://arxiv.org/abs/1811.04393v1","paper_title":"Gaussian-Induced Convolution for Graphs","paper_date":"2018-11-11","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95322,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"DUGNN","metrics":{"Accuracy":"74.7%"},"paper_url":"https://arxiv.org/abs/1909.10086v3","paper_title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","paper_date":"2019-09-22","code_links":[{"title":"vermaMachineLearning/Universal-Graph-Embedding-Neural-Network","url":"https://github.com/vermaMachineLearning/Universal-Graph-Embedding-Neural-Network"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":95323,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"UGraphEmb-F","metrics":{"Accuracy":"73.56%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95324,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"sGIN","metrics":{"Accuracy":"73.56%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95325,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"G_DenseNet","metrics":{"Accuracy":"73.24%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95326,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"CIN++","metrics":{"Accuracy":"73.2%"},"paper_url":"https://arxiv.org/abs/2306.03561v1","paper_title":"CIN++: Enhancing Topological Message Passing","paper_date":"2023-06-06","code_links":[{"title":"twitter-research/cwn","url":"https://github.com/twitter-research/cwn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95327,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"CAN","metrics":{"Accuracy":"72.8%"},"paper_url":"https://arxiv.org/abs/2209.08179v1","paper_title":"Cell Attention Networks","paper_date":"2022-09-16","code_links":[{"title":"lrnzgiusti/can","url":"https://github.com/lrnzgiusti/can"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95328,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"UGraphEmb","metrics":{"Accuracy":"72.54%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95329,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"TFGW ADJ (L=2)","metrics":{"Accuracy":"72.4%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95330,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"DGA","metrics":{"Accuracy":"71.24%"},"paper_url":"https://doi.org/10.1109/ICBK.2018.00033","paper_title":"Discriminative Graph Autoencoder","paper_date":"2018-11-17","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95331,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"U2GNN","metrics":{"Accuracy":"69.63%"},"paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_date":"2019-09-26","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95332,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"BC + Capsules","metrics":{"Accuracy":"69%"},"paper_url":"http://arxiv.org/abs/1902.08399v1","paper_title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","paper_date":"2019-02-22","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95333,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"SEG-BERT","metrics":{"Accuracy":"68.86%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95334,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"Spec-GN","metrics":{"Accuracy":"68.05%"},"paper_url":"https://arxiv.org/abs/2112.07160v2","paper_title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","paper_date":"2021-12-14","code_links":[{"title":"qslim/gnn-spectrum","url":"https://github.com/qslim/gnn-spectrum"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95335,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"WEGL","metrics":{"Accuracy":"67.5%"},"paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","paper_date":"2020-06-16","code_links":[{"title":"navid-naderi/WEGL","url":"https://github.com/navid-naderi/WEGL"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95336,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"WWL","metrics":{"Accuracy":"66.31%"},"paper_url":"https://arxiv.org/abs/1906.01277v2","paper_title":"Wasserstein Weisfeiler-Lehman Graph Kernels","paper_date":"2019-06-04","code_links":[{"title":"BorgwardtLab/WWL","url":"https://github.com/BorgwardtLab/WWL"},{"title":"wenbintum/wwl-gpr","url":"https://github.com/wenbintum/wwl-gpr"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95337,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"DropGIN","metrics":{"Accuracy":"66.3%"},"paper_url":"https://arxiv.org/abs/2111.06283v1","paper_title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","paper_date":"2021-11-11","code_links":[{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95338,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"PPGN","metrics":{"Accuracy":"66.17%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95339,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"Deep WL SGN(0,1,2)","metrics":{"Accuracy":"65.88%"},"paper_url":"https://arxiv.org/abs/1903.09022v3","paper_title":"Subgraph Networks with Application to Structural Feature Space Expansion","paper_date":"2019-03-21","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95340,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"DGCNN","metrics":{"Accuracy":"65.43%"},"paper_url":"http://arxiv.org/abs/1712.03563v1","paper_title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","paper_date":"2017-12-10","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95341,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"hGANet","metrics":{"Accuracy":"65.02%"},"paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","paper_date":"2019-07-05","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95342,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"GIN-0","metrics":{"Accuracy":"64.40%"},"paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","paper_date":"2018-10-01","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95343,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"cGANet","metrics":{"Accuracy":"63.53%"},"paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","paper_date":"2019-07-05","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95344,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"DDGK","metrics":{"Accuracy":"63.14%"},"paper_url":"http://arxiv.org/abs/1904.09671v1","paper_title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","paper_date":"2019-04-21","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research/tree/master/graph_embedding/ddgk"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95345,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"GANet","metrics":{"Accuracy":"62.94%"},"paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","paper_date":"2019-07-05","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95346,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"DAGCN","metrics":{"Accuracy":"62.88%"},"paper_url":"http://arxiv.org/abs/1904.02278v1","paper_title":"DAGCN: Dual Attention Graph Convolutional Networks","paper_date":"2019-04-04","code_links":[{"title":"dawenzi123/DAGCN","url":"https://github.com/dawenzi123/DAGCN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95347,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"SF + RFC","metrics":{"Accuracy":"62.8%"},"paper_url":"http://arxiv.org/abs/1810.09155v2","paper_title":"A Simple Baseline Algorithm for Graph Classification","paper_date":"2018-10-22","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"edouardpineau/A-simple-baseline-algorithm-for-graph-classification","url":"https://github.com/edouardpineau/A-simple-baseline-algorithm-for-graph-classification"},{"title":"edouardpineau/Using-Laplacian-Spectrum-as-Graph-Feature-Representation","url":"https://github.com/edouardpineau/Using-Laplacian-Spectrum-as-Graph-Feature-Representation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95348,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"δ-2-LWL","metrics":{"Accuracy":"62.70%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95349,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"LDP","metrics":{"Accuracy":"61.7%"},"paper_url":"https://arxiv.org/abs/1811.03508v3","paper_title":"A simple yet effective baseline for non-attributed graph classification","paper_date":"2018-11-08","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"Chen-Cai-OSU/LDP","url":"https://github.com/Chen-Cai-OSU/LDP"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95350,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"InfoGraph","metrics":{"Accuracy":"61.65"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95351,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"graph2vec","metrics":{"Accuracy":"60.17% ± 6.86%"},"paper_url":"http://arxiv.org/abs/1707.05005v1","paper_title":"graph2vec: Learning Distributed Representations of Graphs","paper_date":"2017-07-17","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/graph2vec","url":"https://github.com/benedekrozemberczki/graph2vec"},{"title":"MLDroid/graph2vec_tf","url":"https://github.com/MLDroid/graph2vec_tf"},{"title":"paulmorio/geo2dr","url":"https://github.com/paulmorio/geo2dr"},{"title":"compnet/pang","url":"https://github.com/compnet/pang"},{"title":"soumavaghosh/graph2vec","url":"https://github.com/soumavaghosh/graph2vec"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95352,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"PATCHY-SAN","metrics":{"Accuracy":"60.00%"},"paper_url":"http://arxiv.org/abs/1605.05273v4","paper_title":"Learning Convolutional Neural Networks for Graphs","paper_date":"2016-05-17","code_links":[{"title":"tvayer/PSCN","url":"https://github.com/tvayer/PSCN"},{"title":"CielAl/PatchySan","url":"https://github.com/CielAl/PatchySan"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95353,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"IsoNN","metrics":{"Accuracy":"59.9%"},"paper_url":"https://arxiv.org/abs/1907.09495v2","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_date":"2019-07-22","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95354,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"TREE-G","metrics":{"Accuracy":"59.1%"},"paper_url":"https://arxiv.org/abs/2207.02760v5","paper_title":"TREE-G: Decision Trees Contesting Graph Neural Networks","paper_date":"2022-07-06","code_links":[{"title":"mayabechlerspeicher/tree-g","url":"https://github.com/mayabechlerspeicher/tree-g"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95355,"task":"Graph Classification","parent_task":null,"dataset":"PTC","model_name":"SPI-GCN","metrics":{"Accuracy":"56.41%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122088,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"U2GNN (Unsupervised)","metrics":{"Accuracy":"91.81%"},"paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_date":"2019-09-26","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122089,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"GIUNet","metrics":{"Accuracy":"85.7%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122090,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"GIC","metrics":{"Accuracy":"77.64%"},"paper_url":"http://arxiv.org/abs/1811.04393v1","paper_title":"Gaussian-Induced Convolution for Graphs","paper_date":"2018-11-11","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122091,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"DUGNN","metrics":{"Accuracy":"74.7%"},"paper_url":"https://arxiv.org/abs/1909.10086v3","paper_title":"Learning Universal Graph Neural Network Embeddings With Aid Of Transfer Learning","paper_date":"2019-09-22","code_links":[{"title":"vermaMachineLearning/Universal-Graph-Embedding-Neural-Network","url":"https://github.com/vermaMachineLearning/Universal-Graph-Embedding-Neural-Network"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":1,"source":"archive","tags":[]},{"id":122092,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"UGraphEmb-F","metrics":{"Accuracy":"73.56%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122093,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"sGIN","metrics":{"Accuracy":"73.56%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122094,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"G_DenseNet","metrics":{"Accuracy":"73.24%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122095,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"CIN++","metrics":{"Accuracy":"73.2%"},"paper_url":"https://arxiv.org/abs/2306.03561v1","paper_title":"CIN++: Enhancing Topological Message Passing","paper_date":"2023-06-06","code_links":[{"title":"twitter-research/cwn","url":"https://github.com/twitter-research/cwn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122096,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"CAN","metrics":{"Accuracy":"72.8%"},"paper_url":"https://arxiv.org/abs/2209.08179v1","paper_title":"Cell Attention Networks","paper_date":"2022-09-16","code_links":[{"title":"lrnzgiusti/can","url":"https://github.com/lrnzgiusti/can"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122097,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"UGraphEmb","metrics":{"Accuracy":"72.54%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122098,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"TFGW ADJ (L=2)","metrics":{"Accuracy":"72.4%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122099,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"DGA","metrics":{"Accuracy":"71.24%"},"paper_url":"https://doi.org/10.1109/ICBK.2018.00033","paper_title":"Discriminative Graph Autoencoder","paper_date":"2018-11-17","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122100,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"U2GNN","metrics":{"Accuracy":"69.63%"},"paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","paper_date":"2019-09-26","code_links":[{"title":"daiquocnguyen/Graph-Transformer","url":"https://github.com/daiquocnguyen/Graph-Transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122101,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"BC + Capsules","metrics":{"Accuracy":"69%"},"paper_url":"http://arxiv.org/abs/1902.08399v1","paper_title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","paper_date":"2019-02-22","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122102,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"SEG-BERT","metrics":{"Accuracy":"68.86%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122103,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"Spec-GN","metrics":{"Accuracy":"68.05%"},"paper_url":"https://arxiv.org/abs/2112.07160v2","paper_title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","paper_date":"2021-12-14","code_links":[{"title":"qslim/gnn-spectrum","url":"https://github.com/qslim/gnn-spectrum"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122104,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"WEGL","metrics":{"Accuracy":"67.5%"},"paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","paper_date":"2020-06-16","code_links":[{"title":"navid-naderi/WEGL","url":"https://github.com/navid-naderi/WEGL"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122105,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"WWL","metrics":{"Accuracy":"66.31%"},"paper_url":"https://arxiv.org/abs/1906.01277v2","paper_title":"Wasserstein Weisfeiler-Lehman Graph Kernels","paper_date":"2019-06-04","code_links":[{"title":"BorgwardtLab/WWL","url":"https://github.com/BorgwardtLab/WWL"},{"title":"wenbintum/wwl-gpr","url":"https://github.com/wenbintum/wwl-gpr"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122106,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"DropGIN","metrics":{"Accuracy":"66.3%"},"paper_url":"https://arxiv.org/abs/2111.06283v1","paper_title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","paper_date":"2021-11-11","code_links":[{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122107,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"PPGN","metrics":{"Accuracy":"66.17%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122108,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"Deep WL SGN(0,1,2)","metrics":{"Accuracy":"65.88%"},"paper_url":"https://arxiv.org/abs/1903.09022v3","paper_title":"Subgraph Networks with Application to Structural Feature Space Expansion","paper_date":"2019-03-21","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122109,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"DGCNN","metrics":{"Accuracy":"65.43%"},"paper_url":"http://arxiv.org/abs/1712.03563v1","paper_title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","paper_date":"2017-12-10","code_links":[],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122110,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"hGANet","metrics":{"Accuracy":"65.02%"},"paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","paper_date":"2019-07-05","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122111,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"GIN-0","metrics":{"Accuracy":"64.40%"},"paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","paper_date":"2018-10-01","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122112,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"cGANet","metrics":{"Accuracy":"63.53%"},"paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","paper_date":"2019-07-05","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122113,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"DDGK","metrics":{"Accuracy":"63.14%"},"paper_url":"http://arxiv.org/abs/1904.09671v1","paper_title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","paper_date":"2019-04-21","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research/tree/master/graph_embedding/ddgk"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122114,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"GANet","metrics":{"Accuracy":"62.94%"},"paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","paper_date":"2019-07-05","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122115,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"DAGCN","metrics":{"Accuracy":"62.88%"},"paper_url":"http://arxiv.org/abs/1904.02278v1","paper_title":"DAGCN: Dual Attention Graph Convolutional Networks","paper_date":"2019-04-04","code_links":[{"title":"dawenzi123/DAGCN","url":"https://github.com/dawenzi123/DAGCN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122116,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"SF + RFC","metrics":{"Accuracy":"62.8%"},"paper_url":"http://arxiv.org/abs/1810.09155v2","paper_title":"A Simple Baseline Algorithm for Graph Classification","paper_date":"2018-10-22","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"edouardpineau/A-simple-baseline-algorithm-for-graph-classification","url":"https://github.com/edouardpineau/A-simple-baseline-algorithm-for-graph-classification"},{"title":"edouardpineau/Using-Laplacian-Spectrum-as-Graph-Feature-Representation","url":"https://github.com/edouardpineau/Using-Laplacian-Spectrum-as-Graph-Feature-Representation"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122117,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"δ-2-LWL","metrics":{"Accuracy":"62.70%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122118,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"LDP","metrics":{"Accuracy":"61.7%"},"paper_url":"https://arxiv.org/abs/1811.03508v3","paper_title":"A simple yet effective baseline for non-attributed graph classification","paper_date":"2018-11-08","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"Chen-Cai-OSU/LDP","url":"https://github.com/Chen-Cai-OSU/LDP"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122119,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"InfoGraph","metrics":{"Accuracy":"61.65"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122120,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"graph2vec","metrics":{"Accuracy":"60.17% ± 6.86%"},"paper_url":"http://arxiv.org/abs/1707.05005v1","paper_title":"graph2vec: Learning Distributed Representations of Graphs","paper_date":"2017-07-17","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/graph2vec","url":"https://github.com/benedekrozemberczki/graph2vec"},{"title":"MLDroid/graph2vec_tf","url":"https://github.com/MLDroid/graph2vec_tf"},{"title":"paulmorio/geo2dr","url":"https://github.com/paulmorio/geo2dr"},{"title":"compnet/pang","url":"https://github.com/compnet/pang"},{"title":"soumavaghosh/graph2vec","url":"https://github.com/soumavaghosh/graph2vec"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122121,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"PATCHY-SAN","metrics":{"Accuracy":"60.00%"},"paper_url":"http://arxiv.org/abs/1605.05273v4","paper_title":"Learning Convolutional Neural Networks for Graphs","paper_date":"2016-05-17","code_links":[{"title":"tvayer/PSCN","url":"https://github.com/tvayer/PSCN"},{"title":"CielAl/PatchySan","url":"https://github.com/CielAl/PatchySan"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122122,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"IsoNN","metrics":{"Accuracy":"59.9%"},"paper_url":"https://arxiv.org/abs/1907.09495v2","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","paper_date":"2019-07-22","code_links":[{"title":"linmengsysu/IsoNN","url":"https://github.com/linmengsysu/IsoNN"},{"title":"jwzhanggy/isocapsnet","url":"https://github.com/jwzhanggy/isocapsnet"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122123,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"TREE-G","metrics":{"Accuracy":"59.1%"},"paper_url":"https://arxiv.org/abs/2207.02760v5","paper_title":"TREE-G: Decision Trees Contesting Graph Neural Networks","paper_date":"2022-07-06","code_links":[{"title":"mayabechlerspeicher/tree-g","url":"https://github.com/mayabechlerspeicher/tree-g"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122124,"task":"Graph Classification","parent_task":"Classification","dataset":"PTC","model_name":"SPI-GCN","metrics":{"Accuracy":"56.41%"},"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\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}