{"url":"/sota/node-classification-on-citeseer-full","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"Citeseer Full-supervised","url":"/dataset/citeseer"},"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":7,"rows_with_code":6,"rows_with_paper_page":7,"rows_dated":7,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"IncepGCN+DropEdge","metrics":{"Accuracy":"80.50%"},"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":2,"model":"ASGCN","metrics":{"Accuracy":"79.66%"},"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":3,"model":"FastGCN","metrics":{"Accuracy":"77.60%"},"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":4,"model":"GCNII*","metrics":{"Accuracy":"77.13%"},"uses_additional_data":false,"paper_date":"2020-07-04","paper":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_url":"https://arxiv.org/abs/2007.02133v1","paper_title":"Simple and Deep Graph Convolutional Networks","code":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv","n_code_links":4,"syntology":{"n_ran":5,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":4}},{"rank_in_archive_order":5,"model":"FDGATII","metrics":{"Accuracy":"75.6434%"},"uses_additional_data":false,"paper_date":"2021-10-21","paper":"/paper/fdgatii-fast-dynamic-graph-attention-with","paper_url":"https://arxiv.org/abs/2110.11464v2","paper_title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","code":"https://github.com/gayanku/FDGATII","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"Graph ESN","metrics":{"Accuracy":"74.5±2.1"},"uses_additional_data":false,"paper_date":"2022-10-27","paper":"/paper/beyond-homophily-with-graph-echo-state-1","paper_url":"https://arxiv.org/abs/2210.15731v1","paper_title":"Beyond Homophily with Graph Echo State Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":7,"model":"GraphSAGE","metrics":{"Accuracy":"71.40%"},"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}}],"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":4,"rows_with_any_sample_ran":2,"distinct_papers_with_graph_line":4,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":8,"n_unverified":12,"n_samples":20,"n_pointer_only_licence":12,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":8,"n_unverified":12,"n_samples":20,"n_pointer_only_licence":12,"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"}}}