{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/collaborative-filtering/papers/4","list_of":"/task/collaborative-filtering","task":"Collaborative Filtering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":14,"rows_per_page":100,"rows":[301,400],"of":1309,"counts":{"archive_papers_tagged":1309,"with_a_code_link":461,"where_syntology_ran_a_sample":63,"not_listed_spam_title":0,"listed":1309,"listed_where_code_ran":63,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/collaborative-filtering","prev":"/task/collaborative-filtering/papers/3","next":"/task/collaborative-filtering/papers/5","papers":[{"url":"/paper/simplex-a-simple-and-strong-baseline-for","slug":"simplex-a-simple-and-strong-baseline-for","title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","date":"2021-09-26","arxiv_id":"2109.12613","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-plus-low-rank-matrix-decomposition-a","slug":"sparse-plus-low-rank-matrix-decomposition-a","title":"Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach","date":"2021-09-26","arxiv_id":"2109.12701","repositories_listed":1,"syntology":null},{"url":"/paper/recovering-individual-emotional-states-from","slug":"recovering-individual-emotional-states-from","title":"Recovering individual emotional states from sparse ratings using collaborative filtering","date":"2021-09-14","arxiv_id":"2109.06906","repositories_listed":1,"syntology":null},{"url":"/paper/fast-variational-autoencoder-with-inverted","slug":"fast-variational-autoencoder-with-inverted","title":"Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering","date":"2021-09-13","arxiv_id":"2109.05773","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-factorization-for-collaborative","slug":"matrix-factorization-for-collaborative","title":"Matrix Factorization for Collaborative Filtering Is Just Solving an Adjoint Latent Dirichlet Allocation Model After All","date":"2021-09-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-recommender-system-for-scientific-datasets","slug":"a-recommender-system-for-scientific-datasets","title":"A Recommender System for Scientific Datasets and Analysis Pipelines","date":"2021-08-20","arxiv_id":"2108.09275","repositories_listed":1,"syntology":null},{"url":"/paper/how-powerful-is-graph-convolution-for","slug":"how-powerful-is-graph-convolution-for","title":"How Powerful is Graph Convolution for Recommendation?","date":"2021-08-17","arxiv_id":"2108.07567","repositories_listed":1,"syntology":null},{"url":"/paper/graph-trend-networks-for-recommendations","slug":"graph-trend-networks-for-recommendations","title":"Graph Trend Filtering Networks for Recommendations","date":"2021-08-12","arxiv_id":"2108.05552","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-trend-networks-for-recommendations#ran","syntology_url":"https://syntology.ai/paper/2108.05552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05552"}},"official":{"repos":["wenqifan03/gtn-sigir2022"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-extractive-summarization-based","slug":"unsupervised-extractive-summarization-based","title":"Unsupervised Extractive Summarization-Based Representations for Accurate and Explainable Collaborative Filtering","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/reenvisioning-collaborative-filtering-vs","slug":"reenvisioning-collaborative-filtering-vs","title":"Reenvisioning Collaborative Filtering vs Matrix Factorization","date":"2021-07-28","arxiv_id":"2107.13472","repositories_listed":1,"syntology":null},{"url":"/paper/deep-variational-models-for-collaborative","slug":"deep-variational-models-for-collaborative","title":"Deep Variational Models for Collaborative Filtering-based Recommender Systems","date":"2021-07-27","arxiv_id":"2107.12677","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-latent-relation-modeling-for","slug":"hierarchical-latent-relation-modeling-for","title":"Hierarchical Latent Relation Modeling for Collaborative Metric Learning","date":"2021-07-26","arxiv_id":"2108.04655","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-representation-based-graph","slug":"inductive-representation-based-graph","title":"INMO: A Model-Agnostic and Scalable Module for Inductive Collaborative Filtering","date":"2021-07-12","arxiv_id":"2107.05247","repositories_listed":1,"syntology":null},{"url":"/paper/disenhan-disentangled-heterogeneous-graph","slug":"disenhan-disentangled-heterogeneous-graph","title":"DisenHAN: Disentangled Heterogeneous Graph Attention Network for Recommendation","date":"2021-06-21","arxiv_id":"2106.10879","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-review-on-non-neural-networks","slug":"a-comprehensive-review-on-non-neural-networks","title":"A Comprehensive Review on Non-Neural Networks Collaborative Filtering Recommendation Systems","date":"2021-06-20","arxiv_id":"2106.10679","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-legal-citation-recommendation","slug":"context-aware-legal-citation-recommendation","title":"Context-Aware Legal Citation Recommendation using Deep Learning","date":"2021-06-20","arxiv_id":"2106.10776","repositories_listed":1,"syntology":null},{"url":"/paper/multi-output-gaussian-processes-for-1","slug":"multi-output-gaussian-processes-for-1","title":"Multi-output Gaussian Processes for Uncertainty-aware Recommender Systems","date":"2021-06-08","arxiv_id":"2106.04221","repositories_listed":1,"syntology":null},{"url":"/paper/you-sound-like-someone-who-watches-drama","slug":"you-sound-like-someone-who-watches-drama","title":"You Sound Like Someone Who Watches Drama Movies: Towards Predicting Movie Preferences from Conversational Interactions","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/criterion-based-heterogeneous-collaborative","slug":"criterion-based-heterogeneous-collaborative","title":"Criterion-based Heterogeneous Collaborative Filtering for Multi-behavior Implicit Recommendation","date":"2021-05-25","arxiv_id":"2105.11876","repositories_listed":1,"syntology":null},{"url":"/paper/set2setrank-collaborative-set-to-set-ranking","slug":"set2setrank-collaborative-set-to-set-ranking","title":"Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation","date":"2021-05-16","arxiv_id":"2105.07377","repositories_listed":1,"syntology":null},{"url":"/paper/causal-intervention-for-leveraging-popularity","slug":"causal-intervention-for-leveraging-popularity","title":"Causal Intervention for Leveraging Popularity Bias in Recommendation","date":"2021-05-13","arxiv_id":"2105.06067","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/causal-intervention-for-leveraging-popularity#ran","syntology_url":"https://syntology.ai/paper/2105.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.06067"}},"official":{"repos":["zyang1580/PDA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-learning-based-recommender-systems-a","slug":"graph-learning-based-recommender-systems-a","title":"Graph Learning based Recommender Systems: A Review","date":"2021-05-13","arxiv_id":"2105.06339","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-explanations-for-neural","slug":"counterfactual-explanations-for-neural","title":"Counterfactual Explanations for Neural Recommenders","date":"2021-05-11","arxiv_id":"2105.05008","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/counterfactual-explanations-for-neural#ran","syntology_url":"https://syntology.ai/paper/2105.05008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.05008"}},"official":{"repos":["hieptk/accent"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-graph-matching-based-collaborative","slug":"neural-graph-matching-based-collaborative","title":"Neural Graph Matching based Collaborative Filtering","date":"2021-05-10","arxiv_id":"2105.04067","repositories_listed":1,"syntology":null},{"url":"/paper/ugrec-modeling-directed-and-undirected","slug":"ugrec-modeling-directed-and-undirected","title":"UGRec: Modeling Directed and Undirected Relations for Recommendation","date":"2021-05-10","arxiv_id":"2105.04183","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-neural-recommendation-from","slug":"a-survey-on-neural-recommendation-from","title":"A Survey on Accuracy-oriented Neural Recommendation: From Collaborative Filtering to Information-rich Recommendation","date":"2021-04-27","arxiv_id":"2104.13030","repositories_listed":1,"syntology":null},{"url":"/paper/attention-on-global-local-embedding-spaces-in","slug":"attention-on-global-local-embedding-spaces-in","title":"Attention on Global-Local Representation Spaces in Recommender Systems","date":"2021-04-25","arxiv_id":"2104.12050","repositories_listed":1,"syntology":null},{"url":"/paper/mining-latent-structures-for-multimedia","slug":"mining-latent-structures-for-multimedia","title":"Mining Latent Structures for Multimedia Recommendation","date":"2021-04-19","arxiv_id":"2104.09036","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mining-latent-structures-for-multimedia#ran","syntology_url":"https://syntology.ai/paper/2104.09036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09036"}},"official":{"repos":["CRIPAC-DIG/LATTICE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/projected-hamming-dissimilarity-for-bit-level","slug":"projected-hamming-dissimilarity-for-bit-level","title":"Projected Hamming Dissimilarity for Bit-Level Importance Coding in Collaborative Filtering","date":"2021-03-26","arxiv_id":"2103.14455","repositories_listed":1,"syntology":null},{"url":"/paper/numerical-comparisons-between-bayesian-and","slug":"numerical-comparisons-between-bayesian-and","title":"Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completion","date":"2021-03-22","arxiv_id":"2103.11749","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-and-contrastive-variational","slug":"adversarial-and-contrastive-variational","title":"Adversarial and Contrastive Variational Autoencoder for Sequential Recommendation","date":"2021-03-19","arxiv_id":"2103.10693","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-recommendation-for-portfolio","slug":"large-scale-recommendation-for-portfolio","title":"Large-scale Recommendation for Portfolio Optimization","date":"2021-03-13","arxiv_id":"2103.07768","repositories_listed":1,"syntology":null},{"url":"/paper/bcfnet-a-balanced-collaborative-filtering","slug":"bcfnet-a-balanced-collaborative-filtering","title":"BCFNet: A Balanced Collaborative Filtering Network with Attention Mechanism","date":"2021-03-10","arxiv_id":"2103.06105","repositories_listed":1,"syntology":null},{"url":"/paper/neural-content-aware-collaborative-filtering","slug":"neural-content-aware-collaborative-filtering","title":"Neural content-aware collaborative filtering for cold-start music recommendation","date":"2021-02-24","arxiv_id":"2102.12369","repositories_listed":1,"syntology":null},{"url":"/paper/factor-level-attentive-icf-for-recommendation","slug":"factor-level-attentive-icf-for-recommendation","title":"Feature-level Attentive ICF for Recommendation","date":"2021-02-22","arxiv_id":"2102.10745","repositories_listed":1,"syntology":null},{"url":"/paper/diversification-in-session-based-news","slug":"diversification-in-session-based-news","title":"Diversification in Session-based News Recommender Systems","date":"2021-02-05","arxiv_id":"2102.03265","repositories_listed":1,"syntology":null},{"url":"/paper/dual-embedding-based-neural-collaborative","slug":"dual-embedding-based-neural-collaborative","title":"Dual-embedding based Neural Collaborative Filtering for Recommender Systems","date":"2021-02-04","arxiv_id":"2102.02549","repositories_listed":1,"syntology":null},{"url":"/paper/causal-collaborative-filtering","slug":"causal-collaborative-filtering","title":"Causal Collaborative Filtering","date":"2021-02-03","arxiv_id":"2102.01868","repositories_listed":1,"syntology":null},{"url":"/paper/leave-no-user-behind-towards-improving-the","slug":"leave-no-user-behind-towards-improving-the","title":"Leave No User Behind: Towards Improving the Utility of Recommender Systems for Non-mainstream Users","date":"2021-02-02","arxiv_id":"2102.01744","repositories_listed":1,"syntology":null},{"url":"/paper/melon-playlist-dataset-a-public-dataset-for","slug":"melon-playlist-dataset-a-public-dataset-for","title":"Melon Playlist Dataset: a public dataset for audio-based playlist generation and music tagging","date":"2021-01-30","arxiv_id":"2102.00201","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-collaborative-filtering","slug":"dynamic-graph-collaborative-filtering","title":"Dynamic Graph Collaborative Filtering","date":"2021-01-08","arxiv_id":"2101.02844","repositories_listed":1,"syntology":null},{"url":"/paper/application-of-knowledge-graphs-to-provide","slug":"application-of-knowledge-graphs-to-provide","title":"Application of Knowledge Graphs to Provide Side Information for Improved Recommendation Accuracy","date":"2021-01-07","arxiv_id":"2101.03054","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-latent-factor-model-for","slug":"probabilistic-latent-factor-model-for","title":"Probabilistic Latent Factor Model for Collaborative Filtering with Bayesian Inference","date":"2020-12-07","arxiv_id":"2012.03433","repositories_listed":1,"syntology":null},{"url":"/paper/trading-personalization-for-accuracy-data","slug":"trading-personalization-for-accuracy-data","title":"Trading Personalization for Accuracy: Data Debugging in Collaborative Filtering","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unbiasing-review-ratings-with-tendency-based","slug":"unbiasing-review-ratings-with-tendency-based","title":"Unbiasing Review Ratings with Tendency Based Collaborative Filtering","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improvement-of-e-commerce-recommendation","slug":"improvement-of-e-commerce-recommendation","title":"Improvement of e-commerce recommendation systems with deep hybrid collaborative filtering with content: A case study","date":"2020-11-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-multimodal-information-from","slug":"exploring-the-multimodal-information-from","title":"The complementarity of a diverse range of deep learning features extracted from video content for video recommendation","date":"2020-11-21","arxiv_id":"2011.10834","repositories_listed":1,"syntology":null},{"url":"/paper/interest-sustainability-aware-recommender","slug":"interest-sustainability-aware-recommender","title":"Interest Sustainability-Aware Recommender System","date":"2020-11-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deoscillated-graph-collaborative-filtering","slug":"deoscillated-graph-collaborative-filtering","title":"Deoscillated Graph Collaborative Filtering","date":"2020-11-04","arxiv_id":"2011.02100","repositories_listed":1,"syntology":null},{"url":"/paper/recbole-towards-a-unified-comprehensive-and","slug":"recbole-towards-a-unified-comprehensive-and","title":"RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithms","date":"2020-11-03","arxiv_id":"2011.01731","repositories_listed":1,"syntology":null},{"url":"/paper/on-offline-evaluation-of-recommender-systems","slug":"on-offline-evaluation-of-recommender-systems","title":"A Critical Study on Data Leakage in Recommender System Offline Evaluation","date":"2020-10-21","arxiv_id":"2010.11060","repositories_listed":1,"syntology":null},{"url":"/paper/on-application-of-block-kaczmarz-methods-in","slug":"on-application-of-block-kaczmarz-methods-in","title":"On Application of Block Kaczmarz Methods in Matrix Factorization","date":"2020-10-20","arxiv_id":"2010.10635","repositories_listed":1,"syntology":null},{"url":"/paper/modurec-recommender-systems-with-feature-and","slug":"modurec-recommender-systems-with-feature-and","title":"Modurec: Recommender Systems with Feature and Time Modulation","date":"2020-10-13","arxiv_id":"2010.07050","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-collaborative-filtering","slug":"heterogeneous-graph-collaborative-filtering","title":"A Light Heterogeneous Graph Collaborative Filtering Model using Textual Information","date":"2020-10-04","arxiv_id":"2010.07027","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-recommendation-of-wikipedia-articles","slug":"scalable-recommendation-of-wikipedia-articles","title":"Scalable Recommendation of Wikipedia Articles to Editors Using Representation Learning","date":"2020-09-24","arxiv_id":"2009.11771","repositories_listed":1,"syntology":null},{"url":"/paper/uninet-next-term-course-recommendation-using","slug":"uninet-next-term-course-recommendation-using","title":"UniNet: Next Term Course Recommendation using Deep Learning","date":"2020-09-20","arxiv_id":"2009.09326","repositories_listed":1,"syntology":null},{"url":"/paper/rule-guided-graph-neural-networks-for","slug":"rule-guided-graph-neural-networks-for","title":"Rule-Guided Graph Neural Networks for Recommender Systems","date":"2020-09-09","arxiv_id":"2009.04104","repositories_listed":1,"syntology":null},{"url":"/paper/simplify-and-robustify-negative-sampling-for","slug":"simplify-and-robustify-negative-sampling-for","title":"Simplify and Robustify Negative Sampling for Implicit Collaborative Filtering","date":"2020-09-07","arxiv_id":"2009.03376","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-model-based-collaborative-filtering","slug":"efficient-model-based-collaborative-filtering","title":"Efficient Model-Based Collaborative Filtering with Fast Adaptive PCA","date":"2020-09-04","arxiv_id":"2009.02251","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-artist-gender-bias-in-music","slug":"exploring-artist-gender-bias-in-music","title":"Exploring Artist Gender Bias in Music Recommendation","date":"2020-09-03","arxiv_id":"2009.01715","repositories_listed":1,"syntology":null},{"url":"/paper/theoretical-modeling-of-the-iterative","slug":"theoretical-modeling-of-the-iterative","title":"Theoretical Modeling of the Iterative Properties of User Discovery in a Collaborative Filtering Recommender System","date":"2020-08-21","arxiv_id":"2008.13526","repositories_listed":1,"syntology":null},{"url":"/paper/joint-variational-autoencoders-for","slug":"joint-variational-autoencoders-for","title":"Joint Variational Autoencoders for Recommendation with Implicit Feedback","date":"2020-08-17","arxiv_id":"2008.07577","repositories_listed":1,"syntology":null},{"url":"/paper/performance-of-hyperbolic-geometry-models-on","slug":"performance-of-hyperbolic-geometry-models-on","title":"Performance of Hyperbolic Geometry Models on Top-N Recommendation Tasks","date":"2020-08-15","arxiv_id":"2008.06716","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/performance-of-hyperbolic-geometry-models-on#ran","syntology_url":"https://syntology.ai/paper/2008.06716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06716"}},"official":{"repos":["evfro/HyperbolicRecommenders"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-relational-matrix-completion","slug":"inductive-relational-matrix-completion","title":"Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach","date":"2020-07-09","arxiv_id":"2007.04833","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/inductive-relational-matrix-completion#ran","syntology_url":"https://syntology.ai/paper/2007.04833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04833"}},"official":{"repos":["qitianwu/IDCF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rgcf-refined-graph-convolution-collaborative","slug":"rgcf-refined-graph-convolution-collaborative","title":"RGCF: Refined Graph Convolution Collaborative Filtering with concise and expressive embedding","date":"2020-07-07","arxiv_id":"2007.03383","repositories_listed":1,"syntology":null},{"url":"/paper/neural-interactive-collaborative-filtering","slug":"neural-interactive-collaborative-filtering","title":"Neural Interactive Collaborative Filtering","date":"2020-07-04","arxiv_id":"2007.02095","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-collaborative-filtering-by","slug":"semi-supervised-collaborative-filtering-by","title":"Semi-supervised Collaborative Filtering by Text-enhanced Domain Adaptation","date":"2020-06-28","arxiv_id":"2007.07085","repositories_listed":1,"syntology":null},{"url":"/paper/providing-reliability-in-recommender-systems","slug":"providing-reliability-in-recommender-systems","title":"Providing reliability in Recommender Systems through Bernoulli Matrix Factorization","date":"2020-06-05","arxiv_id":"2006.03481","repositories_listed":1,"syntology":null},{"url":"/paper/content-aware-neural-hashing-for-cold-start","slug":"content-aware-neural-hashing-for-cold-start","title":"Content-aware Neural Hashing for Cold-start Recommendation","date":"2020-05-31","arxiv_id":"2006.00617","repositories_listed":1,"syntology":null},{"url":"/paper/seamlessly-unifying-attributes-and-items","slug":"seamlessly-unifying-attributes-and-items","title":"Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users","date":"2020-05-23","arxiv_id":"2005.12979","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-machine-learning-in-recommender","slug":"adversarial-machine-learning-in-recommender","title":"A survey on Adversarial Recommender Systems: from Attack/Defense strategies to Generative Adversarial Networks","date":"2020-05-20","arxiv_id":"2005.10322","repositories_listed":1,"syntology":null},{"url":"/paper/utilizing-fasttext-for-venue-recommendation","slug":"utilizing-fasttext-for-venue-recommendation","title":"Utilizing FastText for Venue Recommendation","date":"2020-05-14","arxiv_id":"2005.12982","repositories_listed":1,"syntology":null},{"url":"/paper/ract-toward-amortized-ranking-critical","slug":"ract-toward-amortized-ranking-critical","title":"RaCT: Toward Amortized Ranking-Critical Training For Collaborative Filtering","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/conditioned-variational-autoencoder-for-top-n","slug":"conditioned-variational-autoencoder-for-top-n","title":"Conditioned Variational Autoencoder for top-N item recommendation","date":"2020-04-16","arxiv_id":"2004.11141","repositories_listed":1,"syntology":null},{"url":"/paper/inference-in-the-stochastic-block-model-with","slug":"inference-in-the-stochastic-block-model-with","title":"Reliable Time Prediction in the Markov Stochastic Block Model","date":"2020-04-09","arxiv_id":"2004.04402","repositories_listed":1,"syntology":null},{"url":"/paper/uncovering-the-data-related-limits-of-human","slug":"uncovering-the-data-related-limits-of-human","title":"Uncovering the Data-Related Limits of Human Reasoning Research: An Analysis based on Recommender Systems","date":"2020-03-11","arxiv_id":"2003.05196","repositories_listed":1,"syntology":null},{"url":"/paper/price-aware-recommendation-with-graph","slug":"price-aware-recommendation-with-graph","title":"Price-aware Recommendation with Graph Convolutional Networks","date":"2020-03-09","arxiv_id":"2003.03975","repositories_listed":1,"syntology":null},{"url":"/paper/advances-in-collaborative-filtering-and","slug":"advances-in-collaborative-filtering-and","title":"Advances in Collaborative Filtering and Ranking","date":"2020-02-27","arxiv_id":"2002.12312","repositories_listed":1,"syntology":null},{"url":"/paper/cata-a-collaborative-dual-attentive","slug":"cata-a-collaborative-dual-attentive","title":"CATA++: A Collaborative Dual Attentive Autoencoder Method for Recommending Scientific Articles","date":"2020-02-27","arxiv_id":"2002.12277","repositories_listed":1,"syntology":null},{"url":"/paper/hotelrec-a-novel-very-large-scale-hotel","slug":"hotelrec-a-novel-very-large-scale-hotel","title":"HotelRec: a Novel Very Large-Scale Hotel Recommendation Dataset","date":"2020-02-17","arxiv_id":"2002.06854","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolution-machine-for-context-aware","slug":"graph-convolution-machine-for-context-aware","title":"Graph Convolution Machine for Context-aware Recommender System","date":"2020-01-30","arxiv_id":"2001.11402","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-yield-performance-of-parents-in","slug":"predicting-yield-performance-of-parents-in","title":"Predicting Yield Performance of Parents in Plant Breeding: A Neural Collaborative Filtering Approach","date":"2020-01-27","arxiv_id":"2001.09902","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-semantic-recommender-system-for","slug":"hybrid-semantic-recommender-system-for","title":"Hybrid Semantic Recommender System for Chemical Compounds","date":"2020-01-21","arxiv_id":"2001.07440","repositories_listed":1,"syntology":null},{"url":"/paper/unifying-paragraph-embeddings-and-neural","slug":"unifying-paragraph-embeddings-and-neural","title":"Unifying paragraph embeddings and neural collaborative filtering for hybrid recommendation","date":"2020-01-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/basconv-aggregating-heterogeneous","slug":"basconv-aggregating-heterogeneous","title":"BasConv: Aggregating Heterogeneous Interactions for Basket Recommendation with Graph Convolutional Neural Network","date":"2020-01-14","arxiv_id":"2001.09900","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-marketing-bias-in-product","slug":"addressing-marketing-bias-in-product","title":"Addressing Marketing Bias in Product Recommendations","date":"2019-12-04","arxiv_id":"1912.01799","repositories_listed":1,"syntology":null},{"url":"/paper/multi-component-graph-convolutional","slug":"multi-component-graph-convolutional","title":"Multi-Component Graph Convolutional Collaborative Filtering","date":"2019-11-25","arxiv_id":"1911.10699","repositories_listed":1,"syntology":null},{"url":"/paper/a-troubling-analysis-of-reproducibility-and","slug":"a-troubling-analysis-of-reproducibility-and","title":"A Troubling Analysis of Reproducibility and Progress in Recommender Systems Research","date":"2019-11-18","arxiv_id":"1911.07698","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-vaes-for-collaborative-filtering","slug":"enhancing-vaes-for-collaborative-filtering","title":"Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms","date":"2019-11-03","arxiv_id":"1911.00936","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-preference-embedding-against","slug":"collaborative-preference-embedding-against","title":"Collaborative Preference Embedding against Sparse Labels","date":"2019-10-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/markov-random-fields-for-collaborative","slug":"markov-random-fields-for-collaborative","title":"Markov Random Fields for Collaborative Filtering","date":"2019-10-21","arxiv_id":"1910.09645","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-filtering-with-label-consistent","slug":"collaborative-filtering-with-label-consistent","title":"Collaborative Filtering with Label Consistent Restricted Boltzmann Machine","date":"2019-10-17","arxiv_id":"1910.07724","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-vector-spaces-compact-data","slug":"beyond-vector-spaces-compact-data","title":"Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs","date":"2019-10-08","arxiv_id":"1910.03524","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-interpretability-into-latent","slug":"incorporating-interpretability-into-latent","title":"Incorporating Interpretability into Latent Factor Models via Fast Influence Analysis","date":"2019-08-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/completing-partial-recipes-using-item-based","slug":"completing-partial-recipes-using-item-based","title":"Completing partial recipes using item-based collaborative filtering to recommend ingredients","date":"2019-07-23","arxiv_id":"1907.12380","repositories_listed":1,"syntology":null},{"url":"/paper/holographic-factorization-machines-for","slug":"holographic-factorization-machines-for","title":"Holographic Factorization Machines for Recommendation","date":"2019-07-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modeling-embedding-dimension-correlations-via","slug":"modeling-embedding-dimension-correlations-via","title":"Modeling Embedding Dimension Correlations via Convolutional Neural Collaborative Filtering","date":"2019-06-26","arxiv_id":"1906.11171","repositories_listed":1,"syntology":null},{"url":"/paper/seer-an-explainable-deep-learning-midi-based","slug":"seer-an-explainable-deep-learning-midi-based","title":"SeER: An Explainable Deep Learning MIDI-based Hybrid Song Recommender System","date":"2019-06-25","arxiv_id":"1907.01640","repositories_listed":1,"syntology":null},{"url":"/paper/coupled-variational-recurrent-collaborative","slug":"coupled-variational-recurrent-collaborative","title":"Coupled Variational Recurrent Collaborative Filtering","date":"2019-06-11","arxiv_id":"1906.04386","repositories_listed":1,"syntology":null},{"url":"/paper/towards-amortized-ranking-critical-training","slug":"towards-amortized-ranking-critical-training","title":"Towards Amortized Ranking-Critical Training for Collaborative Filtering","date":"2019-06-10","arxiv_id":"1906.04281","repositories_listed":1,"syntology":null}],"record_sha256":"2be439fed5e3127df566273570a13b72fb117012fa886aace2f6dc9b93ecf0c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}