{"url":"/sota/graph-classification-on-mutag","task":{"name":"Graph Classification","url":"/task/graph-classification","note":null},"dataset":{"name":"MUTAG","url":"/dataset/mutag"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"**Graph Classification** is a task that involves classifying a graph-structured data into different classes or categories. Graphs are a powerful way to represent relationships and interactions between different entities, and graph classification can be applied to a wide range of applications, such as social network analysis, bioinformatics, and recommendation systems. In graph classification, the input is a graph, and the goal is to learn a classifier that can accurately predict the class of the graph.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Hierarchical Graph Pooling with Structure Learning](https://github.com/cszhangzhen/HGP-SL) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy","Accuracy (10-fold)","Mean Accuracy","Accuracy (10 fold)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher","Accuracy (10-fold)":"higher","Mean Accuracy":"higher","Accuracy (10 fold)":"higher"}},"counts":{"rows":74,"rows_with_code":65,"rows_with_paper_page":74,"rows_dated":74,"rows_using_additional_data":5},"rows":[{"rank_in_archive_order":1,"model":"Evolution of Graph Classifiers","metrics":{"Accuracy":"100.00%","Accuracy (10-fold)":"100"},"uses_additional_data":false,"paper_date":"2019-10-04","paper":"/paper/evolution-of-graph-classifiers","paper_url":"https://ieeexplore.ieee.org/abstract/document/8923110","paper_title":"Evolution of Graph Classifiers","code":"https://github.com/rohand24/GraphCNN_evolution","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"MEWISPool","metrics":{"Accuracy":"96.66%"},"uses_additional_data":false,"paper_date":"2021-07-03","paper":"/paper/maximum-entropy-weighted-independent-set","paper_url":"https://arxiv.org/abs/2107.01410v1","paper_title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","code":"https://github.com/mewispool/mewispool","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":3,"model":"TFGW ADJ (L=2)","metrics":{"Accuracy":"96.4%"},"uses_additional_data":false,"paper_date":"2022-05-31","paper":"/paper/template-based-graph-neural-network-with","paper_url":"https://arxiv.org/abs/2205.15733v1","paper_title":"Template based Graph Neural Network with Optimal Transport Distances","code":"https://github.com/cedricvincentcuaz/TFGW","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"GIUNet","metrics":{"Accuracy":"95.7%"},"uses_additional_data":false,"paper_date":"2023-08-23","paper":"/paper/graph-isomorphism-unet","paper_url":"https://www.sciencedirect.com/science/article/abs/pii/S0957417423017827#preview-section-abstract","paper_title":"Graph isomorphism UNet","code":"https://github.com/aramiracle/GIUNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"G_Inception","metrics":{"Accuracy":"95.00%"},"uses_additional_data":false,"paper_date":"2018-07-07","paper":"/paper/when-work-matters-transforming-classical","paper_url":"http://arxiv.org/abs/1807.02653v1","paper_title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"GIC","metrics":{"Accuracy":"94.44%"},"uses_additional_data":false,"paper_date":"2018-11-11","paper":"/paper/gaussian-induced-convolution-for-graphs","paper_url":"http://arxiv.org/abs/1811.04393v1","paper_title":"Gaussian-Induced Convolution for Graphs","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":7,"model":"CIN++","metrics":{"Accuracy":"94.4%"},"uses_additional_data":false,"paper_date":"2023-06-06","paper":"/paper/cin-enhancing-topological-message-passing","paper_url":"https://arxiv.org/abs/2306.03561v1","paper_title":"CIN++: Enhancing Topological Message Passing","code":"https://github.com/twitter-research/cwn","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"sGIN","metrics":{"Accuracy":"94.14%"},"uses_additional_data":true,"paper_date":"2019-05-21","paper":"/paper/neighborhood-enlargement-in-graph-neural","paper_url":"https://arxiv.org/abs/1905.08509v4","paper_title":"Mutual Information Maximization in Graph Neural Networks","code":"https://github.com/CODE-SUBMIT/Graph_Neighborhood_1","n_code_links":2,"syntology":null},{"rank_in_archive_order":9,"model":"CAN","metrics":{"Accuracy":"94.1%"},"uses_additional_data":false,"paper_date":"2022-09-16","paper":"/paper/cell-attention-networks","paper_url":"https://arxiv.org/abs/2209.08179v1","paper_title":"Cell Attention Networks","code":"https://github.com/lrnzgiusti/can","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"Deep WL SGN(0,1,2)","metrics":{"Accuracy":"93.68%"},"uses_additional_data":false,"paper_date":"2019-03-21","paper":"/paper/subgraph-networks-with-application-to","paper_url":"https://arxiv.org/abs/1903.09022v3","paper_title":"Subgraph Networks with Application to Structural Feature Space Expansion","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":11,"model":"QS-CNNs (Quantum Walk)","metrics":{"Accuracy":"93.13%","Accuracy (10-fold)":"93.13"},"uses_additional_data":false,"paper_date":"2019-04-01","paper":"/paper/quantum-based-subgraph-convolutional-neural","paper_url":"https://doi.org/10.1016/j.patcog.2018.11.002","paper_title":"Quantum-based subgraph convolutional neural networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":12,"model":"PATCHY-SAN","metrics":{"Accuracy":"92.63%"},"uses_additional_data":false,"paper_date":"2016-05-17","paper":"/paper/learning-convolutional-neural-networks-for","paper_url":"http://arxiv.org/abs/1605.05273v4","paper_title":"Learning Convolutional Neural Networks for Graphs","code":"https://github.com/tvayer/PSCN","n_code_links":2,"syntology":null},{"rank_in_archive_order":13,"model":"DDGK","metrics":{"Accuracy":"91.58%"},"uses_additional_data":false,"paper_date":"2019-04-21","paper":"/paper/ddgk-learning-graph-representations-for-deep","paper_url":"http://arxiv.org/abs/1904.09671v1","paper_title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","code":"https://github.com/google-research/google-research/tree/master/graph_embedding/ddgk","n_code_links":1,"syntology":null},{"rank_in_archive_order":14,"model":"Graph-JEPA","metrics":{"Accuracy":"91.25%"},"uses_additional_data":false,"paper_date":"2023-09-27","paper":"/paper/graph-level-representation-learning-with","paper_url":"https://arxiv.org/abs/2309.16014v3","paper_title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","code":"https://github.com/geriskenderi/graph-jepa","n_code_links":1,"syntology":{"n_ran":10,"n_unverified":1,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"GraphStar","metrics":{"Accuracy":"91.2%"},"uses_additional_data":false,"paper_date":"2019-06-21","paper":"/paper/graph-star-net-for-generalized-multi-task-1","paper_url":"https://arxiv.org/abs/1906.12330v1","paper_title":"Graph Star Net for Generalized Multi-Task Learning","code":"https://github.com/graph-star-team/graph_star","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":5,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"TREE-G","metrics":{"Accuracy":"91.1%"},"uses_additional_data":false,"paper_date":"2022-07-06","paper":"/paper/graph-trees-with-attention","paper_url":"https://arxiv.org/abs/2207.02760v5","paper_title":"TREE-G: Decision Trees Contesting Graph Neural Networks","code":"https://github.com/mayabechlerspeicher/tree-g","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":10,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":17,"model":"SEG-BERT","metrics":{"Accuracy":"90.85%"},"uses_additional_data":false,"paper_date":"2020-02-09","paper":"/paper/segmented-graph-bert-for-graph-instance","paper_url":"https://arxiv.org/abs/2002.03283v1","paper_title":"Segmented Graph-Bert for Graph Instance Modeling","code":"https://github.com/jwzhanggy/SEG-BERT","n_code_links":1,"syntology":null},{"rank_in_archive_order":18,"model":"GFN","metrics":{"Accuracy":"90.84%"},"uses_additional_data":false,"paper_date":"2019-05-11","paper":"/paper/dissecting-graph-neural-networks-on-graph","paper_url":"https://arxiv.org/abs/1905.04579v3","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","code":"https://github.com/chentingpc/gfn","n_code_links":1,"syntology":null},{"rank_in_archive_order":19,"model":"PPGN","metrics":{"Accuracy":"90.55%"},"uses_additional_data":false,"paper_date":"2019-05-27","paper":"/paper/provably-powerful-graph-networks","paper_url":"https://arxiv.org/abs/1905.11136v4","paper_title":"Provably Powerful Graph Networks","code":"https://github.com/hadarser/ProvablyPowerfulGraphNetworks_torch","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":8,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":20,"model":"GAT-GC (f-Scaled)","metrics":{"Accuracy":"90.44%"},"uses_additional_data":true,"paper_date":"2019-07-04","paper":"/paper/improving-attention-mechanism-in-graph-neural","paper_url":"https://arxiv.org/abs/1907.02204v4","paper_title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","code":"https://github.com/zetayue/CPA","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"DropGIN","metrics":{"Accuracy":"90.4%"},"uses_additional_data":false,"paper_date":"2021-11-11","paper":"/paper/dropgnn-random-dropouts-increase-the","paper_url":"https://arxiv.org/abs/2111.06283v1","paper_title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","code":"https://github.com/karolismart/dropgnn","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":22,"model":"LDP","metrics":{"Accuracy":"90.1%"},"uses_additional_data":false,"paper_date":"2018-11-08","paper":"/paper/a-simple-yet-effective-baseline-for-non","paper_url":"https://arxiv.org/abs/1811.03508v3","paper_title":"A simple yet effective baseline for non-attributed graph classification","code":"https://github.com/benedekrozemberczki/karateclub","n_code_links":2,"syntology":null},{"rank_in_archive_order":23,"model":"R-GCN + PANDA","metrics":{"Accuracy":"90.05%"},"uses_additional_data":false,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":24,"model":"hGANet","metrics":{"Accuracy":"90.00%"},"uses_additional_data":false,"paper_date":"2019-07-05","paper":"/paper/graph-representation-learning-via-hard-and","paper_url":"https://arxiv.org/abs/1907.04652v1","paper_title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"U2GNN","metrics":{"Accuracy":"89.97%"},"uses_additional_data":false,"paper_date":"2019-09-26","paper":"/paper/unsupervised-universal-self-attention-network","paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","code":"https://github.com/daiquocnguyen/Graph-Transformer","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":26,"model":"FactorGCN","metrics":{"Accuracy":"89.9%","Accuracy (10-fold)":"89.9%"},"uses_additional_data":false,"paper_date":"2020-10-12","paper":"/paper/factorizable-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/2010.05421v1","paper_title":"Factorizable Graph Convolutional Networks","code":"https://github.com/ihollywhy/FactorGCN.PyTorch","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":27,"model":"GFN-light","metrics":{"Accuracy":"89.89%"},"uses_additional_data":false,"paper_date":"2019-05-11","paper":"/paper/dissecting-graph-neural-networks-on-graph","paper_url":"https://arxiv.org/abs/1905.04579v3","paper_title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","code":"https://github.com/chentingpc/gfn","n_code_links":1,"syntology":null},{"rank_in_archive_order":28,"model":"GIN-0","metrics":{"Accuracy":"89.4%"},"uses_additional_data":true,"paper_date":"2018-10-01","paper":"/paper/how-powerful-are-graph-neural-networks","paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin","n_code_links":19,"syntology":{"n_ran":3,"n_unverified":7,"n_samples":10,"n_pointer_only_licence":5}},{"rank_in_archive_order":29,"model":"Multigraph ChebNet","metrics":{"Accuracy":"89.1%"},"uses_additional_data":false,"paper_date":"2018-11-23","paper":"/paper/spectral-multigraph-networks-for-discovering","paper_url":"http://arxiv.org/abs/1811.09595v1","paper_title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","code":"https://github.com/bknyaz/graph_nn","n_code_links":1,"syntology":null},{"rank_in_archive_order":30,"model":"InfoGraph","metrics":{"Accuracy":"89.01%"},"uses_additional_data":false,"paper_date":"2019-07-31","paper":"/paper/infograph-unsupervised-and-semi-supervised","paper_url":"https://arxiv.org/abs/1908.01000v3","paper_title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/infograph","n_code_links":5,"syntology":null},{"rank_in_archive_order":31,"model":"PSCN","metrics":{"Accuracy":"88.95%"},"uses_additional_data":false,"paper_date":"2016-05-17","paper":"/paper/learning-convolutional-neural-networks-for","paper_url":"http://arxiv.org/abs/1605.05273v4","paper_title":"Learning Convolutional Neural Networks for Graphs","code":"https://github.com/tvayer/PSCN","n_code_links":2,"syntology":null},{"rank_in_archive_order":32,"model":"BC + Capsules","metrics":{"Accuracy":"88.9%"},"uses_additional_data":false,"paper_date":"2019-02-22","paper":"/paper/capsule-neural-networks-for-graph","paper_url":"http://arxiv.org/abs/1902.08399v1","paper_title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":33,"model":"edGNN (max)","metrics":{"Accuracy":"88.8%"},"uses_additional_data":false,"paper_date":"2019-04-18","paper":"/paper/edgnn-a-simple-and-powerful-gnn-for-directed","paper_url":"https://arxiv.org/abs/1904.08745v2","paper_title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","code":"https://github.com/guillaumejaume/edGNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":34,"model":"GIN + PANDA","metrics":{"Accuracy":"88.75%"},"uses_additional_data":false,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":35,"model":"NERO","metrics":{"Accuracy":"88.68%"},"uses_additional_data":false,"paper_date":"2021-06-09","paper":"/paper/relation-order-histograms-as-a-network","paper_url":"https://link.springer.com/chapter/10.1007/978-3-030-77964-1_18","paper_title":"Relation order histograms as a network embedding tool","code":"https://github.com/Prpht/NERO","n_code_links":1,"syntology":null},{"rank_in_archive_order":36,"model":"Path up to length h","metrics":{"Accuracy":"88.47%"},"uses_additional_data":false,"paper_date":"2019-03-01","paper":"/paper/graph-kernels-based-on-linear-patterns","paper_url":"https://hal-normandie-univ.archives-ouvertes.fr/hal-02053946/","paper_title":"Graph Kernels Based on Linear Patterns: Theoretical and Experimental Comparisons","code":"https://github.com/jajupmochi/graphkit-learn","n_code_links":2,"syntology":null},{"rank_in_archive_order":37,"model":"U2GNN (Unsupervised)","metrics":{"Accuracy":"88.47%"},"uses_additional_data":false,"paper_date":"2019-09-26","paper":"/paper/unsupervised-universal-self-attention-network","paper_url":"https://arxiv.org/abs/1909.11855v9","paper_title":"Universal Graph Transformer Self-Attention Networks","code":"https://github.com/daiquocnguyen/Graph-Transformer","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":38,"model":"FGW wl h=4 sp","metrics":{"Accuracy":"88.42%"},"uses_additional_data":false,"paper_date":"2018-05-23","paper":"/paper/optimal-transport-for-structured-data-with","paper_url":"https://arxiv.org/abs/1805.09114v3","paper_title":"Optimal Transport for structured data with application on graphs","code":"https://github.com/rflamary/POT","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":39,"model":"SF + RFC","metrics":{"Accuracy":"88.4%"},"uses_additional_data":false,"paper_date":"2018-10-22","paper":"/paper/a-simple-baseline-algorithm-for-graph","paper_url":"http://arxiv.org/abs/1810.09155v2","paper_title":"A Simple Baseline Algorithm for Graph Classification","code":"https://github.com/benedekrozemberczki/karateclub","n_code_links":3,"syntology":null},{"rank_in_archive_order":40,"model":"ECC (5 scores)","metrics":{"Accuracy":"88.33%"},"uses_additional_data":false,"paper_date":"2017-04-10","paper":"/paper/dynamic-edge-conditioned-filters-in","paper_url":"http://arxiv.org/abs/1704.02901v3","paper_title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","code":"https://github.com/rusty1s/pytorch_cluster","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":41,"model":"WEGL","metrics":{"Accuracy":"88.3%"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/wasserstein-embedding-for-graph-learning","paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","code":"https://github.com/navid-naderi/WEGL","n_code_links":1,"syntology":null},{"rank_in_archive_order":42,"model":"R-GIN + PANDA","metrics":{"Accuracy":"88.2%"},"uses_additional_data":false,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":43,"model":"AWE","metrics":{"Accuracy":"87.87%"},"uses_additional_data":false,"paper_date":"2018-05-30","paper":"/paper/anonymous-walk-embeddings","paper_url":"http://arxiv.org/abs/1805.11921v3","paper_title":"Anonymous Walk Embeddings","code":"https://github.com/nd7141/AWE","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":44,"model":"Graphlet Kernel","metrics":{"Accuracy":"87.7%"},"uses_additional_data":false,"paper_date":"2018-10-04","paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","code":"https://github.com/chrsmrrs/k-gnn","n_code_links":1,"syntology":null},{"rank_in_archive_order":45,"model":"CT-Layer","metrics":{"Accuracy":"87.58%"},"uses_additional_data":false,"paper_date":"2022-06-15","paper":"/paper/diffwire-inductive-graph-rewiring-via-the","paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","code":"https://github.com/ellisalicante/GraphRewiring-Tutorial","n_code_links":2,"syntology":null},{"rank_in_archive_order":46,"model":"WKPI-kcenters","metrics":{"Accuracy":"87.5%"},"uses_additional_data":false,"paper_date":"2019-04-27","paper":"/paper/learning-metrics-for-persistence-based-2","paper_url":"https://arxiv.org/abs/1904.12189v2","paper_title":"Learning metrics for persistence-based summaries and applications for graph classification","code":"https://github.com/topology474/WKPI","n_code_links":1,"syntology":null},{"rank_in_archive_order":47,"model":"DGK","metrics":{"Accuracy":"87.44%"},"uses_additional_data":false,"paper_date":"2015-08-10","paper":"/paper/deep-graph-kernels","paper_url":"https://www.semanticscholar.org/paper/Deep-Graph-Kernels-Yanardag-Vishwanathan/8ccd0adb1a00358ede79f1d9bdcce472dc1cb8d4","paper_title":"Deep Graph Kernels","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":48,"model":"WWL","metrics":{"Accuracy":"87.27%"},"uses_additional_data":false,"paper_date":"2019-06-04","paper":"/paper/wasserstein-weisfeiler-lehman-graph-kernels","paper_url":"https://arxiv.org/abs/1906.01277v2","paper_title":"Wasserstein Weisfeiler-Lehman Graph Kernels","code":"https://github.com/BorgwardtLab/WWL","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":11,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":49,"model":"DAGCN","metrics":{"Accuracy":"87.22%"},"uses_additional_data":false,"paper_date":"2019-04-04","paper":"/paper/dagcn-dual-attention-graph-convolutional","paper_url":"http://arxiv.org/abs/1904.02278v1","paper_title":"DAGCN: Dual Attention Graph Convolutional Networks","code":"https://github.com/dawenzi123/DAGCN","n_code_links":1,"syntology":null},{"rank_in_archive_order":50,"model":"GDL-g (SP)","metrics":{"Accuracy":"87.09%"},"uses_additional_data":false,"paper_date":"2021-02-12","paper":"/paper/online-graph-dictionary-learning","paper_url":"https://arxiv.org/abs/2102.06555v2","paper_title":"Online Graph Dictionary Learning","code":"https://github.com/cedricvincentcuaz/GDL","n_code_links":1,"syntology":null},{"rank_in_archive_order":51,"model":"edGNN (avg)","metrics":{"Accuracy":"86.9%"},"uses_additional_data":false,"paper_date":"2019-04-18","paper":"/paper/edgnn-a-simple-and-powerful-gnn-for-directed","paper_url":"https://arxiv.org/abs/1904.08745v2","paper_title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","code":"https://github.com/guillaumejaume/edGNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":52,"model":"GAP-Layer (Rcut)","metrics":{"Accuracy":"86.9%"},"uses_additional_data":false,"paper_date":"2022-06-15","paper":"/paper/diffwire-inductive-graph-rewiring-via-the","paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","code":"https://github.com/ellisalicante/GraphRewiring-Tutorial","n_code_links":2,"syntology":null},{"rank_in_archive_order":53,"model":"GAP-Layer (Ncut)","metrics":{"Accuracy":"86.9%"},"uses_additional_data":false,"paper_date":"2022-06-15","paper":"/paper/diffwire-inductive-graph-rewiring-via-the","paper_url":"https://arxiv.org/abs/2206.07369v3","paper_title":"DiffWire: Inductive Graph Rewiring via the Lovász Bound","code":"https://github.com/ellisalicante/GraphRewiring-Tutorial","n_code_links":2,"syntology":null},{"rank_in_archive_order":54,"model":"CapsGNN","metrics":{"Accuracy":"86.67%"},"uses_additional_data":false,"paper_date":"2019-05-01","paper":"/paper/capsule-graph-neural-network","paper_url":"https://openreview.net/forum?id=Byl8BnRcYm","paper_title":"Capsule Graph Neural Network","code":"https://github.com/benedekrozemberczki/CapsGNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":55,"model":"FGW wl h=2 sp","metrics":{"Accuracy":"86.42%"},"uses_additional_data":false,"paper_date":"2018-05-23","paper":"/paper/optimal-transport-for-structured-data-with","paper_url":"https://arxiv.org/abs/1805.09114v3","paper_title":"Optimal Transport for structured data with application on graphs","code":"https://github.com/rflamary/POT","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":56,"model":"ApproxRepSet","metrics":{"Accuracy":"86.33%"},"uses_additional_data":false,"paper_date":"2019-04-03","paper":"/paper/rep-the-set-neural-networks-for-learning-set","paper_url":"https://arxiv.org/abs/1904.01962v2","paper_title":"Rep the Set: Neural Networks for Learning Set Representations","code":"https://github.com/giannisnik/repset","n_code_links":1,"syntology":null},{"rank_in_archive_order":57,"model":"VRGC","metrics":{"Accuracy":"86.3%"},"uses_additional_data":false,"paper_date":"2019-02-07","paper":"/paper/graph-classification-with-recurrent","paper_url":"https://arxiv.org/abs/1902.02721v4","paper_title":"Variational Recurrent Neural Networks for Graph Classification","code":"https://github.com/edouardpineau/Variational-Recurrent-Neural-Networks-for-Graph-Classification","n_code_links":1,"syntology":null},{"rank_in_archive_order":58,"model":"k-GNN","metrics":{"Accuracy":"86.1%"},"uses_additional_data":false,"paper_date":"2018-10-04","paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","paper_url":"https://arxiv.org/abs/1810.02244v5","paper_title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","code":"https://github.com/chrsmrrs/k-gnn","n_code_links":1,"syntology":null},{"rank_in_archive_order":59,"model":"DGCNN","metrics":{"Accuracy":"85.83%"},"uses_additional_data":false,"paper_date":"2018-04-29","paper":"/paper/an-end-to-end-deep-learning-architecture-for","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","code":"https://github.com/muhanzhang/DGCNN","n_code_links":2,"syntology":null},{"rank_in_archive_order":60,"model":"GCN + PANDA","metrics":{"Accuracy":"85.75%"},"uses_additional_data":true,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":61,"model":"GIN-0","metrics":{"Accuracy":"85.7%"},"uses_additional_data":true,"paper_date":"2019-03-06","paper":"/paper/fast-graph-representation-learning-with","paper_url":"http://arxiv.org/abs/1903.02428v3","paper_title":"Fast Graph Representation Learning with PyTorch Geometric","code":"https://github.com/rusty1s/pytorch_geometric","n_code_links":6,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":62,"model":"NDP","metrics":{"Accuracy":"84.7%"},"uses_additional_data":false,"paper_date":"2019-10-24","paper":"/paper/hierarchical-representation-learning-in-graph","paper_url":"https://arxiv.org/abs/1910.11436v3","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","code":"https://github.com/danielegrattarola/decimation-pooling","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":63,"model":"Propagation kernels (pk)","metrics":{"Accuracy":"84.5%"},"uses_additional_data":false,"paper_date":"2019-02-01","paper":"/paper/propagation-kernels-efficient-graph-kernels","paper_url":"https://doi.org/10.1007/s10994-015-5517-9","paper_title":"Propagation kernels: efficient graph kernels from propagated information","code":"https://github.com/marionmari/propagation_kernels","n_code_links":1,"syntology":null},{"rank_in_archive_order":64,"model":"WL-OA","metrics":{"Accuracy":"84.5%"},"uses_additional_data":false,"paper_date":"2016-06-03","paper":"/paper/on-valid-optimal-assignment-kernels-and","paper_url":"http://arxiv.org/abs/1606.01141v3","paper_title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":65,"model":"SPI-GCN","metrics":{"Accuracy":"84.40%"},"uses_additional_data":false,"paper_date":"2019-04-08","paper":"/paper/spi-gcn-a-simple-permutation-invariant-graph","paper_url":"https://hal.archives-ouvertes.fr/hal-02093451/","paper_title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":66,"model":"GMT","metrics":{"Accuracy":"83.44%"},"uses_additional_data":false,"paper_date":"2021-02-23","paper":"/paper/accurate-learning-of-graph-representations-1","paper_url":"https://arxiv.org/abs/2102.11533v4","paper_title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","code":"https://github.com/JinheonBaek/GMT","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":5}},{"rank_in_archive_order":67,"model":"Function Space Pooling","metrics":{"Accuracy":"83.3%"},"uses_additional_data":false,"paper_date":"2019-05-15","paper":"/paper/function-space-pooling-for-graph","paper_url":"https://arxiv.org/abs/1905.06259v2","paper_title":"Function Space Pooling For Graph Convolutional Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":68,"model":"Function Space Pooling","metrics":{"Accuracy":"83.3%"},"uses_additional_data":false,"paper_date":"2019-07-22","paper":"/paper/isonn-isomorphic-neural-network-for-graph","paper_url":"https://arxiv.org/abs/1907.09495v2","paper_title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","code":"https://github.com/linmengsysu/IsoNN","n_code_links":2,"syntology":null},{"rank_in_archive_order":69,"model":"FGW raw sp","metrics":{"Accuracy":"83.26%"},"uses_additional_data":false,"paper_date":"2018-05-23","paper":"/paper/optimal-transport-for-structured-data-with","paper_url":"https://arxiv.org/abs/1805.09114v3","paper_title":"Optimal Transport for structured data with application on graphs","code":"https://github.com/rflamary/POT","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":70,"model":"graph2vec","metrics":{"Accuracy":"83.15% ± 9.25%"},"uses_additional_data":false,"paper_date":"2017-07-17","paper":"/paper/graph2vec-learning-distributed","paper_url":"http://arxiv.org/abs/1707.05005v1","paper_title":"graph2vec: Learning Distributed Representations of Graphs","code":"https://github.com/benedekrozemberczki/karateclub","n_code_links":6,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":71,"model":"EigenGCN-3","metrics":{"Accuracy":"79.5%"},"uses_additional_data":false,"paper_date":"2019-04-30","paper":"/paper/graph-convolutional-networks-with","paper_url":"https://arxiv.org/abs/1904.13107v2","paper_title":"Graph Convolutional Networks with EigenPooling","code":"https://github.com/alge24/eigenpooling","n_code_links":1,"syntology":null},{"rank_in_archive_order":72,"model":"GDL-g (ADJ)","metrics":{"Accuracy":"58.45%"},"uses_additional_data":false,"paper_date":"2021-02-12","paper":"/paper/online-graph-dictionary-learning","paper_url":"https://arxiv.org/abs/2102.06555v2","paper_title":"Online Graph Dictionary Learning","code":"https://github.com/cedricvincentcuaz/GDL","n_code_links":1,"syntology":null},{"rank_in_archive_order":73,"model":"P-WL-C","metrics":{"Mean Accuracy":"90.51"},"uses_additional_data":false,"paper_date":"2019-06-09","paper":"/paper/a-persistent-weisfeilerlehman-procedure-for","paper_url":"http://proceedings.mlr.press/v97/rieck19a.html","paper_title":"A Persistent Weisfeiler–Lehman Procedure for Graph Classification","code":"https://github.com/BorgwardtLab/P-WL","n_code_links":1,"syntology":null},{"rank_in_archive_order":74,"model":"G-Tuning","metrics":{"Accuracy (10 fold)":"86.14"},"uses_additional_data":false,"paper_date":"2023-12-21","paper":"/paper/fine-tuning-graph-neural-networks-by","paper_url":"https://arxiv.org/abs/2312.13583v1","paper_title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","code":"https://github.com/zjunet/G-Tuning","n_code_links":1,"syntology":{"n_ran":13,"n_unverified":0,"n_samples":13,"n_pointer_only_licence":13}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":27,"rows_with_any_sample_ran":19,"distinct_papers_with_graph_line":21,"distinct_papers_with_any_sample_ran":13,"samples_over_distinct_papers":{"n_ran":54,"n_unverified":59,"n_samples":113,"n_pointer_only_licence":31,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":85,"n_unverified":65,"n_samples":150,"n_pointer_only_licence":37,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}