{"task":"Node Classification","dataset":"DBLP","metric_names":["Accuracy","Micro F1","Inference Time (ms)","Macro F1"],"rows":[{"id":96178,"task":"Node Classification","parent_task":null,"dataset":"DBLP","model_name":"GRACE","metrics":{"Accuracy":"84.2 ± 0.1"},"paper_url":"https://arxiv.org/abs/2006.04131v2","paper_title":"Deep Graph Contrastive Representation Learning","paper_date":"2020-06-07","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grace"},{"title":"CRIPAC-DIG/GRACE","url":"https://github.com/CRIPAC-DIG/GRACE"},{"title":"ycremar/DIG-SSL","url":"https://github.com/ycremar/DIG-SSL"}],"metrics_order":"[\"Accuracy\", \"Micro F1\", \"Inference Time (ms)\", \"Macro F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96179,"task":"Node Classification","parent_task":null,"dataset":"DBLP","model_name":"RR-GCN-PPV","metrics":{"Accuracy":"70.61"},"paper_url":"https://arxiv.org/abs/2203.02424v2","paper_title":"R-GCN: The R Could Stand for Random","paper_date":"2022-03-04","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"metrics_order":"[\"Accuracy\", \"Micro F1\", \"Inference Time (ms)\", \"Macro F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96180,"task":"Node Classification","parent_task":null,"dataset":"DBLP","model_name":"R-GCN","metrics":{"Accuracy":"68.51"},"paper_url":"https://arxiv.org/abs/2203.02424v2","paper_title":"R-GCN: The R Could Stand for Random","paper_date":"2022-03-04","code_links":[{"title":"predict-idlab/RR-GCN","url":"https://github.com/predict-idlab/RR-GCN"}],"metrics_order":"[\"Accuracy\", \"Micro F1\", \"Inference Time (ms)\", \"Macro F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96181,"task":"Node Classification","parent_task":null,"dataset":"DBLP","model_name":"DAOR","metrics":{"Macro F1":"87.64","Micro F1":"87.86"},"paper_url":"https://arxiv.org/abs/1912.08808v1","paper_title":"Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection","paper_date":"2019-12-17","code_links":[{"title":"eXascaleInfolab/daor","url":"https://github.com/eXascaleInfolab/daor"}],"metrics_order":"[\"Accuracy\", \"Micro F1\", \"Inference Time (ms)\", \"Macro F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96182,"task":"Node Classification","parent_task":null,"dataset":"DBLP","model_name":"PairE","metrics":{"Micro F1":"80.58"},"paper_url":"https://arxiv.org/abs/2203.01564v1","paper_title":"Graph Representation Learning Beyond Node and Homophily","paper_date":"2022-03-03","code_links":[{"title":"syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily","url":"https://github.com/syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily"}],"metrics_order":"[\"Accuracy\", \"Micro F1\", \"Inference Time (ms)\", \"Macro F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":96183,"task":"Node Classification","parent_task":null,"dataset":"DBLP","model_name":"FIT-GNN","metrics":{"Inference Time (ms)":"0.0018"},"paper_url":"https://arxiv.org/abs/2410.15001v2","paper_title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","paper_date":"2024-10-19","code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}],"metrics_order":"[\"Accuracy\", \"Micro F1\", \"Inference Time (ms)\", \"Macro F1\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}