{"url":"/sota/collaborative-filtering-on-netflix","task":{"name":"Recommendation Systems","url":"/task/recommendation-systems","note":null},"dataset":{"name":"Netflix","url":"/dataset/netflix-prize"},"category":"Miscellaneous","categories":["Graphs","Knowledge Base","Miscellaneous"],"category_note":null,"description":"### **Recommendation System in AI Research**  \r\n\r\nA **Recommendation System** is a specialized AI-driven model that analyzes user preferences and behaviors to suggest relevant content, products, or services. It is widely used in domains like e-commerce, streaming platforms, social media, and personalized learning.  \r\n\r\nAI research in recommendation systems focuses on:  \r\n- **Collaborative Filtering**: Predicting user preferences based on similar users' choices.  \r\n- **Content-Based Filtering**: Recommending items based on user history and item characteristics.  \r\n- **Hybrid Models**: Combining multiple techniques for better accuracy.  \r\n- **Deep Learning & Transformers**: Using neural networks and self-attention mechanisms for personalized recommendations.  \r\n- **Graph-Based Approaches**: Leveraging knowledge graphs for relationship-aware recommendations.  \r\n\r\nKey challenges include data sparsity, scalability, and bias mitigation. Cutting-edge research explores reinforcement learning, explainability, and privacy-preserving methods to enhance recommendation systems.","description_from":"task","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":["nDCG@100","nDCG@10","Recall@20","Recall@50","AUC","PSP@10","Recall@10","mAP@10","Recall@100"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"nDCG@100":"higher","nDCG@10":"higher","Recall@20":"higher","Recall@50":"higher","AUC":"higher","PSP@10":null,"Recall@10":"higher","mAP@10":"higher","Recall@100":"higher"}},"counts":{"rows":10,"rows_with_code":10,"rows_with_paper_page":10,"rows_dated":10,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"H+Vamp Gated","metrics":{"Recall@20":"0.37678","Recall@50":"0.46252","nDCG@100":"0.40861"},"uses_additional_data":false,"paper_date":"2019-11-03","paper":"/paper/enhancing-vaes-for-collaborative-filtering","paper_url":"https://arxiv.org/abs/1911.00936v1","paper_title":"Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms","code":"https://github.com/psywaves/EVCF","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"RecVAE","metrics":{"Recall@20":"0.361","Recall@50":"0.452","nDCG@100":"0.394"},"uses_additional_data":false,"paper_date":"2019-12-24","paper":"/paper/recvae-a-new-variational-autoencoder-for-top","paper_url":"https://arxiv.org/abs/1912.11160v1","paper_title":"RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback","code":"https://github.com/ilya-shenbin/RecVAE","n_code_links":3,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"EASE","metrics":{"Recall@20":"0.362","Recall@50":"0.445","nDCG@100":"0.393"},"uses_additional_data":false,"paper_date":"2019-05-08","paper":"/paper/190503375","paper_url":"https://arxiv.org/abs/1905.03375v1","paper_title":"Embarrassingly Shallow Autoencoders for Sparse Data","code":"https://github.com/PreferredAI/cornac","n_code_links":9,"syntology":{"n_ran":0,"n_unverified":6,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"RaCT","metrics":{"Recall@20":"0.357","Recall@50":" 0.450","nDCG@100":"0.392"},"uses_additional_data":false,"paper_date":"2019-06-10","paper":"/paper/towards-amortized-ranking-critical-training","paper_url":"https://arxiv.org/abs/1906.04281v2","paper_title":"Towards Amortized Ranking-Critical Training for Collaborative Filtering","code":"https://github.com/samlobel/RaCT_CF","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"Mult-VAE PR","metrics":{"Recall@20":"0.351","Recall@50":"0.444","nDCG@100":"0.386"},"uses_additional_data":false,"paper_date":"2018-02-16","paper":"/paper/variational-autoencoders-for-collaborative","paper_url":"http://arxiv.org/abs/1802.05814v1","paper_title":"Variational Autoencoders for Collaborative Filtering","code":"https://github.com/microsoft/recommenders","n_code_links":18,"syntology":{"n_ran":2,"n_unverified":19,"n_samples":21,"n_pointer_only_licence":1}},{"rank_in_archive_order":6,"model":"Mult-DAE","metrics":{"Recall@20":"0.344","Recall@50":"0.438","nDCG@100":"0.380"},"uses_additional_data":false,"paper_date":"2018-02-16","paper":"/paper/variational-autoencoders-for-collaborative","paper_url":"http://arxiv.org/abs/1802.05814v1","paper_title":"Variational Autoencoders for Collaborative Filtering","code":"https://github.com/microsoft/recommenders","n_code_links":18,"syntology":{"n_ran":2,"n_unverified":19,"n_samples":21,"n_pointer_only_licence":1}},{"rank_in_archive_order":7,"model":"∞-AE","metrics":{"AUC":"0.9728","PSP@10":"0.0375","Recall@10":"0.2969","Recall@100":"0.5088","nDCG@10":"0.3059","nDCG@100":"0.3659"},"uses_additional_data":false,"paper_date":"2022-06-03","paper":"/paper/infinite-recommendation-networks-a-data","paper_url":"https://arxiv.org/abs/2206.02626v3","paper_title":"Infinite Recommendation Networks: A Data-Centric Approach","code":"https://github.com/Guang000/Awesome-Dataset-Distillation","n_code_links":5,"syntology":{"n_ran":6,"n_unverified":7,"n_samples":13,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"LRML","metrics":{"Recall@10":"0.5371","nDCG@10":"0.3578"},"uses_additional_data":false,"paper_date":"2017-07-17","paper":"/paper/latent-relational-metric-learning-via-memory","paper_url":"http://arxiv.org/abs/1707.05176v3","paper_title":"Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking","code":"https://github.com/vanzytay/WWW2018_LRML","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"CML","metrics":{"Recall@10":"0.4612","nDCG@10":"0.2948"},"uses_additional_data":false,"paper_date":"2017-04-01","paper":"/paper/collaborative-metric-learning","paper_url":"https://ylongqi.com/publication/www17b/","paper_title":"Collaborative Metric Learning","code":"https://github.com/changun/CollMetric","n_code_links":2,"syntology":null},{"rank_in_archive_order":10,"model":"RATE-CSE","metrics":{"Recall@10":"0.2014","mAP@10":"0.1039"},"uses_additional_data":false,"paper_date":"2019-02-17","paper":"/paper/collaborative-similarity-embedding-for","paper_url":"http://arxiv.org/abs/1902.06188v2","paper_title":"Collaborative Similarity Embedding for Recommender Systems","code":"https://github.com/cnclabs/smore","n_code_links":2,"syntology":null}],"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":5,"rows_with_any_sample_ran":4,"distinct_papers_with_graph_line":4,"distinct_papers_with_any_sample_ran":3,"samples_over_distinct_papers":{"n_ran":12,"n_unverified":32,"n_samples":44,"n_pointer_only_licence":1,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":14,"n_unverified":51,"n_samples":65,"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"}}}