{"task":"Recommendation Systems","dataset":"Gowalla","metric_names":["nDCG@20","Recall@20","HR@10","HR@100","PSP@10","nDCG@10","nDCG@100"],"rows":[{"id":61206,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"ConvNCF","metrics":{"nDCG@20":"0.6019"},"paper_url":"http://arxiv.org/abs/1808.03912v1","paper_title":"Outer Product-based Neural Collaborative Filtering","paper_date":"2018-08-12","code_links":[{"title":"duxy-me/ConvNCF","url":"https://github.com/duxy-me/ConvNCF"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61207,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"NESCL","metrics":{"Recall@20":"0.1917","nDCG@20":"0.1617"},"paper_url":"https://arxiv.org/abs/2402.11523v1","paper_title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","paper_date":"2024-02-18","code_links":[{"title":"PeiJieSun/NESCL","url":"https://github.com/PeiJieSun/NESCL"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61208,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"RLAE-DAN","metrics":{"Recall@20":"0.1922","nDCG@20":"0.1605"},"paper_url":"https://arxiv.org/abs/2504.05805v2","paper_title":"Why is Normalization Necessary for Linear Recommenders?","paper_date":"2025-04-08","code_links":[{"title":"psm1206/dan","url":"https://github.com/psm1206/dan"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61209,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"BSPM-EM","metrics":{"Recall@20":"0.1920","nDCG@20":"0.1597"},"paper_url":"https://arxiv.org/abs/2211.09324v2","paper_title":"Blurring-Sharpening Process Models for Collaborative Filtering","paper_date":"2022-11-17","code_links":[{"title":"jeongwhanchoi/bspm","url":"https://github.com/jeongwhanchoi/bspm"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61210,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"MGDCF","metrics":{"Recall@20":"0.1864","nDCG@20":"0.1589"},"paper_url":"https://arxiv.org/abs/2204.02338v2","paper_title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","paper_date":"2022-04-05","code_links":[{"title":"CrawlScript/Torch-MGDCF","url":"https://github.com/CrawlScript/Torch-MGDCF"},{"title":"hujunxianligong/MGDCF","url":"https://github.com/hujunxianligong/MGDCF"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61211,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"Emb-GCN","metrics":{"Recall@20":"0.1862","nDCG@20":"0.1580"},"paper_url":"https://arxiv.org/abs/2110.15114v2","paper_title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","paper_date":"2021-10-28","code_links":[{"title":"reczoo/RecZoo","url":"https://github.com/reczoo/RecZoo/tree/main/matching/gnn/UltraGCN"},{"title":"shuyao-wang/dsl","url":"https://github.com/shuyao-wang/dsl"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61212,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"LT-OCF","metrics":{"Recall@20":"0.1875","nDCG@20":"0.1574"},"paper_url":"https://arxiv.org/abs/2108.06208v3","paper_title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","paper_date":"2021-08-08","code_links":[{"title":"jeongwhanchoi/lt-ocf","url":"https://github.com/jeongwhanchoi/lt-ocf"},{"title":"jeongwhanchoi/LT-OCF-Tutorial","url":"https://github.com/jeongwhanchoi/LT-OCF-Tutorial"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61213,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"BSPM-LM","metrics":{"Recall@20":"0.1901","nDCG@20":"0.157"},"paper_url":"https://arxiv.org/abs/2211.09324v2","paper_title":"Blurring-Sharpening Process Models for Collaborative Filtering","paper_date":"2022-11-17","code_links":[{"title":"jeongwhanchoi/bspm","url":"https://github.com/jeongwhanchoi/bspm"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61214,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"SimpleX","metrics":{"Recall@20":"0.1872","nDCG@20":"0.1557"},"paper_url":"https://arxiv.org/abs/2109.12613v3","paper_title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","paper_date":"2021-09-26","code_links":[{"title":"reczoo/RecZoo","url":"https://github.com/reczoo/RecZoo/tree/main/matching/cf/SimpleX"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61215,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"LightGCN","metrics":{"Recall@20":"0.1830","nDCG@20":"0.1554"},"paper_url":"https://arxiv.org/abs/2002.02126v4","paper_title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","paper_date":"2020-02-06","code_links":[{"title":"microsoft/recommenders","url":"https://github.com/microsoft/recommenders"},{"title":"gusye1234/pytorch-light-gcn","url":"https://github.com/gusye1234/pytorch-light-gcn"},{"title":"PreferredAI/cornac","url":"https://github.com/PreferredAI/cornac"},{"title":"gusye1234/LightGCN-PyTorch","url":"https://github.com/gusye1234/LightGCN-PyTorch"},{"title":"kuandeng/LightGCN","url":"https://github.com/kuandeng/LightGCN"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"LehengTHU/Agent4Rec","url":"https://github.com/LehengTHU/Agent4Rec"},{"title":"yshenaw/GF_CF","url":"https://github.com/yshenaw/GF_CF"},{"title":"jinfeng-xu/fkan-gcf","url":"https://github.com/jinfeng-xu/fkan-gcf"},{"title":"apat1n/LightGCN-Pytorch","url":"https://github.com/apat1n/LightGCN-Pytorch"},{"title":"Wuyxin/LightGCN-parallelized-version","url":"https://github.com/Wuyxin/LightGCN-parallelized-version"},{"title":"shuyao-wang/dsl","url":"https://github.com/shuyao-wang/dsl"},{"title":"lucapantea/LightGCN","url":"https://github.com/lucapantea/LightGCN"},{"title":"sayamsingla2000/LightGCN_MovieLens","url":"https://github.com/sayamsingla2000/LightGCN_MovieLens"},{"title":"JiahaoWuGit/DcRec","url":"https://github.com/JiahaoWuGit/DcRec"},{"title":"Trantin84/NGCF-Tin","url":"https://github.com/Trantin84/NGCF-Tin"},{"title":"tanya525625/LightGCN-PyTorch","url":"https://github.com/tanya525625/LightGCN-PyTorch"},{"title":"nathann3/better_than_netflix_movie_recommender","url":"https://github.com/nathann3/better_than_netflix_movie_recommender"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61216,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"SSCF","metrics":{"Recall@20":"0.1775","nDCG@20":"0.1390"},"paper_url":"https://arxiv.org/abs/2210.07039v2","paper_title":"Sapling Similarity: a performing and interpretable memory-based tool for recommendation","paper_date":"2022-10-13","code_links":[{"title":"giamba95/saplingsimilarity","url":"https://github.com/giamba95/saplingsimilarity"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61217,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"NGCF","metrics":{"Recall@20":"0.1570","nDCG@20":"0.1327"},"paper_url":"https://arxiv.org/abs/1905.08108v2","paper_title":"Neural Graph Collaborative Filtering","paper_date":"2019-05-20","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/NGCF"},{"title":"PreferredAI/cornac","url":"https://github.com/PreferredAI/cornac"},{"title":"xiangwang1223/neural_graph_collaborative_filtering","url":"https://github.com/xiangwang1223/neural_graph_collaborative_filtering"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"weiyinwei/mmgcn","url":"https://github.com/weiyinwei/mmgcn"},{"title":"huangtinglin/NGCF-PyTorch","url":"https://github.com/huangtinglin/NGCF-PyTorch"},{"title":"talkingwallace/NGCF-pytorch","url":"https://github.com/talkingwallace/NGCF-pytorch"},{"title":"jinfeng-xu/fkan-gcf","url":"https://github.com/jinfeng-xu/fkan-gcf"},{"title":"liu-jc/PyTorch_NGCF","url":"https://github.com/liu-jc/PyTorch_NGCF"},{"title":"GitHubLuCheng/Causal-Understanding-of-Fake-News-Dissemination","url":"https://github.com/GitHubLuCheng/Causal-Understanding-of-Fake-News-Dissemination"},{"title":"weiyinwei/huign","url":"https://github.com/weiyinwei/huign"},{"title":"MiloudBi/NGCF-pytorch","url":"https://github.com/MiloudBi/NGCF-pytorch"},{"title":"lt610/DAGNN","url":"https://github.com/lt610/DAGNN"},{"title":"nathann3/better_than_netflix_movie_recommender","url":"https://github.com/nathann3/better_than_netflix_movie_recommender"},{"title":"florianeBhz/NGCF_Pytorch","url":"https://github.com/florianeBhz/NGCF_Pytorch"},{"title":"xiaoleiHou214/BGCF-pytorch-master","url":"https://github.com/xiaoleiHou214/BGCF-pytorch-master"},{"title":"CHFsky/ngcf-paddle","url":"https://github.com/CHFsky/ngcf-paddle"},{"title":"zzz2010/ngcf-paddle2","url":"https://github.com/zzz2010/ngcf-paddle2"},{"title":"chfhf/ngcf-paddle","url":"https://github.com/chfhf/ngcf-paddle"},{"title":"madansinghal/graphranko","url":"https://github.com/madansinghal/graphranko"},{"title":"immabe/NGCF_pytorch","url":"https://github.com/immabe/NGCF_pytorch"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61218,"task":"Recommendation Systems","parent_task":null,"dataset":"Gowalla","model_name":"SVD-AE","metrics":{"HR@10":"0.144","HR@100":"0.3734","PSP@10":"0.248","nDCG@10":"0.1394","nDCG@100":"0.2115"},"paper_url":"https://arxiv.org/abs/2405.04746v1","paper_title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","paper_date":"2024-05-08","code_links":[{"title":"seoyoungh/svd-ae","url":"https://github.com/seoyoungh/svd-ae"},{"title":"jeongwhanchoi/svd-ae","url":"https://github.com/jeongwhanchoi/svd-ae"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"HR@100\", \"PSP@10\", \"nDCG@10\", \"nDCG@100\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]}]}