{"url":"/sota/node-classification-on-brazil-air-traffic","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"Brazil Air-Traffic","url":"/dataset/brazil-air-traffic"},"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":7,"rows_with_paper_page":7,"rows_dated":7,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"UGT","metrics":{"Accuracy":"0.8 ± 0.05"},"uses_additional_data":false,"paper_date":"2023-08-18","paper":"/paper/transitivity-preserving-graph-representation","paper_url":"https://arxiv.org/abs/2308.09517v1","paper_title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","code":"https://github.com/nslab-cuk/unified-graph-transformer","n_code_links":3,"syntology":{"n_ran":5,"n_unverified":21,"n_samples":26,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"DEMO-Net(weight)","metrics":{"Accuracy":"0.543 ± 0.034"},"uses_additional_data":false,"paper_date":"2019-06-05","paper":"/paper/demo-net-degree-specific-graph-neural","paper_url":"https://arxiv.org/abs/1906.02319v1","paper_title":"DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification","code":"https://github.com/jwu4sml/DEMO-Net","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"GCN_cheby (Kipf and Welling, 2017)","metrics":{"Accuracy":"0.516"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":31,"n_unverified":27,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":4,"model":"Union (Li et al., 2018)","metrics":{"Accuracy":"0.466"},"uses_additional_data":false,"paper_date":"2018-01-22","paper":"/paper/deeper-insights-into-graph-convolutional","paper_url":"http://arxiv.org/abs/1801.07606v1","paper_title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning","code":"https://github.com/liqimai/gcn","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"Intersection (Li et al., 2018)","metrics":{"Accuracy":"0.459"},"uses_additional_data":false,"paper_date":"2018-01-22","paper":"/paper/deeper-insights-into-graph-convolutional","paper_url":"http://arxiv.org/abs/1801.07606v1","paper_title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning","code":"https://github.com/liqimai/gcn","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"GraphSAGE (Hamilton et al., [2017a])","metrics":{"Accuracy":"0.404"},"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":7,"model":"GAT (Velickovic et al., 2018)","metrics":{"Accuracy":"0.382"},"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}}],"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":4,"distinct_papers_with_graph_line":4,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":89,"n_unverified":106,"n_samples":195,"n_pointer_only_licence":70,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":89,"n_unverified":106,"n_samples":195,"n_pointer_only_licence":70,"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"}}}