{"task":"Link Property Prediction","dataset":"ogbl-ddi","metric_names":["Ext. data","Test Hits@20","Validation Hits@20","Number of params"],"rows":[{"id":114594,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"HyperFusion","metrics":{"Ext. data":"No","Number of params":"976022023","Test Hits@20":"0.9972 ± 0.0004","Validation Hits@20":"0.9956 ± 0.0001"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114595,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"ELGNN","metrics":{"Ext. data":"No","Number of params":"10512391","Test Hits@20":"0.9777 ± 0.0037","Validation Hits@20":"0.8965 ± 0.0021"},"paper_url":"https://arxiv.org/abs/2310.14166v1","paper_title":"Ensemble Learning for Graph Neural Networks","paper_date":"2023-10-22","code_links":[{"title":"wongzhenhao/ELGNN","url":"https://github.com/wongzhenhao/ELGNN"},{"title":"wongzhenhao/elgnn","url":"https://github.com/wongzhenhao/elgnn"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114596,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GCN (node embedding)","metrics":{"Ext. data":"No","Number of params":"5125250","Test Hits@20":"0.9549 ± 0.0073","Validation Hits@20":"0.9098 ± 0.0294"},"paper_url":"https://arxiv.org/abs/2411.14711v1","paper_title":"Can GNNs Learn Link Heuristics? A Concise Review and Evaluation of Link Prediction Methods","paper_date":"2024-11-22","code_links":[{"title":"astroming/GNNHE","url":"https://github.com/astroming/GNNHE"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114597,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GIDN@YITU","metrics":{"Ext. data":"No","Number of params":"3506691","Test Hits@20":"0.9542 ± 0.0000","Validation Hits@20":"0.8258 ± 0.0000"},"paper_url":"https://arxiv.org/abs/2210.01301v3","paper_title":"GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction","paper_date":"2022-10-04","code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114598,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"AGDN (AUC loss)","metrics":{"Ext. data":"No","Number of params":"3506691","Test Hits@20":"0.9538 ± 0.0094","Validation Hits@20":"0.8943 ± 0.0281"},"paper_url":"https://arxiv.org/abs/2012.15024v2","paper_title":"Adaptive Graph Diffusion Networks","paper_date":"2020-12-30","code_links":[{"title":"skepsun/SAGN_with_SLE","url":"https://github.com/skepsun/SAGN_with_SLE"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114599,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"Refined-GAE","metrics":{"Ext. data":"No","Number of params":"13816833","Test Hits@20":"0.9443 ± 0.0057","Validation Hits@20":"0.7979 ± 0.0159"},"paper_url":"https://arxiv.org/abs/2411.03845v1","paper_title":"Reconsidering the Performance of GAE in Link Prediction","paper_date":"2024-11-06","code_links":[{"title":"GraphPKU/Refined-GAE","url":"https://github.com/GraphPKU/Refined-GAE"},{"title":"graphpku/refined-gae","url":"https://github.com/graphpku/refined-gae"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114600,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"PSG","metrics":{"Ext. data":"No","Number of params":"3499009","Test Hits@20":"0.9284 ± 0.0047","Validation Hits@20":"0.8306 ± 0.0134"},"paper_url":"https://arxiv.org/abs/2208.05781v2","paper_title":"Path-aware Siamese Graph Neural Network for Link Prediction","paper_date":"2022-08-10","code_links":[{"title":"jingsonglv/PSG","url":"https://github.com/jingsonglv/PSG"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114601,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"PLNLP","metrics":{"Ext. data":"No","Number of params":"3497473","Test Hits@20":"0.9088 ± 0.0313","Validation Hits@20":"0.8242 ± 0.0253"},"paper_url":"https://arxiv.org/abs/2112.02936v6","paper_title":"Pairwise Learning for Neural Link Prediction","paper_date":"2021-12-06","code_links":[{"title":"zhitao-wang/PLNLP","url":"https://github.com/zhitao-wang/PLNLP"},{"title":"zhitao-wang/plnlp","url":"https://github.com/zhitao-wang/plnlp"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114602,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GDNN","metrics":{"Ext. data":"No","Number of params":"3761665","Test Hits@20":"0.9037 ± 0.0193","Validation Hits@20":"0.8599 ± 0.0286"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114603,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GraphSAGE + Edge Attr","metrics":{"Ext. data":"No","Number of params":"3761665","Test Hits@20":"0.8781 ± 0.0474","Validation Hits@20":"0.8044 ± 0.0404"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114604,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"CFLP (w/ JKNet)","metrics":{"Ext. data":"No","Number of params":"837635","Test Hits@20":"0.8608 ± 0.0198","Validation Hits@20":"0.8405 ± 0.0284"},"paper_url":"https://arxiv.org/abs/2106.02172v2","paper_title":"Learning from Counterfactual Links for Link Prediction","paper_date":"2021-06-03","code_links":[{"title":"DM2-ND/CFLP","url":"https://github.com/DM2-ND/CFLP"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114605,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GraphSAGE+anchor distance","metrics":{"Ext. data":"No","Number of params":"3760134","Test Hits@20":"0.8239 ± 0.0437","Validation Hits@20":"0.8206 ± 0.0298"},"paper_url":"https://www.dropbox.com/s/is3f4dfvtvnis7w/DEGNN_linkPrediction.pdf?dl=0","paper_title":"Distance-Enhanced Graph Neural Network for Link Prediction","paper_date":"2021-05-20","code_links":[{"title":"lbn187/DLGNN","url":"https://github.com/lbn187/DLGNN"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114606,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"NeuralCommonNeighbor","metrics":{"Ext. data":"No","Number of params":"1412098","Test Hits@20":"0.8232 ± 0.0610","Validation Hits@20":"0.7172 ± 0.0025"},"paper_url":"https://arxiv.org/abs/2302.00890v4","paper_title":"Neural Common Neighbor with Completion for Link Prediction","paper_date":"2023-02-02","code_links":[{"title":"GraphPKU/NeuralCommonNeighbor","url":"https://github.com/GraphPKU/NeuralCommonNeighbor"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114607,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"ELPH","metrics":{"Ext. data":"No","Number of params":"2910817","Test Hits@20":"0.7704 ± 0.0582","Validation Hits@20":"0.6928 ± 0.0096"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114608,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"DEA + JKNet","metrics":{"Ext. data":"No","Number of params":"1763329","Test Hits@20":"0.7672 ± 0.0265","Validation Hits@20":"0.6713 ± 0.0071"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114609,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"BUDDY","metrics":{"Ext. data":"No","Number of params":"2712931","Test Hits@20":"0.7654 ± 0.0459","Validation Hits@20":"0.6927 ± 0.0054"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114610,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GraphSAGE+Edge Proposal Set","metrics":{"Ext. data":"No","Number of params":"1421057","Test Hits@20":"0.7495 ± 0.0317","Validation Hits@20":"0.6696 ± 0.0198"},"paper_url":"https://arxiv.org/abs/2106.15810v1","paper_title":"Edge Proposal Sets for Link Prediction","paper_date":"2021-06-30","code_links":[{"title":"sangyx/gtrick","url":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg"},{"title":"CUAI/Edge-Proposal-Sets","url":"https://github.com/CUAI/Edge-Proposal-Sets"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114611,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"LRGA+GCN(Node2Vec+Augment)","metrics":{"Ext. data":"No","Number of params":"10235281","Test Hits@20":"0.7385 ± 0.0871","Validation Hits@20":"0.7225 ± 0.0047"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114612,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"MAD Learning","metrics":{"Ext. data":"No","Number of params":"1228897","Test Hits@20":"0.6781 ± 0.0294","Validation Hits@20":"0.7010 ± 0.0082"},"paper_url":"https://arxiv.org/abs/2102.05246v2","paper_title":"Memory-Associated Differential Learning","paper_date":"2021-02-10","code_links":[{"title":"cf020031308/mad-learning","url":"https://github.com/cf020031308/mad-learning"},{"title":"cf020031308/mad-learning","url":"https://github.com/cf020031308/mad-learning/blob/master/ogbl-ddi.py"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114613,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"LRGA + GCN","metrics":{"Ext. data":"No","Number of params":"1576081","Test Hits@20":"0.6230 ± 0.0912","Validation Hits@20":"0.6675 ± 0.0058"},"paper_url":"https://arxiv.org/abs/2006.07846v2","paper_title":"Global Attention Improves Graph Networks Generalization","paper_date":"2020-06-14","code_links":[{"title":"omri1348/LRGA","url":"https://github.com/omri1348/LRGA"},{"title":"omri1348/LRGA","url":"https://github.com/omri1348/LRGA/tree/master/ogb/examples/linkproppred"},{"title":"chuanqichen/cs224w","url":"https://github.com/chuanqichen/cs224w"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114614,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GCN+JKNet","metrics":{"Ext. data":"No","Number of params":"1421571","Test Hits@20":"0.6056 ± 0.0869","Validation Hits@20":"0.6776 ± 0.0095"},"paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","paper_date":"2016-09-09","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gcn"},{"title":"tkipf/gcn","url":"https://github.com/tkipf/gcn"},{"title":"tkipf/pygcn","url":"https://github.com/tkipf/pygcn"},{"title":"tkipf/keras-gcn","url":"https://github.com/tkipf/keras-gcn"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"deepchem/moleculenet","url":"https://github.com/deepchem/moleculenet"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"tk-rusch/graphcon","url":"https://github.com/tk-rusch/graphcon"},{"title":"jiangboahu/glcn-tf","url":"https://github.com/jiangboahu/glcn-tf"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"mahsa91/RA-GCN","url":"https://github.com/mahsa91/RA-GCN"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"emartinezs44/SparkGCN","url":"https://github.com/emartinezs44/SparkGCN"},{"title":"yanhuchen/quantum-graph-convolutional-network","url":"https://github.com/yanhuchen/quantum-graph-convolutional-network"},{"title":"HamzaGbada/GCN-Numpy","url":"https://github.com/HamzaGbada/GCN-Numpy"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"cybermonic/cage-4-submission","url":"https://github.com/cybermonic/cage-4-submission"},{"title":"mahsa91/GKD","url":"https://github.com/mahsa91/GKD"},{"title":"selmiss/gp-tlstgcn","url":"https://github.com/selmiss/gp-tlstgcn"},{"title":"hazdzz/GCN","url":"https://github.com/hazdzz/GCN"},{"title":"abi-kothapalli/minimumdominatingsets","url":"https://github.com/abi-kothapalli/minimumdominatingsets"},{"title":"tuananh0305/GCN_ANOMALY_DETECTION","url":"https://github.com/tuananh0305/GCN_ANOMALY_DETECTION"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"negarhdr/PGCN","url":"https://github.com/negarhdr/PGCN"},{"title":"ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS","url":"https://github.com/ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS"},{"title":"bcsrn/gcn","url":"https://github.com/bcsrn/gcn"},{"title":"yCobanoglu/infinite-width-gnns","url":"https://github.com/yCobanoglu/infinite-width-gnns"},{"title":"sunxiaobei/mindspore_gallery","url":"https://github.com/sunxiaobei/mindspore_gallery/tree/main/grl/gcn"},{"title":"kiharalab/gnn_pocket","url":"https://github.com/kiharalab/gnn_pocket"},{"title":"ykrmm/sota_gnn","url":"https://github.com/ykrmm/sota_gnn"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/ascend_gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/gpu_gcn"},{"title":"30Aniket/Graph-Convolutional-Networks-GCNs","url":"https://github.com/30Aniket/Graph-Convolutional-Networks-GCNs"},{"title":"zhiqiang00/Hon-GCN","url":"https://github.com/zhiqiang00/Hon-GCN"},{"title":"clin366/pygcn","url":"https://github.com/clin366/pygcn"},{"title":"nieci2024/pyglcn","url":"https://github.com/nieci2024/pyglcn"},{"title":"mahendrathapa/graph-convolution-network","url":"https://github.com/mahendrathapa/graph-convolution-network"},{"title":"yangjun1994/CAGCN","url":"https://github.com/yangjun1994/CAGCN"},{"title":"darnbi/pygcn","url":"https://github.com/darnbi/pygcn"},{"title":"1075225782/GCN","url":"https://github.com/1075225782/GCN"},{"title":"udlf/wsef","url":"https://github.com/udlf/wsef"},{"title":"thanhtrunghuynh93/pygcn","url":"https://github.com/thanhtrunghuynh93/pygcn"},{"title":"KimMeen/GCN","url":"https://github.com/KimMeen/GCN"},{"title":"LouisDumont/GCN---re-implementation","url":"https://github.com/LouisDumont/GCN---re-implementation"},{"title":"bepping/non-oversmoothing-gcns","url":"https://github.com/bepping/non-oversmoothing-gcns"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"},{"title":"HoganZhang/pygcn_python3","url":"https://github.com/HoganZhang/pygcn_python3"},{"title":"asif-salim/GCN-Graph_Convolutional_Network","url":"https://github.com/asif-salim/GCN-Graph_Convolutional_Network"},{"title":"2023-MindSpore-1/ms-code-11","url":"https://github.com/2023-MindSpore-1/ms-code-11/tree/main/gcn"},{"title":"ajbisberg/gcn","url":"https://github.com/ajbisberg/gcn"},{"title":"lipingcoding/pygcn","url":"https://github.com/lipingcoding/pygcn"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114615,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"NGNN + GraphSAGE","metrics":{"Ext. data":"No","Number of params":"1618433","Test Hits@20":"0.5770 ± 0.1523","Validation Hits@20":"0.7323 ± 0.0040"},"paper_url":"https://arxiv.org/abs/2111.11638v1","paper_title":"Network In Graph Neural Network","paper_date":"2021-11-23","code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114616,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"NGNN + GCN","metrics":{"Ext. data":"No","Number of params":"1487361","Test Hits@20":"0.5483 ± 0.1581","Validation Hits@20":"0.7121 ± 0.0038"},"paper_url":"https://arxiv.org/abs/2111.11638v1","paper_title":"Network In Graph Neural Network","paper_date":"2021-11-23","code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114617,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GraphSAGE","metrics":{"Ext. data":"No","Number of params":"1421057","Test Hits@20":"0.5390 ± 0.0474","Validation Hits@20":"0.6262 ± 0.0037"},"paper_url":"http://arxiv.org/abs/1706.02216v4","paper_title":"Inductive Representation Learning on Large Graphs","paper_date":"2017-06-07","code_links":[{"title":"pyg-team/pytorch_geometric","url":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/models/basic_gnn.py"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/graphsage"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"williamleif/GraphSAGE","url":"https://github.com/williamleif/GraphSAGE"},{"title":"stellargraph/stellargraph","url":"https://github.com/stellargraph/stellargraph"},{"title":"twjiang/graphSAGE-pytorch","url":"https://github.com/twjiang/graphSAGE-pytorch"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"weiyinwei/mmgcn","url":"https://github.com/weiyinwei/mmgcn"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"weiyinwei/huign","url":"https://github.com/weiyinwei/huign"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"pmlg/pytorch_GCN","url":"https://github.com/pmlg/pytorch_GCN"},{"title":"chatterjeeayan/upna","url":"https://github.com/chatterjeeayan/upna"},{"title":"Arvidsmile/InductiveDialogueGraph","url":"https://github.com/Arvidsmile/InductiveDialogueGraph"},{"title":"silent-code/deep-trace","url":"https://github.com/silent-code/deep-trace"},{"title":"erfmah/answering_graph_queries","url":"https://github.com/erfmah/answering_graph_queries"},{"title":"hmcreamer/hackRice19","url":"https://github.com/hmcreamer/hackRice19"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114618,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"GCN","metrics":{"Ext. data":"No","Number of params":"1289985","Test Hits@20":"0.3707 ± 0.0507","Validation Hits@20":"0.5550 ± 0.0208"},"paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","paper_date":"2016-09-09","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gcn"},{"title":"tkipf/gcn","url":"https://github.com/tkipf/gcn"},{"title":"tkipf/pygcn","url":"https://github.com/tkipf/pygcn"},{"title":"tkipf/keras-gcn","url":"https://github.com/tkipf/keras-gcn"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"deepchem/moleculenet","url":"https://github.com/deepchem/moleculenet"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"tk-rusch/graphcon","url":"https://github.com/tk-rusch/graphcon"},{"title":"jiangboahu/glcn-tf","url":"https://github.com/jiangboahu/glcn-tf"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"mahsa91/RA-GCN","url":"https://github.com/mahsa91/RA-GCN"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"emartinezs44/SparkGCN","url":"https://github.com/emartinezs44/SparkGCN"},{"title":"yanhuchen/quantum-graph-convolutional-network","url":"https://github.com/yanhuchen/quantum-graph-convolutional-network"},{"title":"HamzaGbada/GCN-Numpy","url":"https://github.com/HamzaGbada/GCN-Numpy"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"cybermonic/cage-4-submission","url":"https://github.com/cybermonic/cage-4-submission"},{"title":"mahsa91/GKD","url":"https://github.com/mahsa91/GKD"},{"title":"selmiss/gp-tlstgcn","url":"https://github.com/selmiss/gp-tlstgcn"},{"title":"hazdzz/GCN","url":"https://github.com/hazdzz/GCN"},{"title":"abi-kothapalli/minimumdominatingsets","url":"https://github.com/abi-kothapalli/minimumdominatingsets"},{"title":"tuananh0305/GCN_ANOMALY_DETECTION","url":"https://github.com/tuananh0305/GCN_ANOMALY_DETECTION"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"negarhdr/PGCN","url":"https://github.com/negarhdr/PGCN"},{"title":"ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS","url":"https://github.com/ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS"},{"title":"bcsrn/gcn","url":"https://github.com/bcsrn/gcn"},{"title":"yCobanoglu/infinite-width-gnns","url":"https://github.com/yCobanoglu/infinite-width-gnns"},{"title":"sunxiaobei/mindspore_gallery","url":"https://github.com/sunxiaobei/mindspore_gallery/tree/main/grl/gcn"},{"title":"kiharalab/gnn_pocket","url":"https://github.com/kiharalab/gnn_pocket"},{"title":"ykrmm/sota_gnn","url":"https://github.com/ykrmm/sota_gnn"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/ascend_gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/gpu_gcn"},{"title":"30Aniket/Graph-Convolutional-Networks-GCNs","url":"https://github.com/30Aniket/Graph-Convolutional-Networks-GCNs"},{"title":"zhiqiang00/Hon-GCN","url":"https://github.com/zhiqiang00/Hon-GCN"},{"title":"clin366/pygcn","url":"https://github.com/clin366/pygcn"},{"title":"nieci2024/pyglcn","url":"https://github.com/nieci2024/pyglcn"},{"title":"mahendrathapa/graph-convolution-network","url":"https://github.com/mahendrathapa/graph-convolution-network"},{"title":"yangjun1994/CAGCN","url":"https://github.com/yangjun1994/CAGCN"},{"title":"darnbi/pygcn","url":"https://github.com/darnbi/pygcn"},{"title":"1075225782/GCN","url":"https://github.com/1075225782/GCN"},{"title":"udlf/wsef","url":"https://github.com/udlf/wsef"},{"title":"thanhtrunghuynh93/pygcn","url":"https://github.com/thanhtrunghuynh93/pygcn"},{"title":"KimMeen/GCN","url":"https://github.com/KimMeen/GCN"},{"title":"LouisDumont/GCN---re-implementation","url":"https://github.com/LouisDumont/GCN---re-implementation"},{"title":"bepping/non-oversmoothing-gcns","url":"https://github.com/bepping/non-oversmoothing-gcns"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"},{"title":"HoganZhang/pygcn_python3","url":"https://github.com/HoganZhang/pygcn_python3"},{"title":"asif-salim/GCN-Graph_Convolutional_Network","url":"https://github.com/asif-salim/GCN-Graph_Convolutional_Network"},{"title":"2023-MindSpore-1/ms-code-11","url":"https://github.com/2023-MindSpore-1/ms-code-11/tree/main/gcn"},{"title":"ajbisberg/gcn","url":"https://github.com/ajbisberg/gcn"},{"title":"lipingcoding/pygcn","url":"https://github.com/lipingcoding/pygcn"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114619,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"SEAL","metrics":{"Ext. data":"No","Number of params":"531138","Test Hits@20":"0.3056 ± 0.0386","Validation Hits@20":"0.2849 ± 0.0269"},"paper_url":"https://arxiv.org/abs/2010.16103v5","paper_title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","paper_date":"2020-10-30","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/seal"},{"title":"facebookresearch/SEAL_OGB","url":"https://github.com/facebookresearch/SEAL_OGB"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114620,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"Node2vec","metrics":{"Ext. data":"No","Number of params":"645249","Test Hits@20":"0.2326 ± 0.0209","Validation Hits@20":"0.3292 ± 0.0121"},"paper_url":"http://arxiv.org/abs/1607.00653v1","paper_title":"node2vec: Scalable Feature Learning for Networks","paper_date":"2016-07-03","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/node2vec"},{"title":"shenweichen/GraphEmbedding","url":"https://github.com/shenweichen/GraphEmbedding"},{"title":"aditya-grover/node2vec","url":"https://github.com/aditya-grover/node2vec"},{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"eliorc/node2vec","url":"https://github.com/eliorc/node2vec"},{"title":"rusty1s/pytorch_cluster","url":"https://github.com/rusty1s/pytorch_cluster"},{"title":"cvg/scrstudio","url":"https://github.com/cvg/scrstudio"},{"title":"monarch-initiative/embiggen","url":"https://github.com/monarch-initiative/embiggen"},{"title":"TheJacksonLaboratory/N2V","url":"https://github.com/TheJacksonLaboratory/N2V"},{"title":"icd-codex/icd-codex","url":"https://github.com/icd-codex/icd-codex"},{"title":"razrLeLe/fastwalk","url":"https://github.com/razrLeLe/fastwalk"},{"title":"urielsinger/ctdne","url":"https://github.com/urielsinger/ctdne"},{"title":"thibaudmartinez/node2vec","url":"https://github.com/thibaudmartinez/node2vec"},{"title":"olety/TIMLinUCB","url":"https://github.com/olety/TIMLinUCB"},{"title":"fahrbach/icml-2020-faster-graph-embeddings","url":"https://github.com/fahrbach/icml-2020-faster-graph-embeddings"},{"title":"Nina-Konovalova/TSP-RL-Skoltech_project","url":"https://github.com/Nina-Konovalova/TSP-RL-Skoltech_project"},{"title":"urielsinger/fairwalk","url":"https://github.com/urielsinger/fairwalk"},{"title":"Robotmurlock/Deepwalk-and-Node2vec","url":"https://github.com/Robotmurlock/Deepwalk-and-Node2vec"},{"title":"printfer/CS6490_NetworkSecurity_FinalProject","url":"https://github.com/printfer/CS6490_NetworkSecurity_FinalProject"},{"title":"WiktorJ/msnode2vec","url":"https://github.com/WiktorJ/msnode2vec"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114621,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"DeepWalk","metrics":{"Ext. data":"No","Number of params":"1543913","Test Hits@20":"0.2246 ± 0.0290","Validation Hits@20":"Please tell us"},"paper_url":"http://arxiv.org/abs/1403.6652v2","paper_title":"DeepWalk: Online Learning of Social Representations","paper_date":"2014-03-26","code_links":[{"title":"PaddlePaddle/PaddleRec","url":"https://github.com/PaddlePaddle/PaddleRec/tree/master/models/recall/deepwalk"},{"title":"shenweichen/GraphEmbedding","url":"https://github.com/shenweichen/GraphEmbedding"},{"title":"williamleif/GraphSAGE","url":"https://github.com/williamleif/GraphSAGE"},{"title":"phanein/deepwalk","url":"https://github.com/phanein/deepwalk"},{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"oj9040/GraphSAGE_RL","url":"https://github.com/oj9040/GraphSAGE_RL"},{"title":"leihuayi/NetworkEmbedding","url":"https://github.com/leihuayi/NetworkEmbedding"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"Robotmurlock/Deepwalk-and-Node2vec","url":"https://github.com/Robotmurlock/Deepwalk-and-Node2vec"},{"title":"printfer/CS6490_NetworkSecurity_FinalProject","url":"https://github.com/printfer/CS6490_NetworkSecurity_FinalProject"},{"title":"gen3111620/DeepWalk","url":"https://github.com/gen3111620/DeepWalk"},{"title":"rforgione/deepwalk","url":"https://github.com/rforgione/deepwalk"},{"title":"ninoxjy/graph-embedding","url":"https://github.com/ninoxjy/graph-embedding"},{"title":"syyunn/node2vec","url":"https://github.com/syyunn/node2vec"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114622,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"Adamic Adar","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@20":"0.1861 ± 0.0000","Validation Hits@20":"0.0966 ± 0.0000"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114623,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"Common Neighbor","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@20":"0.1773 ± 0.0000","Validation Hits@20":"0.0947 ± 0.0000"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114624,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-ddi","model_name":"Matrix Factorization","metrics":{"Ext. data":"No","Number of params":"1224193","Test Hits@20":"0.1368 ± 0.0475","Validation Hits@20":"0.3370 ± 0.0264"},"paper_url":"https://arxiv.org/abs/2005.00687v7","paper_title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","paper_date":"2020-05-02","code_links":[{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/products"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/proteins"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/linkproppred/collab"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/linkproppred/ppa"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/mag"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/linkproppred/ddi"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/linkproppred/citation2"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/papers100M"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/arxiv"},{"title":"ant-research/KnowledgeGraphEmbeddingsViaPairedRelationVectors_PairRE","url":"https://github.com/ant-research/KnowledgeGraphEmbeddingsViaPairedRelationVectors_PairRE"},{"title":"alipay/KnowledgeGraphEmbeddingsViaPairedRelationVectors_PairRE","url":"https://github.com/alipay/KnowledgeGraphEmbeddingsViaPairedRelationVectors_PairRE"},{"title":"anonymous20221001/sieg_ogb","url":"https://github.com/anonymous20221001/sieg_ogb"},{"title":"destwang/InterHT","url":"https://github.com/destwang/InterHT"},{"title":"xyznlp/trans","url":"https://github.com/xyznlp/trans"},{"title":"ytbai/ogbn_arxiv_dgl","url":"https://github.com/ytbai/ogbn_arxiv_dgl"},{"title":"jingsonglv/CFG","url":"https://github.com/jingsonglv/CFG"},{"title":"jerermyyoung/AutoWeird","url":"https://github.com/jerermyyoung/AutoWeird"},{"title":"chatterjeeayan/upna","url":"https://github.com/chatterjeeayan/upna"},{"title":"icml2024357/hombasis-gnn","url":"https://github.com/icml2024357/hombasis-gnn"},{"title":"ThomPijnenburg/Collab-Link-Prediction","url":"https://github.com/ThomPijnenburg/Collab-Link-Prediction"}],"metrics_order":"[\"Ext. data\", \"Test Hits@20\", \"Validation Hits@20\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}