{"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/recommendation-systems/papers/18","list_of":"/task/recommendation-systems","task":"Recommendation Systems","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":18,"pages_in_order":61,"rows_per_page":100,"rows":[1701,1800],"of":6047,"counts":{"archive_papers_tagged":6047,"with_a_code_link":1997,"where_syntology_ran_a_sample":330,"not_listed_spam_title":0,"listed":6047,"listed_where_code_ran":330,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":280,"every_run_a_failure_of_syntologys_instrument":50,"listed_with_a_run_with_no_instrument_failure":280,"listed_every_run_a_failure_of_syntologys_instrument":50,"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/recommendation-systems","prev":"/task/recommendation-systems/papers/17","next":"/task/recommendation-systems/papers/19","papers":[{"url":"/paper/information-theoretic-counterfactual-learning","slug":"information-theoretic-counterfactual-learning","title":"Information Theoretic Counterfactual Learning from Missing-Not-At-Random Feedback","date":"2020-09-06","arxiv_id":"2009.02623","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/information-theoretic-counterfactual-learning#ran","syntology_url":"https://syntology.ai/paper/2009.02623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02623"}},"official":{"repos":["RyanWangZf/CVIB-Rec"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/about-graph-degeneracy-representation","slug":"about-graph-degeneracy-representation","title":"About Graph Degeneracy, Representation Learning and Scalability","date":"2020-09-04","arxiv_id":"2009.02085","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/time-based-sequence-model-for-personalization","slug":"time-based-sequence-model-for-personalization","title":"Time-based Sequence Model for Personalization and Recommendation Systems","date":"2020-08-27","arxiv_id":"2008.11922","repositories_listed":1,"syntology":null},{"url":"/paper/buy-me-that-look-an-approach-for-recommending","slug":"buy-me-that-look-an-approach-for-recommending","title":"Buy Me That Look: An Approach for Recommending Similar Fashion Products","date":"2020-08-26","arxiv_id":"2008.11638","repositories_listed":1,"syntology":null},{"url":"/paper/graphsail-graph-structure-aware-incremental","slug":"graphsail-graph-structure-aware-incremental","title":"GraphSAIL: Graph Structure Aware Incremental Learning for Recommender Systems","date":"2020-08-25","arxiv_id":"2008.13517","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphsail-graph-structure-aware-incremental#ran","syntology_url":"https://syntology.ai/paper/2008.13517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13517"}},"official":{"repos":["mmvv11/GraphSAIL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-baseline-analysis-for-podcast-abstractive","slug":"a-baseline-analysis-for-podcast-abstractive","title":"A Baseline Analysis for Podcast Abstractive Summarization","date":"2020-08-24","arxiv_id":"2008.10648","repositories_listed":1,"syntology":null},{"url":"/paper/table2charts-learning-shared-representations","slug":"table2charts-learning-shared-representations","title":"Table2Charts: Recommending Charts by Learning Shared Table Representations","date":"2020-08-24","arxiv_id":"2008.11015","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-recommending-accurate-and","slug":"a-framework-for-recommending-accurate-and","title":"A Framework for Recommending Accurate and Diverse ItemsUsing Bayesian Graph Convolutional Neural Networks","date":"2020-08-23","arxiv_id":null,"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/auto-surprise-an-automated-recommender-system","slug":"auto-surprise-an-automated-recommender-system","title":"Auto-Surprise: An Automated Recommender-System (AutoRecSys) Library with Tree of Parzens Estimator (TPE) Optimization","date":"2020-08-19","arxiv_id":"2008.13532","repositories_listed":1,"syntology":null},{"url":"/paper/fast-approximate-bayesian-contextual-cold","slug":"fast-approximate-bayesian-contextual-cold","title":"Fast Approximate Bayesian Contextual Cold Start Learning (FAB-COST)","date":"2020-08-18","arxiv_id":"2008.08038","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-longitudinal-effects-of-session","slug":"exploring-longitudinal-effects-of-session","title":"Exploring Longitudinal Effects of Session-based Recommendations","date":"2020-08-17","arxiv_id":"2008.07226","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-adversarially-learned-injection","slug":"revisiting-adversarially-learned-injection","title":"Revisiting Adversarially Learned Injection Attacks Against Recommender Systems","date":"2020-08-11","arxiv_id":"2008.04876","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-large-scale-machine-learning","slug":"a-survey-on-large-scale-machine-learning","title":"A Survey on Large-scale Machine Learning","date":"2020-08-10","arxiv_id":"2008.03911","repositories_listed":1,"syntology":null},{"url":"/paper/path-based-reasoning-over-heterogeneous","slug":"path-based-reasoning-over-heterogeneous","title":"Path-Based Reasoning over Heterogeneous Networks for Recommendation via Bidirectional Modeling","date":"2020-08-10","arxiv_id":"2008.04185","repositories_listed":1,"syntology":null},{"url":"/paper/partially-synthetic-data-for-recommender","slug":"partially-synthetic-data-for-recommender","title":"Partially Synthetic Data for Recommender Systems: Prediction Performance and Preference Hiding","date":"2020-08-09","arxiv_id":"2008.03797","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-aware-online-personalization","slug":"fairness-aware-online-personalization","title":"Fairness-Aware Online Personalization","date":"2020-07-30","arxiv_id":"2007.15270","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-contextual-team-aware-item","slug":"interpretable-contextual-team-aware-item","title":"Interpretable Contextual Team-aware Item Recommendation: Application in Multiplayer Online Battle Arena Games","date":"2020-07-30","arxiv_id":"2007.15236","repositories_listed":1,"syntology":null},{"url":"/paper/new-approach-to-mpi-program-execution-time","slug":"new-approach-to-mpi-program-execution-time","title":"New approach to MPI program execution time prediction","date":"2020-07-30","arxiv_id":"2007.15338","repositories_listed":1,"syntology":null},{"url":"/paper/what-does-bert-know-about-books-movies-and","slug":"what-does-bert-know-about-books-movies-and","title":"What does BERT know about books, movies and music? Probing BERT for Conversational Recommendation","date":"2020-07-30","arxiv_id":"2007.15356","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-evaluation-of-slate","slug":"counterfactual-evaluation-of-slate","title":"Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactions","date":"2020-07-25","arxiv_id":"2007.12986","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-learning-for-deep-models-in","slug":"self-supervised-learning-for-deep-models-in","title":"Self-supervised Learning for Large-scale Item Recommendations","date":"2020-07-25","arxiv_id":"2007.12865","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 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) · 1 unverified","sample_list":"/paper/self-supervised-learning-for-deep-models-in#ran","syntology_url":"https://syntology.ai/paper/2007.12865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12865"}},"official":null}},{"url":"/paper/personalised-visual-art-recommendation-by","slug":"personalised-visual-art-recommendation-by","title":"Personalised Visual Art Recommendation by Learning Latent Semantic Representations","date":"2020-07-24","arxiv_id":"2008.02687","repositories_listed":1,"syntology":null},{"url":"/paper/positive-semidefinite-matrix-factorization-a","slug":"positive-semidefinite-matrix-factorization-a","title":"Positive Semidefinite Matrix Factorization: A Connection with Phase Retrieval and Affine Rank Minimization","date":"2020-07-24","arxiv_id":"2007.12364","repositories_listed":1,"syntology":null},{"url":"/paper/critically-examining-the-claimed-value-of","slug":"critically-examining-the-claimed-value-of","title":"Critically Examining the Claimed Value of Convolutions over User-Item Embedding Maps for Recommender Systems","date":"2020-07-23","arxiv_id":"2007.11893","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-link-prediction-via-graph-neural","slug":"few-shot-link-prediction-via-graph-neural","title":"Few-shot link prediction via graph neural networks for Covid-19 drug-repurposing","date":"2020-07-20","arxiv_id":"2007.10261","repositories_listed":1,"syntology":null},{"url":"/paper/fgrec-a-fine-grained-point-of-interest","slug":"fgrec-a-fine-grained-point-of-interest","title":"FGRec: A Fine-Grained Point-of-Interest Recommendation Framework by Capturing Intrinsic Influences","date":"2020-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-retrieval-an-end-to-end-learnable","slug":"deep-retrieval-an-end-to-end-learnable","title":"Deep Retrieval: Learning A Retrievable Structure for Large-Scale Recommendations","date":"2020-07-12","arxiv_id":"2007.07203","repositories_listed":1,"syntology":null},{"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/mamo-memory-augmented-meta-optimization-for","slug":"mamo-memory-augmented-meta-optimization-for","title":"MAMO: Memory-Augmented Meta-Optimization for Cold-start Recommendation","date":"2020-07-07","arxiv_id":"2007.03183","repositories_listed":1,"syntology":null},{"url":"/paper/gag-global-attributed-graph-neural-network","slug":"gag-global-attributed-graph-neural-network","title":"GAG: Global Attributed Graph Neural Network for Streaming Session-based Recommendation","date":"2020-07-06","arxiv_id":"2007.02747","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gag-global-attributed-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2007.02747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02747"}},"official":{"repos":["RuihongQiu/GAG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-personalized-risk-preferences-for","slug":"learning-personalized-risk-preferences-for","title":"Learning Personalized Risk Preferences for Recommendation","date":"2020-07-06","arxiv_id":"2007.02478","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-echo-chambers-in-e-commerce","slug":"understanding-echo-chambers-in-e-commerce","title":"Understanding Echo Chambers in E-commerce Recommender Systems","date":"2020-07-06","arxiv_id":"2007.02474","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/an-efficient-neighborhood-based-interaction","slug":"an-efficient-neighborhood-based-interaction","title":"An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph","date":"2020-07-01","arxiv_id":"2007.00216","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 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) · 1 unverified","sample_list":"/paper/an-efficient-neighborhood-based-interaction#ran","syntology_url":"https://syntology.ai/paper/2007.00216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00216"}},"official":null}},{"url":"/paper/multi-sided-exposure-bias-in-recommendation","slug":"multi-sided-exposure-bias-in-recommendation","title":"Multi-sided Exposure Bias in Recommendation","date":"2020-06-29","arxiv_id":"2006.15772","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/learning-optimal-tree-models-under-beam","slug":"learning-optimal-tree-models-under-beam","title":"Learning Optimal Tree Models Under Beam Search","date":"2020-06-27","arxiv_id":"2006.15408","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-optimal-tree-models-under-beam#ran","syntology_url":"https://syntology.ai/paper/2006.15408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15408"}},"official":null}},{"url":"/paper/autorec-an-automated-recommender-system","slug":"autorec-an-automated-recommender-system","title":"AutoRec: An Automated Recommender System","date":"2020-06-26","arxiv_id":"2007.07224","repositories_listed":1,"syntology":null},{"url":"/paper/direct-feedback-alignment-scales-to-modern","slug":"direct-feedback-alignment-scales-to-modern","title":"Direct Feedback Alignment Scales to Modern Deep Learning Tasks and Architectures","date":"2020-06-23","arxiv_id":"2006.12878","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 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) · 5 unverified","sample_list":"/paper/direct-feedback-alignment-scales-to-modern#ran","syntology_url":"https://syntology.ai/paper/2006.12878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12878"}},"official":{"repos":["lightonai/dfa-scales-to-modern-deep-learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-factorization-machines-with","slug":"enhancing-factorization-machines-with","title":"Enhancing Factorization Machines with Generalized Metric Learning","date":"2020-06-20","arxiv_id":"2006.11600","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-gaussian-embeddings-for","slug":"convolutional-gaussian-embeddings-for","title":"Convolutional Gaussian Embeddings for Personalized Recommendation with Uncertainty","date":"2020-06-19","arxiv_id":"2006.10932","repositories_listed":1,"syntology":null},{"url":"/paper/feature-interaction-interpretability-a-case","slug":"feature-interaction-interpretability-a-case","title":"Feature Interaction Interpretability: A Case for Explaining Ad-Recommendation Systems via Neural Interaction Detection","date":"2020-06-19","arxiv_id":"2006.10966","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-conversational-recommender-systems","slug":"evaluating-conversational-recommender-systems","title":"Evaluating Conversational Recommender Systems via User Simulation","date":"2020-06-15","arxiv_id":"2006.08732","repositories_listed":1,"syntology":null},{"url":"/paper/robust-recursive-partitioning-for","slug":"robust-recursive-partitioning-for","title":"Robust Recursive Partitioning for Heterogeneous Treatment Effects with Uncertainty Quantification","date":"2020-06-14","arxiv_id":"2006.07917","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-factorization-for-rank-minimization","slug":"low-rank-factorization-for-rank-minimization","title":"Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers","date":"2020-06-13","arxiv_id":"2006.07702","repositories_listed":1,"syntology":null},{"url":"/paper/fgcrec-fine-grained-geographical","slug":"fgcrec-fine-grained-geographical","title":"FGCRec: Fine-Grained Geographical Characteristics Modeling for Point-of-Interest Recommendation","date":"2020-06-07","arxiv_id":null,"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/variational-quantum-singular-value","slug":"variational-quantum-singular-value","title":"Variational Quantum Singular Value Decomposition","date":"2020-06-03","arxiv_id":"2006.02336","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-item-promotion-vulnerabilities-at","slug":"adversarial-item-promotion-vulnerabilities-at","title":"Adversarial Item Promotion: Vulnerabilities at the Core of Top-N Recommenders that Use Images to Address Cold Start","date":"2020-06-02","arxiv_id":"2006.01888","repositories_listed":1,"syntology":null},{"url":"/paper/ordinal-non-negative-matrix-factorization-for","slug":"ordinal-non-negative-matrix-factorization-for","title":"Ordinal Non-negative Matrix Factorization for Recommendation","date":"2020-06-01","arxiv_id":"2006.01034","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/predicting-engagement-in-video-lectures","slug":"predicting-engagement-in-video-lectures","title":"Predicting Engagement in Video Lectures","date":"2020-05-31","arxiv_id":"2006.00592","repositories_listed":1,"syntology":null},{"url":"/paper/a-re-visit-of-the-popularity-baseline-in","slug":"a-re-visit-of-the-popularity-baseline-in","title":"A Re-visit of the Popularity Baseline in Recommender Systems","date":"2020-05-28","arxiv_id":"2005.13829","repositories_listed":1,"syntology":null},{"url":"/paper/towards-question-based-recommender-systems","slug":"towards-question-based-recommender-systems","title":"Towards Question-based Recommender Systems","date":"2020-05-28","arxiv_id":"2005.14255","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-retrain-recommender-system-a","slug":"how-to-retrain-recommender-system-a","title":"How to Retrain Recommender System? A Sequential Meta-Learning Method","date":"2020-05-27","arxiv_id":"2005.13258","repositories_listed":1,"syntology":null},{"url":"/paper/mvin-learning-multiview-items-for","slug":"mvin-learning-multiview-items-for","title":"MVIN: Learning Multiview Items for Recommendation","date":"2020-05-26","arxiv_id":"2005.12516","repositories_listed":1,"syntology":null},{"url":"/paper/how-useful-are-reviews-for-recommendation-a","slug":"how-useful-are-reviews-for-recommendation-a","title":"How Useful are Reviews for Recommendation? A Critical Review and Potential Improvements","date":"2020-05-25","arxiv_id":"2005.12210","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/how-useful-are-reviews-for-recommendation-a#ran","syntology_url":"https://syntology.ai/paper/2005.12210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.12210"}},"official":{"repos":["noveens/reviews4rec"],"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/catn-cross-domain-recommendation-for-cold","slug":"catn-cross-domain-recommendation-for-cold","title":"CATN: Cross-Domain Recommendation for Cold-Start Users via Aspect Transfer Network","date":"2020-05-21","arxiv_id":"2005.10549","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/gcn-based-user-representation-learning-for","slug":"gcn-based-user-representation-learning-for","title":"GCN-Based User Representation Learning for Unifying Robust Recommendation and Fraudster Detection","date":"2020-05-20","arxiv_id":"2005.10150","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gcn-based-user-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/2005.10150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10150"}},"official":null}},{"url":"/paper/m2grl-a-multi-task-multi-view-graph","slug":"m2grl-a-multi-task-multi-view-graph","title":"M2GRL: A Multi-task Multi-view Graph Representation Learning Framework for Web-scale Recommender Systems","date":"2020-05-20","arxiv_id":"2005.10110","repositories_listed":1,"syntology":null},{"url":"/paper/attacking-black-box-recommendations-via","slug":"attacking-black-box-recommendations-via","title":"Attacking Black-box Recommendations via Copying Cross-domain User Profiles","date":"2020-05-17","arxiv_id":"2005.08147","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/cornac-a-comparative-framework-for-multimodal","slug":"cornac-a-comparative-framework-for-multimodal","title":"Cornac: A Comparative Framework for Multimodal Recommender Systems","date":"2020-05-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stealing-links-from-graph-neural-networks","slug":"stealing-links-from-graph-neural-networks","title":"Stealing Links from Graph Neural Networks","date":"2020-05-05","arxiv_id":"2005.02131","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stealing-links-from-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.02131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02131"}},"official":null}},{"url":"/paper/human-strategic-steering-improves-performance","slug":"human-strategic-steering-improves-performance","title":"Human Strategic Steering Improves Performance of Interactive Optimization","date":"2020-05-04","arxiv_id":"2005.01291","repositories_listed":1,"syntology":null},{"url":"/paper/cmnrec-sequential-recommendations-with-chunk","slug":"cmnrec-sequential-recommendations-with-chunk","title":"CmnRec: Sequential Recommendations with Chunk-accelerated Memory Network","date":"2020-04-28","arxiv_id":"2004.13401","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-clustering-of-bipartite-data","slug":"hierarchical-clustering-of-bipartite-data","title":"Hierarchical clustering of bipartite data sets based on the statistical significance of coincidences","date":"2020-04-27","arxiv_id":"2004.14764","repositories_listed":1,"syntology":null},{"url":"/paper/a-generic-network-compression-framework-for","slug":"a-generic-network-compression-framework-for","title":"A Generic Network Compression Framework for Sequential Recommender Systems","date":"2020-04-21","arxiv_id":"2004.13139","repositories_listed":1,"syntology":null},{"url":"/paper/lightrec-a-memory-and-search-efficient","slug":"lightrec-a-memory-and-search-efficient","title":"Lightrec: A memory and search-efficient recommender system","date":"2020-04-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/recommendation-system-using-a-deep-learning","slug":"recommendation-system-using-a-deep-learning","title":"Recommendation system using a deep learning and graph analysis approach","date":"2020-04-17","arxiv_id":"2004.08100","repositories_listed":1,"syntology":null},{"url":"/paper/a-text-based-deep-reinforcement-learning","slug":"a-text-based-deep-reinforcement-learning","title":"A Text-based Deep Reinforcement Learning Framework for Interactive Recommendation","date":"2020-04-14","arxiv_id":"2004.06651","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-learning-for-dynamic-model-type","slug":"multi-label-learning-for-dynamic-model-type","title":"Multi-label learning for dynamic model type recommendation","date":"2020-04-01","arxiv_id":"2004.00558","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/explanation-based-tuning-of-opaque-machine","slug":"explanation-based-tuning-of-opaque-machine","title":"LIMEADE: From AI Explanations to Advice Taking","date":"2020-03-09","arxiv_id":"2003.04315","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/graphs-convolutions-and-neural-networks","slug":"graphs-convolutions-and-neural-networks","title":"Graphs, Convolutions, and Neural Networks: From Graph Filters to Graph Neural Networks","date":"2020-03-08","arxiv_id":"2003.03777","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/debayes-a-bayesian-method-for-debiasing","slug":"debayes-a-bayesian-method-for-debiasing","title":"DeBayes: a Bayesian Method for Debiasing Network Embeddings","date":"2020-02-26","arxiv_id":"2002.11442","repositories_listed":1,"syntology":null},{"url":"/paper/setrank-a-setwise-bayesian-approach-for","slug":"setrank-a-setwise-bayesian-approach-for","title":"SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback","date":"2020-02-23","arxiv_id":"2002.09841","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/setrank-a-setwise-bayesian-approach-for#ran","syntology_url":"https://syntology.ai/paper/2002.09841","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09841"}},"official":{"repos":["chadwang2012/SetRank"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/higher-order-label-homogeneity-and-spreading","slug":"higher-order-label-homogeneity-and-spreading","title":"Higher-Order Label Homogeneity and Spreading in Graphs","date":"2020-02-18","arxiv_id":"2002.07833","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/towards-explainable-personalized","slug":"towards-explainable-personalized","title":"Towards explainable personalized recommendations by learning from users’ photos","date":"2020-02-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/discovering-mathematical-objects-of-interest","slug":"discovering-mathematical-objects-of-interest","title":"Discovering Mathematical Objects of Interest -- A Study of Mathematical Notations","date":"2020-02-07","arxiv_id":"2002.02712","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/supervised-learning-for-non-sequential-data","slug":"supervised-learning-for-non-sequential-data","title":"Supervised Learning for Non-Sequential Data: A Canonical Polyadic Decomposition Approach","date":"2020-01-27","arxiv_id":"2001.10109","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-error-and-bias-in-offline","slug":"estimating-error-and-bias-in-offline","title":"Estimating Error and Bias in Offline Evaluation Results","date":"2020-01-26","arxiv_id":"2001.09455","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/recommending-themes-for-ad-creative-design","slug":"recommending-themes-for-ad-creative-design","title":"Recommending Themes for Ad Creative Design via Visual-Linguistic Representations","date":"2020-01-20","arxiv_id":"2001.07194","repositories_listed":1,"syntology":null},{"url":"/paper/eev-dataset-predicting-expressions-evoked-by","slug":"eev-dataset-predicting-expressions-evoked-by","title":"EEV: A Large-Scale Dataset for Studying Evoked Expressions from Video","date":"2020-01-15","arxiv_id":"2001.05488","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-user-actions-in-recommender","slug":"heterogeneous-user-actions-in-recommender","title":"Heterogeneous User Actions in Recommender Systems","date":"2020-01-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/parameter-efficient-transfer-from-sequential","slug":"parameter-efficient-transfer-from-sequential","title":"Parameter-Efficient Transfer from Sequential Behaviors for User Modeling and Recommendation","date":"2020-01-13","arxiv_id":"2001.04253","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-multi-relational-attention-network","slug":"attributed-multi-relational-attention-network","title":"Attributed Multi-Relational Attention Network for Fact-checking URL Recommendation","date":"2020-01-07","arxiv_id":"2001.02214","repositories_listed":1,"syntology":null},{"url":"/paper/ranking-news-feed-updates-on-social-media-a","slug":"ranking-news-feed-updates-on-social-media-a","title":"Ranking news feed updates on social media: A comparative study of supervised models","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/chameleon-a-deep-learning-meta-architecture","slug":"chameleon-a-deep-learning-meta-architecture","title":"CHAMELEON: A Deep Learning Meta-Architecture for News Recommender Systems [Phd. Thesis]","date":"2019-12-29","arxiv_id":"2001.04831","repositories_listed":1,"syntology":null},{"url":"/paper/memory-augmented-graph-neural-networks-for","slug":"memory-augmented-graph-neural-networks-for","title":"Memory Augmented Graph Neural Networks for Sequential Recommendation","date":"2019-12-26","arxiv_id":"1912.11730","repositories_listed":1,"syntology":null},{"url":"/paper/carec-content-aware-point-of-interest","slug":"carec-content-aware-point-of-interest","title":"CARec: Content-Aware Point-of-Interest Recommendation via Adaptive Bayesian Personalized Ranking","date":"2019-12-09","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"82fc73a200ec10438ba690c3ed76f44302b483bbd820dfb4179b1078bb174458","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}