{"task":"Node Classification","dataset":"Cora Full","metric_names":["Accuracy"],"rows":[{"id":97386,"task":"Node Classification","parent_task":null,"dataset":"Cora Full","model_name":"NCSAGE","metrics":{"Accuracy":"72.58 ± 0.65%"},"paper_url":"https://arxiv.org/abs/2306.02285v6","paper_title":"Clarify Confused Nodes via Separated Learning","paper_date":"2023-06-04","code_links":[{"title":"GISec-Team/NCGNN","url":"https://github.com/GISec-Team/NCGNN"}],"metrics_order":"[\"Accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":97387,"task":"Node Classification","parent_task":null,"dataset":"Cora Full","model_name":"CoLinkDist","metrics":{"Accuracy":"70.32%"},"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":97388,"task":"Node Classification","parent_task":null,"dataset":"Cora Full","model_name":"LinkDist","metrics":{"Accuracy":"69.87%"},"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":97389,"task":"Node Classification","parent_task":null,"dataset":"Cora Full","model_name":"CoLinkDistMLP","metrics":{"Accuracy":"69.83%"},"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":97390,"task":"Node Classification","parent_task":null,"dataset":"Cora Full","model_name":"LinkDistMLP","metrics":{"Accuracy":"69.53%"},"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":[]}]}