{"url":"/sota/node-classification-on-amazon-computers-1","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"Amazon Computers","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":12,"rows_with_code":12,"rows_with_paper_page":12,"rows_dated":12,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GAT","metrics":{"Accuracy":"94.09±0.37"},"uses_additional_data":false,"paper_date":"2024-06-13","paper":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","code":"https://github.com/LUOyk1999/tunedGNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"GCN","metrics":{"Accuracy":"93.99±0.12"},"uses_additional_data":false,"paper_date":"2024-06-13","paper":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","code":"https://github.com/LUOyk1999/tunedGNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"GraphSAGE","metrics":{"Accuracy":"93.25±0.14"},"uses_additional_data":false,"paper_date":"2024-06-13","paper":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","code":"https://github.com/LUOyk1999/tunedGNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"GNNMoE(GCN-like P)","metrics":{"Accuracy":"92.17±0.50"},"uses_additional_data":false,"paper_date":"2024-12-11","paper":"/paper/mixture-of-experts-meets-decoupled-message","paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","code":"https://github.com/GISec-Team/GNNMoE","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"GNNMoE(GAT-like P)","metrics":{"Accuracy":"91.98±0.46"},"uses_additional_data":false,"paper_date":"2024-12-11","paper":"/paper/mixture-of-experts-meets-decoupled-message","paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","code":"https://github.com/GISec-Team/GNNMoE","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"GNNMoE(SAGE-like P)","metrics":{"Accuracy":"91.85±0.39"},"uses_additional_data":false,"paper_date":"2024-12-11","paper":"/paper/mixture-of-experts-meets-decoupled-message","paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","code":"https://github.com/GISec-Team/GNNMoE","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"CGT","metrics":{"Accuracy":"91.45±0.58"},"uses_additional_data":false,"paper_date":"2023-12-28","paper":"/paper/mitigating-degree-biases-in-message-passing","paper_url":"https://arxiv.org/abs/2312.16788v1","paper_title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","code":"https://github.com/nslab-cuk/community-aware-graph-transformer","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"3ference","metrics":{"Accuracy":"90.74%"},"uses_additional_data":false,"paper_date":"2022-04-11","paper":"/paper/inferring-from-references-with-differences","paper_url":"https://www.mdpi.com/2227-7390/10/8/1262/htm","paper_title":"Inferring from References with Differences for Semi-Supervised Node Classification on Graphs","code":"https://github.com/cf020031308/3ference","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"LinkDist","metrics":{"Accuracy":"89.49%"},"uses_additional_data":false,"paper_date":"2021-06-16","paper":"/paper/distilling-self-knowledge-from-contrastive","paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","code":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":10,"model":"LinkDistMLP","metrics":{"Accuracy":"89.44%"},"uses_additional_data":false,"paper_date":"2021-06-16","paper":"/paper/distilling-self-knowledge-from-contrastive","paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","code":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":11,"model":"CoLinkDist","metrics":{"Accuracy":"89.42%"},"uses_additional_data":false,"paper_date":"2021-06-16","paper":"/paper/distilling-self-knowledge-from-contrastive","paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","code":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":12,"model":"CoLinkDistMLP","metrics":{"Accuracy":"88.85%"},"uses_additional_data":false,"paper_date":"2021-06-16","paper":"/paper/distilling-self-knowledge-from-contrastive","paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","code":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"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":7,"rows_with_any_sample_ran":3,"distinct_papers_with_graph_line":2,"distinct_papers_with_any_sample_ran":1,"samples_over_distinct_papers":{"n_ran":2,"n_unverified":8,"n_samples":10,"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":6,"n_unverified":25,"n_samples":31,"n_pointer_only_licence":4,"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"}}}