{"url":"/sota/node-classification-on-amz-comp","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"AMZ Comp","url":null},"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":"HH-GCN","metrics":{"Accuracy":"90.92%"},"uses_additional_data":false,"paper_date":"2023-08-17","paper":"/paper/half-hop-a-graph-upsampling-approach-for","paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","code":"https://github.com/nerdslab/halfhop","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"GCN","metrics":{"Accuracy":"90.22%"},"uses_additional_data":false,"paper_date":"2023-08-17","paper":"/paper/half-hop-a-graph-upsampling-approach-for","paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","code":"https://github.com/nerdslab/halfhop","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":"GCN (Heat Diffusion)","metrics":{"Accuracy":"86.77%"},"uses_additional_data":false,"paper_date":"2019-10-28","paper":"/paper/diffusion-improves-graph-learning-1","paper_url":"https://arxiv.org/abs/1911.05485v6","paper_title":"Diffusion Improves Graph Learning","code":"https://github.com/klicperajo/gdc","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"HH-GraphSAGE","metrics":{"Accuracy":"86.6%"},"uses_additional_data":false,"paper_date":"2023-08-17","paper":"/paper/half-hop-a-graph-upsampling-approach-for","paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","code":"https://github.com/nerdslab/halfhop","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"SIGN","metrics":{"Accuracy":"85.93 ± 1.21"},"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":6,"model":"GraphSAGE","metrics":{"Accuracy":"84.79%"},"uses_additional_data":false,"paper_date":"2023-08-17","paper":"/paper/half-hop-a-graph-upsampling-approach-for","paper_url":"https://arxiv.org/abs/2308.09198v1","paper_title":"Half-Hop: A graph upsampling approach for slowing down message passing","code":"https://github.com/nerdslab/halfhop","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"Graph InfoClust (GIC)","metrics":{"Accuracy":"81.5 ± 1.0"},"uses_additional_data":false,"paper_date":"2020-09-15","paper":"/paper/graph-infoclust-leveraging-cluster-level-node","paper_url":"https://arxiv.org/abs/2009.06946v1","paper_title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","code":"https://github.com/cmavro/Graph-InfoClust-GIC","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"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":7,"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":3,"n_unverified":11,"n_samples":14,"n_pointer_only_licence":1,"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":14,"n_samples":17,"n_pointer_only_licence":1,"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"}}}