{"url":"/sota/graph-classification-on-re-m5k","task":{"name":"Graph Classification","url":"/task/graph-classification","note":null},"dataset":{"name":"RE-M5K","url":null},"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"],"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"}},"counts":{"rows":8,"rows_with_code":6,"rows_with_paper_page":8,"rows_dated":8,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GIN-0","metrics":{"Accuracy":"57.5%"},"uses_additional_data":false,"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":2,"model":"GAT-GC (f-Scaled)","metrics":{"Accuracy":"57.22%"},"uses_additional_data":false,"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":3,"model":"WEGL","metrics":{"Accuracy":"55.1%"},"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":4,"model":"CapsGNN","metrics":{"Accuracy":"52.88%"},"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":5,"model":"2D CNN","metrics":{"Accuracy":"52.11%"},"uses_additional_data":false,"paper_date":"2017-07-29","paper":"/paper/graph-classification-with-2d-convolutional","paper_url":"https://arxiv.org/abs/1708.02218v4","paper_title":"Graph Classification with 2D Convolutional Neural Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"GFN-light","metrics":{"Accuracy":"49.75%"},"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":7,"model":"GFN","metrics":{"Accuracy":"49.43%"},"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":8,"model":"DGK","metrics":{"Accuracy":"41.27%"},"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}],"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":2,"rows_with_any_sample_ran":1,"distinct_papers_with_graph_line":2,"distinct_papers_with_any_sample_ran":1,"samples_over_distinct_papers":{"n_ran":3,"n_unverified":8,"n_samples":11,"n_pointer_only_licence":5,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":3,"n_unverified":8,"n_samples":11,"n_pointer_only_licence":5,"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"}}}