{"task":"Node Classification","dataset":"Amazon Computers","metric_names":["Accuracy"],"rows":[{"id":96219,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"GAT","metrics":{"Accuracy":"94.09±0.37"},"paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_date":"2024-06-13","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96220,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"GCN","metrics":{"Accuracy":"93.99±0.12"},"paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_date":"2024-06-13","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96221,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"GraphSAGE","metrics":{"Accuracy":"93.25±0.14"},"paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","paper_date":"2024-06-13","code_links":[{"title":"LUOyk1999/tunedGNN","url":"https://github.com/LUOyk1999/tunedGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96222,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"GNNMoE(GCN-like P)","metrics":{"Accuracy":"92.17±0.50"},"paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","paper_date":"2024-12-11","code_links":[{"title":"GISec-Team/GNNMoE","url":"https://github.com/GISec-Team/GNNMoE"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96223,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"GNNMoE(GAT-like P)","metrics":{"Accuracy":"91.98±0.46"},"paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","paper_date":"2024-12-11","code_links":[{"title":"GISec-Team/GNNMoE","url":"https://github.com/GISec-Team/GNNMoE"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96224,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"GNNMoE(SAGE-like P)","metrics":{"Accuracy":"91.85±0.39"},"paper_url":"https://arxiv.org/abs/2412.08193v1","paper_title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","paper_date":"2024-12-11","code_links":[{"title":"GISec-Team/GNNMoE","url":"https://github.com/GISec-Team/GNNMoE"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96225,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"CGT","metrics":{"Accuracy":"91.45±0.58"},"paper_url":"https://arxiv.org/abs/2312.16788v1","paper_title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","paper_date":"2023-12-28","code_links":[{"title":"nslab-cuk/community-aware-graph-transformer","url":"https://github.com/nslab-cuk/community-aware-graph-transformer"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96226,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"3ference","metrics":{"Accuracy":"90.74%"},"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","paper_date":"2022-04-11","code_links":[{"title":"cf020031308/3ference","url":"https://github.com/cf020031308/3ference"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96227,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"LinkDist","metrics":{"Accuracy":"89.49%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96228,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"LinkDistMLP","metrics":{"Accuracy":"89.44%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96229,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"CoLinkDist","metrics":{"Accuracy":"89.42%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96230,"task":"Node Classification","parent_task":null,"dataset":"Amazon Computers","model_name":"CoLinkDistMLP","metrics":{"Accuracy":"88.85%"},"paper_url":"https://arxiv.org/abs/2106.08541v1","paper_title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","paper_date":"2021-06-16","code_links":[{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist/blob/master/ogbn.py"},{"title":"cf020031308/LinkDist","url":"https://github.com/cf020031308/LinkDist"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}