{"url":"/sota/node-classification-on-pubmed-01","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"PubMed (0.1%)","url":"/dataset/pubmed"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"**Node Classification** is a machine learning task in graph-based data analysis, where the goal is to assign labels to nodes in a graph based on the properties of nodes and the relationships between them.\r\n\r\n**Node Classification** models aim to predict non-existing node properties (known as the target property) based on other node properties. Typical models used for node classification consists of a large family of graph neural networks. Model performance can be measured using benchmark datasets like [Cora](/dataset/cora), [Citeseer](/dataset/citeseer), and [Pubmed](/dataset/pubmed), among others, typically using Accuracy and F1.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Fast Graph Representation Learning With PyTorch Geometric](https://arxiv.org/pdf/1903.02428v3.pdf) )</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":14,"rows_with_code":14,"rows_with_paper_page":14,"rows_dated":14,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"Truncated Krylov","metrics":{"Accuracy":"77.21%"},"uses_additional_data":false,"paper_date":"2019-06-05","paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","paper_url":"https://arxiv.org/abs/1906.02174v3","paper_title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","code":"https://github.com/PwnerHarry/Stronger_GCN","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":8,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"VCHN","metrics":{"Accuracy":"76.8%"},"uses_additional_data":false,"paper_date":"2022-03-17","paper":"/paper/view-consistent-heterogeneous-network-on","paper_url":"https://doi.org/10.1109/TCYB.2022.3157771","paper_title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","code":"https://github.com/kunzhan/VCHN","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"Snowball (linear + tanh)","metrics":{"Accuracy":"75.30%"},"uses_additional_data":false,"paper_date":"2019-06-05","paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","paper_url":"https://arxiv.org/abs/1906.02174v3","paper_title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","code":"https://github.com/PwnerHarry/Stronger_GCN","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":8,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"Snowball (tanh)","metrics":{"Accuracy":"74.40%"},"uses_additional_data":false,"paper_date":"2019-06-05","paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","paper_url":"https://arxiv.org/abs/1906.02174v3","paper_title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","code":"https://github.com/PwnerHarry/Stronger_GCN","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":8,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"Snowball (linear)","metrics":{"Accuracy":"73.83%"},"uses_additional_data":false,"paper_date":"2019-06-05","paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","paper_url":"https://arxiv.org/abs/1906.02174v3","paper_title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","code":"https://github.com/PwnerHarry/Stronger_GCN","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":8,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"LanczosNet","metrics":{"Accuracy":"73.4 ± 5.1"},"uses_additional_data":false,"paper_date":"2019-01-06","paper":"/paper/lanczosnet-multi-scale-deep-graph","paper_url":"https://arxiv.org/abs/1901.01484v2","paper_title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","code":"https://github.com/lrjconan/LanczosNetwork","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"DCNN","metrics":{"Accuracy":"73.1%"},"uses_additional_data":false,"paper_date":"2015-11-06","paper":"/paper/diffusion-convolutional-neural-networks","paper_url":"http://arxiv.org/abs/1511.02136v6","paper_title":"Diffusion-Convolutional Neural Networks","code":"https://github.com/jcatw/dcnn","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"MT-GCN","metrics":{"Accuracy":"73.1%"},"uses_additional_data":false,"paper_date":"2020-09-02","paper":"/paper/mutual-teaching-for-graph-convolutional","paper_url":"https://arxiv.org/abs/2009.00952v1","paper_title":"Mutual Teaching for Graph Convolutional Networks","code":"https://github.com/kunzhan/MTGCN","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"AdaLanczosNet","metrics":{"Accuracy":"72.8 ± 4.6"},"uses_additional_data":false,"paper_date":"2019-01-06","paper":"/paper/lanczosnet-multi-scale-deep-graph","paper_url":"https://arxiv.org/abs/1901.01484v2","paper_title":"LanczosNet: Multi-Scale Deep Graph Convolutional Networks","code":"https://github.com/lrjconan/LanczosNetwork","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"GGNN","metrics":{"Accuracy":"70.4%"},"uses_additional_data":false,"paper_date":"2015-11-17","paper":"/paper/gated-graph-sequence-neural-networks","paper_url":"http://arxiv.org/abs/1511.05493v4","paper_title":"Gated Graph Sequence Neural Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ggnn","n_code_links":13,"syntology":{"n_ran":0,"n_unverified":12,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":11,"model":"GCN-FP","metrics":{"Accuracy":"70.3%"},"uses_additional_data":false,"paper_date":"2015-09-30","paper":"/paper/convolutional-networks-on-graphs-for-learning","paper_url":"http://arxiv.org/abs/1509.09292v2","paper_title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","code":"https://github.com/HIPS/neural-fingerprint","n_code_links":8,"syntology":{"n_ran":0,"n_unverified":26,"n_samples":26,"n_pointer_only_licence":1}},{"rank_in_archive_order":12,"model":"GraphSAGE","metrics":{"Accuracy":"65.4%"},"uses_additional_data":false,"paper_date":"2017-06-07","paper":"/paper/inductive-representation-learning-on-large","paper_url":"http://arxiv.org/abs/1706.02216v4","paper_title":"Inductive Representation Learning on Large Graphs","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/models/basic_gnn.py","n_code_links":20,"syntology":{"n_ran":3,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":5}},{"rank_in_archive_order":13,"model":"GAT","metrics":{"Accuracy":"59.6%"},"uses_additional_data":false,"paper_date":"2017-10-30","paper":"/paper/graph-attention-networks","paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":93,"syntology":{"n_ran":50,"n_unverified":56,"n_samples":106,"n_pointer_only_licence":43}},{"rank_in_archive_order":14,"model":"ChebyNet","metrics":{"Accuracy":"55.2%"},"uses_additional_data":false,"paper_date":"2016-06-30","paper":"/paper/convolutional-neural-networks-on-graphs-with","paper_url":"http://arxiv.org/abs/1606.09375v3","paper_title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","code":"https://github.com/mdeff/cnn_graph","n_code_links":5,"syntology":{"n_ran":2,"n_unverified":4,"n_samples":6,"n_pointer_only_licence":2}}],"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":10,"rows_with_any_sample_ran":7,"distinct_papers_with_graph_line":7,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":56,"n_unverified":111,"n_samples":167,"n_pointer_only_licence":51,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":59,"n_unverified":135,"n_samples":194,"n_pointer_only_licence":51,"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"}}}