{"url":"/sota/node-classification-on-reddit","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"Reddit","url":"/dataset/reddit"},"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","Micro-F1"],"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","Micro-F1":"higher"}},"counts":{"rows":16,"rows_with_code":14,"rows_with_paper_page":16,"rows_dated":16,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"BNS-GCN","metrics":{"Accuracy":"97.17%"},"uses_additional_data":false,"paper_date":"2022-03-21","paper":"/paper/bns-gcn-efficient-full-graph-training-of","paper_url":"https://arxiv.org/abs/2203.10983v2","paper_title":"BNS-GCN: Efficient Full-Graph Training of Graph Convolutional Networks with Partition-Parallelism and Random Boundary Node Sampling","code":"https://github.com/gatech-eic/bns-gcn","n_code_links":2,"syntology":null},{"rank_in_archive_order":2,"model":"CoFree-GNN","metrics":{"Accuracy":"97.14±0.02%"},"uses_additional_data":false,"paper_date":"2023-08-06","paper":"/paper/communication-free-distributed-gnn-training","paper_url":"https://arxiv.org/abs/2308.03209v1","paper_title":"Communication-Free Distributed GNN Training with Vertex Cut","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"shaDow-GAT","metrics":{"Accuracy":"97.13%"},"uses_additional_data":false,"paper_date":"2022-01-19","paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","paper_url":"https://arxiv.org/abs/2201.07858v1","paper_title":"Decoupling the Depth and Scope of Graph Neural Networks","code":"https://github.com/facebookresearch/shaDow_GNN","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":4,"model":"shaDow-SAGE","metrics":{"Accuracy":"97.03%"},"uses_additional_data":false,"paper_date":"2022-01-19","paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","paper_url":"https://arxiv.org/abs/2201.07858v1","paper_title":"Decoupling the Depth and Scope of Graph Neural Networks","code":"https://github.com/facebookresearch/shaDow_GNN","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":5,"model":"JKNet+DropEdge","metrics":{"Accuracy":"97.02%"},"uses_additional_data":false,"paper_date":"2019-07-25","paper":"/paper/the-truly-deep-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/1907.10903v4","paper_title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","code":"https://github.com/GraphSAINT/GraphSAINT","n_code_links":7,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"GraphSAINT","metrics":{"Accuracy":"97.0%"},"uses_additional_data":false,"paper_date":"2019-07-10","paper":"/paper/graphsaint-graph-sampling-based-inductive","paper_url":"https://arxiv.org/abs/1907.04931v4","paper_title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/graphsaint","n_code_links":8,"syntology":null},{"rank_in_archive_order":7,"model":"EnGCN","metrics":{"Accuracy":"96.65%"},"uses_additional_data":false,"paper_date":"2022-10-14","paper":"/paper/a-comprehensive-study-on-large-scale-graph","paper_url":"https://arxiv.org/abs/2210.07494v2","paper_title":"A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking","code":"https://github.com/VITA-Group/Large_Scale_GCN_Benchmarking","n_code_links":2,"syntology":{"n_ran":4,"n_unverified":2,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"SIGN","metrics":{"Accuracy":"96.60%"},"uses_additional_data":false,"paper_date":"2020-04-23","paper":"/paper/sign-scalable-inception-graph-neural-networks","paper_url":"https://arxiv.org/abs/2004.11198v3","paper_title":"SIGN: Scalable Inception Graph Neural Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sign","n_code_links":5,"syntology":{"n_ran":2,"n_unverified":5,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"ASGCN","metrics":{"Accuracy":"96.27%"},"uses_additional_data":false,"paper_date":"2018-09-14","paper":"/paper/adaptive-sampling-towards-fast-graph","paper_url":"http://arxiv.org/abs/1809.05343v3","paper_title":"Adaptive Sampling Towards Fast Graph Representation Learning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/_deprecated/adaptive_sampling","n_code_links":2,"syntology":null},{"rank_in_archive_order":10,"model":"PCAPass + XGBoost","metrics":{"Accuracy":"96.26 ± 0.02%"},"uses_additional_data":false,"paper_date":"2022-02-01","paper":"/paper/dimensionality-reduction-meets-message","paper_url":"https://arxiv.org/abs/2202.00408v2","paper_title":"Dimensionality Reduction Meets Message Passing for Graph Node Embeddings","code":"https://github.com/ksadowski13/PCAPass","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"SSGC","metrics":{"Accuracy":"95.3"},"uses_additional_data":false,"paper_date":"2021-01-01","paper":"/paper/simple-spectral-graph-convolution","paper_url":"https://openreview.net/forum?id=CYO5T-YjWZV","paper_title":"Simple Spectral Graph Convolution","code":"https://github.com/allenhaozhu/SSGC","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"VQ-GNN (SAGE-Mean)","metrics":{"Accuracy":"94.5 ± .0024"},"uses_additional_data":false,"paper_date":"2021-10-27","paper":"/paper/vq-gnn-a-universal-framework-to-scale-up","paper_url":"https://arxiv.org/abs/2110.14363v1","paper_title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","code":"https://github.com/devnkong/VQ-GNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"GraphSAGE","metrics":{"Accuracy":"94.32%"},"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":14,"model":"FastGCN","metrics":{"Accuracy":"93.70%"},"uses_additional_data":false,"paper_date":"2018-01-30","paper":"/paper/fastgcn-fast-learning-with-graph","paper_url":"http://arxiv.org/abs/1801.10247v1","paper_title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","code":"https://github.com/matenure/FastGCN","n_code_links":4,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":15,"model":"TGCL+ResNet","metrics":{"Accuracy":"81.06±1.18%"},"uses_additional_data":false,"paper_date":"2021-10-26","paper":"/paper/tackling-oversmoothing-of-gnns-with-1","paper_url":"https://arxiv.org/abs/2110.13798v3","paper_title":"Deeper-GXX: Deepening Arbitrary GNNs","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":16,"model":"GRACE","metrics":{"Micro-F1":"94.2 ± 0.0"},"uses_additional_data":false,"paper_date":"2020-06-07","paper":"/paper/deep-graph-contrastive-representation","paper_url":"https://arxiv.org/abs/2006.04131v2","paper_title":"Deep Graph Contrastive Representation Learning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grace","n_code_links":3,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}}],"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":8,"rows_with_any_sample_ran":4,"distinct_papers_with_graph_line":7,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":10,"n_unverified":19,"n_samples":29,"n_pointer_only_licence":11,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":10,"n_unverified":21,"n_samples":31,"n_pointer_only_licence":13,"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"}}}