{"url":"/sota/collaborative-filtering-on-gowalla","task":{"name":"Collaborative Filtering","url":"/task/collaborative-filtering","note":null},"dataset":{"name":"Gowalla","url":"/dataset/gowalla"},"category":"Miscellaneous","categories":["Miscellaneous"],"category_note":null,"description":null,"description_from":null,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Recall@20","NDCG@20"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Recall@20":"higher","NDCG@20":"higher"}},"counts":{"rows":11,"rows_with_code":11,"rows_with_paper_page":11,"rows_dated":11,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"RLAE-DAN","metrics":{"NDCG@20":"0.1605","Recall@20":"0.1922"},"uses_additional_data":false,"paper_date":"2025-04-08","paper":"/paper/why-is-normalization-necessary-for-linear","paper_url":"https://arxiv.org/abs/2504.05805v2","paper_title":"Why is Normalization Necessary for Linear Recommenders?","code":"https://github.com/psm1206/dan","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"BSPM-EM","metrics":{"NDCG@20":"0.1597","Recall@20":"0.1920"},"uses_additional_data":false,"paper_date":"2022-11-17","paper":"/paper/perturbation-recovery-method-for","paper_url":"https://arxiv.org/abs/2211.09324v2","paper_title":"Blurring-Sharpening Process Models for Collaborative Filtering","code":"https://github.com/jeongwhanchoi/bspm","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"NESCL","metrics":{"NDCG@20":"0.1617","Recall@20":"0.1917"},"uses_additional_data":false,"paper_date":"2024-02-18","paper":"/paper/neighborhood-enhanced-supervised-contrastive","paper_url":"https://arxiv.org/abs/2402.11523v1","paper_title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","code":"https://github.com/PeiJieSun/NESCL","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"BSPM-LM","metrics":{"NDCG@20":"0.1570","Recall@20":"0.1901"},"uses_additional_data":false,"paper_date":"2022-11-17","paper":"/paper/perturbation-recovery-method-for","paper_url":"https://arxiv.org/abs/2211.09324v2","paper_title":"Blurring-Sharpening Process Models for Collaborative Filtering","code":"https://github.com/jeongwhanchoi/bspm","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"LT-OCF","metrics":{"NDCG@20":"0.1574","Recall@20":"0.1875"},"uses_additional_data":false,"paper_date":"2021-08-08","paper":"/paper/lt-ocf-learnable-time-ode-based-collaborative","paper_url":"https://arxiv.org/abs/2108.06208v3","paper_title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","code":"https://github.com/jeongwhanchoi/lt-ocf","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"SimpleX","metrics":{"NDCG@20":"0.1557","Recall@20":"0.1872"},"uses_additional_data":false,"paper_date":"2021-09-26","paper":"/paper/simplex-a-simple-and-strong-baseline-for","paper_url":"https://arxiv.org/abs/2109.12613v3","paper_title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","code":"https://github.com/reczoo/RecZoo/tree/main/matching/cf/SimpleX","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"UltraGCN","metrics":{"NDCG@20":"0.1580","Recall@20":"0.1862"},"uses_additional_data":false,"paper_date":"2021-10-28","paper":"/paper/ultragcn-ultra-simplification-of-graph","paper_url":"https://arxiv.org/abs/2110.15114v2","paper_title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","code":"https://github.com/reczoo/RecZoo/tree/main/matching/gnn/UltraGCN","n_code_links":2,"syntology":null},{"rank_in_archive_order":8,"model":"Emb-GCN","metrics":{"Recall@20":"0.1862"},"uses_additional_data":false,"paper_date":"2021-10-28","paper":"/paper/ultragcn-ultra-simplification-of-graph","paper_url":"https://arxiv.org/abs/2110.15114v2","paper_title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","code":"https://github.com/reczoo/RecZoo/tree/main/matching/gnn/UltraGCN","n_code_links":2,"syntology":null},{"rank_in_archive_order":9,"model":"GF-CF","metrics":{"NDCG@20":"0.1518","Recall@20":"0.1849"},"uses_additional_data":false,"paper_date":"2021-08-17","paper":"/paper/how-powerful-is-graph-convolution-for","paper_url":"https://arxiv.org/abs/2108.07567v1","paper_title":"How Powerful is Graph Convolution for Recommendation?","code":"https://github.com/yshenaw/GF_CF","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"LightGCN","metrics":{"NDCG@20":"0.1554","Recall@20":"0.1830"},"uses_additional_data":false,"paper_date":"2020-02-06","paper":"/paper/lightgcn-simplifying-and-powering-graph","paper_url":"https://arxiv.org/abs/2002.02126v4","paper_title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","code":"https://github.com/microsoft/recommenders","n_code_links":18,"syntology":{"n_ran":2,"n_unverified":5,"n_samples":7,"n_pointer_only_licence":2}},{"rank_in_archive_order":11,"model":"NGCF","metrics":{"Recall@20":"0.1570"},"uses_additional_data":false,"paper_date":"2019-05-20","paper":"/paper/neural-graph-collaborative-filtering","paper_url":"https://arxiv.org/abs/1905.08108v2","paper_title":"Neural Graph Collaborative Filtering","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/NGCF","n_code_links":21,"syntology":{"n_ran":6,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":0}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":6,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":5,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":10,"n_unverified":10,"n_samples":20,"n_pointer_only_licence":2,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":11,"n_unverified":10,"n_samples":21,"n_pointer_only_licence":2,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}