{"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/19","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":19,"pages_in_order":61,"rows_per_page":100,"rows":[1801,1900],"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/18","next":"/task/recommendation-systems/papers/20","papers":[{"url":"/paper/multi-gradient-descent-for-multi-objective","slug":"multi-gradient-descent-for-multi-objective","title":"Multi-Gradient Descent for Multi-Objective Recommender Systems","date":"2019-12-09","arxiv_id":"2001.00846","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/a-model-based-reinforcement-learning-with-1","slug":"a-model-based-reinforcement-learning-with-1","title":"A Model-Based Reinforcement Learning with Adversarial Training for Online Recommendation","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/icebreaker-element-wise-efficient-information","slug":"icebreaker-element-wise-efficient-information","title":"Icebreaker: Element-wise Efficient Information Acquisition with a Bayesian Deep Latent Gaussian Model","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-the-item-order-in-session-based","slug":"rethinking-the-item-order-in-session-based","title":"Rethinking the Item Order in Session-based Recommendation with Graph Neural Networks","date":"2019-11-27","arxiv_id":"1911.11942","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/regularized-and-smooth-double-core-tensor","slug":"regularized-and-smooth-double-core-tensor","title":"Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data","date":"2019-11-24","arxiv_id":"1911.10454","repositories_listed":1,"syntology":null},{"url":"/paper/prince-provider-side-interpretability-with","slug":"prince-provider-side-interpretability-with","title":"PRINCE: Provider-side Interpretability with Counterfactual Explanations in Recommender Systems","date":"2019-11-19","arxiv_id":"1911.08378","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/deep-geometric-matrix-completion-are-we-doing-1","slug":"deep-geometric-matrix-completion-are-we-doing-1","title":"Spectral Geometric Matrix Completion","date":"2019-11-17","arxiv_id":"1911.07255","repositories_listed":1,"syntology":null},{"url":"/paper/all-it-takes-is-20-questions-a-knowledge","slug":"all-it-takes-is-20-questions-a-knowledge","title":"All It Takes is 20 Questions!: A Knowledge Graph Based Approach","date":"2019-11-12","arxiv_id":"1911.05161","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/empirical-analysis-of-session-based","slug":"empirical-analysis-of-session-based","title":"Empirical Analysis of Session-Based Recommendation Algorithms","date":"2019-10-28","arxiv_id":"1910.12781","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-accurate-knowledge-aware-document","slug":"fast-and-accurate-knowledge-aware-document","title":"KRED: Knowledge-Aware Document Representation for News Recommendations","date":"2019-10-25","arxiv_id":"1910.11494","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/transferable-recognition-aware-image-1","slug":"transferable-recognition-aware-image-1","title":"Exploring Simple and Transferable Recognition-Aware Image Processing","date":"2019-10-21","arxiv_id":"1910.09185","repositories_listed":1,"syntology":null},{"url":"/paper/jscn-joint-spectral-convolutional-network-for","slug":"jscn-joint-spectral-convolutional-network-for","title":"JSCN: Joint Spectral Convolutional Network for Cross Domain Recommendation","date":"2019-10-18","arxiv_id":"1910.08219","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/bring-your-own-greedymax-near-optimal-12","slug":"bring-your-own-greedymax-near-optimal-12","title":"\"Bring Your Own Greedy\"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack","date":"2019-10-12","arxiv_id":"1910.05646","repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-and-predicting-repeat-food","slug":"characterizing-and-predicting-repeat-food","title":"Characterizing and Predicting Repeat Food Consumption Behavior for Just-in-Time Interventions","date":"2019-09-17","arxiv_id":"1909.07683","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-scholarly-data-by-semantic-query-on","slug":"exploring-scholarly-data-by-semantic-query-on","title":"Exploring Scholarly Data by Semantic Query on Knowledge Graph Embedding Space","date":"2019-09-17","arxiv_id":"1909.08191","repositories_listed":1,"syntology":null},{"url":"/paper/attribute-aware-non-linear-co-embeddings-of","slug":"attribute-aware-non-linear-co-embeddings-of","title":"Attribute-aware non-linear co-embeddings of graph features","date":"2019-09-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/how-to-make-latent-factors-interpretable-by","slug":"how-to-make-latent-factors-interpretable-by","title":"How to make latent factors interpretable by feeding Factorization machines with knowledge graphs","date":"2019-09-11","arxiv_id":"1909.05038","repositories_listed":1,"syntology":null},{"url":"/paper/recsim-a-configurable-simulation-platform-for","slug":"recsim-a-configurable-simulation-platform-for","title":"RecSim: A Configurable Simulation Platform for Recommender Systems","date":"2019-09-11","arxiv_id":"1909.04847","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/recsim-a-configurable-simulation-platform-for#ran","syntology_url":"https://syntology.ai/paper/1909.04847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04847"}},"official":{"repos":["google-research/recsim"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/recommendation-as-a-communication-game-self","slug":"recommendation-as-a-communication-game-self","title":"Recommendation as a Communication Game: Self-Supervised Bot-Play for Goal-oriented Dialogue","date":"2019-09-09","arxiv_id":"1909.03922","repositories_listed":1,"syntology":null},{"url":"/paper/eliminating-bias-in-recommender-systems-via","slug":"eliminating-bias-in-recommender-systems-via","title":"Asymmetric Tri-training for Debiasing Missing-Not-At-Random Explicit Feedback","date":"2019-09-08","arxiv_id":"1910.01444","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/eliminating-bias-in-recommender-systems-via#ran","syntology_url":"https://syntology.ai/paper/1910.01444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01444"}},"official":{"repos":["usaito/asymmetric-tri-rec-real"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/motif-enhanced-recommendation-over","slug":"motif-enhanced-recommendation-over","title":"Motif Enhanced Recommendation over Heterogeneous Information Network","date":"2019-08-26","arxiv_id":"1908.09701","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-probabilistic-matrix-factorization","slug":"scalable-probabilistic-matrix-factorization","title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","date":"2019-08-25","arxiv_id":"1908.09393","repositories_listed":1,"syntology":null},{"url":"/paper/190807738","slug":"190807738","title":"User Diverse Preference Modeling by Multimodal Attentive Metric Learning","date":"2019-08-21","arxiv_id":"1908.07738","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-attention-flow-in-online-video","slug":"estimating-attention-flow-in-online-video","title":"Estimating Attention Flow in Online Video Networks","date":"2019-08-20","arxiv_id":"1908.07123","repositories_listed":1,"syntology":null},{"url":"/paper/towards-knowledge-based-recommender-dialog","slug":"towards-knowledge-based-recommender-dialog","title":"Towards Knowledge-Based Recommender Dialog System","date":"2019-08-15","arxiv_id":"1908.05391","repositories_listed":1,"syntology":null},{"url":"/paper/with-malice-towards-none-assessing","slug":"with-malice-towards-none-assessing","title":"With Malice Towards None: Assessing Uncertainty via Equalized Coverage","date":"2019-08-15","arxiv_id":"1908.05428","repositories_listed":1,"syntology":null},{"url":"/paper/icebreaker-element-wise-active-information","slug":"icebreaker-element-wise-active-information","title":"Icebreaker: Element-wise Active Information Acquisition with Bayesian Deep Latent Gaussian Model","date":"2019-08-13","arxiv_id":"1908.04537","repositories_listed":1,"syntology":null},{"url":"/paper/bias-disparity-in-collaborative","slug":"bias-disparity-in-collaborative","title":"Bias Disparity in Collaborative Recommendation: Algorithmic Evaluation and Comparison","date":"2019-08-02","arxiv_id":"1908.00831","repositories_listed":1,"syntology":null},{"url":"/paper/pd-gan-adversarial-learning-for-personalized","slug":"pd-gan-adversarial-learning-for-personalized","title":"PD-GAN: Adversarial Learning for Personalized Diversity-Promoting Recommendation","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/melu-meta-learned-user-preference-estimator","slug":"melu-meta-learned-user-preference-estimator","title":"MeLU: Meta-Learned User Preference Estimator for Cold-Start Recommendation","date":"2019-07-31","arxiv_id":"1908.00413","repositories_listed":1,"syntology":null},{"url":"/paper/doubly-robust-lasso-bandit","slug":"doubly-robust-lasso-bandit","title":"Doubly-Robust Lasso Bandit","date":"2019-07-26","arxiv_id":"1907.11362","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/greedy-optimized-multileaving-for","slug":"greedy-optimized-multileaving-for","title":"Greedy Optimized Multileaving for Personalization","date":"2019-07-19","arxiv_id":"1907.08346","repositories_listed":1,"syntology":null},{"url":"/paper/recommender-systems-with-heterogeneous-side","slug":"recommender-systems-with-heterogeneous-side","title":"Recommender Systems with Heterogeneous Side Information","date":"2019-07-18","arxiv_id":"1907.08679","repositories_listed":1,"syntology":null},{"url":"/paper/decentralized-collaborative-ai-on-blockchain","slug":"decentralized-collaborative-ai-on-blockchain","title":"Decentralized & Collaborative AI on Blockchain","date":"2019-07-16","arxiv_id":"1907.07247","repositories_listed":1,"syntology":null},{"url":"/paper/learning-functions-over-sets-via-permutation","slug":"learning-functions-over-sets-via-permutation","title":"Learning Functions over Sets via Permutation Adversarial Networks","date":"2019-07-12","arxiv_id":"1907.05638","repositories_listed":1,"syntology":null},{"url":"/paper/personalised-aesthetics-with-residual-1","slug":"personalised-aesthetics-with-residual-1","title":"Personalised aesthetics with residual adapters","date":"2019-07-08","arxiv_id":"1907.03802","repositories_listed":1,"syntology":null},{"url":"/paper/extraction-and-analysis-of-fictional","slug":"extraction-and-analysis-of-fictional","title":"Extraction and Analysis of Fictional Character Networks: A Survey","date":"2019-07-05","arxiv_id":"1907.02704","repositories_listed":1,"syntology":null},{"url":"/paper/graphdta-prediction-of-drugtarget-binding","slug":"graphdta-prediction-of-drugtarget-binding","title":"GraphDTA: prediction of drug–target binding affinity using graph convolutional networks","date":"2019-07-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-representation-learning-on-large","slug":"adversarial-representation-learning-on-large","title":"Cascade-BGNN: Toward Efficient Self-supervised Representation Learning on Large-scale Bipartite Graphs","date":"2019-06-27","arxiv_id":"1906.11994","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/query-based-interactive-recommendation-by","slug":"query-based-interactive-recommendation-by","title":"Query-based Interactive Recommendation by Meta-Path and Adapted Attention-GRU","date":"2019-06-24","arxiv_id":"1907.01639","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-models-of-human","slug":"reinforcement-learning-models-of-human","title":"A Story of Two Streams: Reinforcement Learning Models from Human Behavior and Neuropsychiatry","date":"2019-06-21","arxiv_id":"1906.11286","repositories_listed":1,"syntology":null},{"url":"/paper/split-q-learning-reinforcement-learning-with","slug":"split-q-learning-reinforcement-learning-with","title":"Split Q Learning: Reinforcement Learning with Two-Stream Rewards","date":"2019-06-21","arxiv_id":"1906.12350","repositories_listed":1,"syntology":null},{"url":"/paper/from-zero-shot-learning-to-cold-start","slug":"from-zero-shot-learning-to-cold-start","title":"From Zero-Shot Learning to Cold-Start Recommendation","date":"2019-06-20","arxiv_id":"1906.08511","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-experimental-design-for","slug":"sequential-experimental-design-for","title":"Sequential Experimental Design for Transductive Linear Bandits","date":"2019-06-20","arxiv_id":"1906.08399","repositories_listed":1,"syntology":null},{"url":"/paper/jaccard-filtration-and-stable-paths-in-the","slug":"jaccard-filtration-and-stable-paths-in-the","title":"Steinhaus Filtration and Stable Paths in the Mapper","date":"2019-06-19","arxiv_id":"1906.08256","repositories_listed":1,"syntology":null},{"url":"/paper/model-explanations-under-calibration","slug":"model-explanations-under-calibration","title":"Model Explanations under Calibration","date":"2019-06-18","arxiv_id":"1906.07622","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-attention-based-look-alike-model","slug":"real-time-attention-based-look-alike-model","title":"Real-time Attention Based Look-alike Model for Recommender System","date":"2019-06-12","arxiv_id":"1906.05022","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},{"url":"/paper/a-meta-learning-recommender-system-for","slug":"a-meta-learning-recommender-system-for","title":"A meta-learning recommender system for hyperparameter tuning: predicting when tuning improves SVM classifiers","date":"2019-06-04","arxiv_id":"1906.01684","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-fashion-recommendation-a-semantic","slug":"explainable-fashion-recommendation-a-semantic","title":"Explainable Fashion Recommendation: A Semantic Attribute Region Guided Approach","date":"2019-05-30","arxiv_id":"1905.12862","repositories_listed":1,"syntology":null},{"url":"/paper/learning-nonsymmetric-determinantal-point","slug":"learning-nonsymmetric-determinantal-point","title":"Learning Nonsymmetric Determinantal Point Processes","date":"2019-05-30","arxiv_id":"1905.12962","repositories_listed":1,"syntology":null},{"url":"/paper/lambdaopt-learn-to-regularize-recommender","slug":"lambdaopt-learn-to-regularize-recommender","title":"LambdaOpt: Learn to Regularize Recommender Models in Finer Levels","date":"2019-05-28","arxiv_id":"1905.11596","repositories_listed":1,"syntology":null},{"url":"/paper/darec-deep-domain-adaptation-for-cross-domain","slug":"darec-deep-domain-adaptation-for-cross-domain","title":"DARec: Deep Domain Adaptation for Cross-Domain Recommendation via Transferring Rating Patterns","date":"2019-05-26","arxiv_id":"1905.10760","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/darec-deep-domain-adaptation-for-cross-domain#ran","syntology_url":"https://syntology.ai/paper/1905.10760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10760"}},"official":null}},{"url":"/paper/compositional-fairness-constraints-for-graph","slug":"compositional-fairness-constraints-for-graph","title":"Compositional Fairness Constraints for Graph Embeddings","date":"2019-05-25","arxiv_id":"1905.10674","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compositional-fairness-constraints-for-graph#ran","syntology_url":"https://syntology.ai/paper/1905.10674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10674"}},"official":{"repos":["joeybose/Flexible-Fairness-Constraints"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/is-a-single-vector-enough-exploring-node","slug":"is-a-single-vector-enough-exploring-node","title":"Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding","date":"2019-05-25","arxiv_id":"1905.10668","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/is-a-single-vector-enough-exploring-node#ran","syntology_url":"https://syntology.ai/paper/1905.10668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10668"}},"official":null}},{"url":"/paper/190513132","slug":"190513132","title":"Content based News Recommendation via Shortest Entity Distance over Knowledge Graphs","date":"2019-05-24","arxiv_id":"1905.13132","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-hybrid-research-paper-recommender","slug":"a-scalable-hybrid-research-paper-recommender","title":"A Scalable Hybrid Research Paper Recommender System for Microsoft Academic","date":"2019-05-21","arxiv_id":"1905.08880","repositories_listed":1,"syntology":null},{"url":"/paper/190513128","slug":"190513128","title":"Recommendation from Raw Data with Adaptive Compound Poisson Factorization","date":"2019-05-20","arxiv_id":"1905.13128","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/190513128#ran","syntology_url":"https://syntology.ai/paper/1905.13128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13128"}},"official":{"repos":["Oligou/dcPF"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/privatejobmatch-a-privacy-oriented-deferred","slug":"privatejobmatch-a-privacy-oriented-deferred","title":"PrivateJobMatch: A Privacy-Oriented Deferred Multi-Match Recommender System for Stable Employment","date":"2019-05-11","arxiv_id":"1905.04564","repositories_listed":1,"syntology":null},{"url":"/paper/active-embedding-search-via-noisy-paired","slug":"active-embedding-search-via-noisy-paired","title":"Active embedding search via noisy paired comparisons","date":"2019-05-10","arxiv_id":"1905.04363","repositories_listed":1,"syntology":null},{"url":"/paper/190503752","slug":"190503752","title":"Compositional Coding for Collaborative Filtering","date":"2019-05-09","arxiv_id":"1905.03752","repositories_listed":1,"syntology":null},{"url":"/paper/a-general-graph-based-framework-for-top-n","slug":"a-general-graph-based-framework-for-top-n","title":"A general graph-based framework for top-N recommendation using content, temporal and trust information","date":"2019-05-06","arxiv_id":"1905.02681","repositories_listed":1,"syntology":null},{"url":"/paper/latent-unexpected-and-useful-recommendation","slug":"latent-unexpected-and-useful-recommendation","title":"Latent Unexpected and Useful Recommendation","date":"2019-05-04","arxiv_id":"1905.01546","repositories_listed":1,"syntology":null},{"url":"/paper/a-personalized-subreddit-recommendation","slug":"a-personalized-subreddit-recommendation","title":"A Personalized Subreddit Recommendation Engine","date":"2019-05-03","arxiv_id":"1905.01263","repositories_listed":1,"syntology":null},{"url":"/paper/deep-generative-models-for-sparse-high","slug":"deep-generative-models-for-sparse-high","title":"Variational Autoencoders for Sparse and Overdispersed Discrete Data","date":"2019-05-02","arxiv_id":"1905.00616","repositories_listed":1,"syntology":null},{"url":"/paper/signed-distance-based-deep-memory-recommender","slug":"signed-distance-based-deep-memory-recommender","title":"Signed Distance-based Deep Memory Recommender","date":"2019-05-01","arxiv_id":"1905.00453","repositories_listed":1,"syntology":null},{"url":"/paper/190501997","slug":"190501997","title":"Deep Learning for Sequential Recommendation: Algorithms, Influential Factors, and Evaluations","date":"2019-04-30","arxiv_id":"1905.01997","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-use-of-arxiv-as-a-dataset","slug":"on-the-use-of-arxiv-as-a-dataset","title":"On the Use of ArXiv as a Dataset","date":"2019-04-30","arxiv_id":"1905.00075","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-use-of-arxiv-as-a-dataset#ran","syntology_url":"https://syntology.ai/paper/1905.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00075"}},"official":{"repos":["mattbierbaum/arxiv-public-datasets"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/sequential-modeling-of-sessions-using","slug":"sequential-modeling-of-sessions-using","title":"Sequential modeling of Sessions using Recurrent Neural Networks for Skip Prediction","date":"2019-04-23","arxiv_id":"1904.10273","repositories_listed":1,"syntology":null},{"url":"/paper/190411800","slug":"190411800","title":"Adaptive Matrix Completion for the Users and the Items in Tail","date":"2019-04-22","arxiv_id":"1904.11800","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-context-aware-re-ranking-for-e","slug":"personalized-context-aware-re-ranking-for-e","title":"Personalized Re-ranking for Recommendation","date":"2019-04-15","arxiv_id":"1904.06813","repositories_listed":1,"syntology":null},{"url":"/paper/eliciting-new-wikipedia-users-interests-via","slug":"eliciting-new-wikipedia-users-interests-via","title":"Eliciting New Wikipedia Users' Interests via Automatically Mined Questionnaires: For a Warm Welcome, Not a Cold Start","date":"2019-04-08","arxiv_id":"1904.03889","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-knowledge-graph-embedding-methods","slug":"analyzing-knowledge-graph-embedding-methods","title":"Analyzing Knowledge Graph Embedding Methods from a Multi-Embedding Interaction Perspective","date":"2019-03-27","arxiv_id":"1903.11406","repositories_listed":1,"syntology":null},{"url":"/paper/dual-graph-attention-networks-for-deep-latent","slug":"dual-graph-attention-networks-for-deep-latent","title":"Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systems","date":"2019-03-25","arxiv_id":"1903.10433","repositories_listed":1,"syntology":null},{"url":"/paper/jointly-learning-explainable-rules-for","slug":"jointly-learning-explainable-rules-for","title":"Jointly Learning Explainable Rules for Recommendation with Knowledge Graph","date":"2019-03-09","arxiv_id":"1903.03714","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/jointly-learning-explainable-rules-for#ran","syntology_url":"https://syntology.ai/paper/1903.03714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03714"}},"official":{"repos":["THUIR/RuleRec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/interaction-aware-factorization-machines-for","slug":"interaction-aware-factorization-machines-for","title":"Interaction-aware Factorization Machines for Recommender Systems","date":"2019-02-26","arxiv_id":"1902.09757","repositories_listed":1,"syntology":null},{"url":"/paper/mira-a-computational-neuro-based-cognitive","slug":"mira-a-computational-neuro-based-cognitive","title":"MIRA: A Computational Neuro-Based Cognitive Architecture Applied to Movie Recommender Systems","date":"2019-02-25","arxiv_id":"1902.09291","repositories_listed":1,"syntology":null},{"url":"/paper/dressing-as-a-whole-outfit-compatibility","slug":"dressing-as-a-whole-outfit-compatibility","title":"Dressing as a Whole: Outfit Compatibility Learning Based on Node-wise Graph Neural Networks","date":"2019-02-21","arxiv_id":"1902.08009","repositories_listed":1,"syntology":null},{"url":"/paper/joint-optimization-of-tree-based-index-and","slug":"joint-optimization-of-tree-based-index-and","title":"Joint Optimization of Tree-based Index and Deep Model for Recommender Systems","date":"2019-02-19","arxiv_id":"1902.07565","repositories_listed":1,"syntology":null},{"url":"/paper/unifying-knowledge-graph-learning-and","slug":"unifying-knowledge-graph-learning-and","title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","date":"2019-02-17","arxiv_id":"1902.06236","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-session-based-recommender-systems","slug":"a-survey-on-session-based-recommender-systems","title":"A Survey on Session-based Recommender Systems","date":"2019-02-13","arxiv_id":"1902.04864","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-visual-compatibility-prediction","slug":"context-aware-visual-compatibility-prediction","title":"Context-Aware Visual Compatibility Prediction","date":"2019-02-10","arxiv_id":"1902.03646","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-via-higher-order-motif","slug":"link-prediction-via-higher-order-motif","title":"Link Prediction via Higher-Order Motif Features","date":"2019-02-08","arxiv_id":"1902.06679","repositories_listed":1,"syntology":null},{"url":"/paper/reline-point-of-interest-recommendations","slug":"reline-point-of-interest-recommendations","title":"RELINE: Point-of-Interest Recommendations using Multiple Network Embeddings","date":"2019-02-02","arxiv_id":"1902.00773","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-evaluation-and-generation","slug":"sequential-evaluation-and-generation","title":"Sequential Evaluation and Generation Framework for Combinatorial Recommender System","date":"2019-02-01","arxiv_id":"1902.00245","repositories_listed":1,"syntology":null},{"url":"/paper/learning-triggers-for-heterogeneous-treatment","slug":"learning-triggers-for-heterogeneous-treatment","title":"Learning Triggers for Heterogeneous Treatment Effects","date":"2019-01-31","arxiv_id":"1902.00087","repositories_listed":1,"syntology":null},{"url":"/paper/learning-vertex-representations-for-bipartite","slug":"learning-vertex-representations-for-bipartite","title":"Learning Vertex Representations for Bipartite Networks","date":"2019-01-16","arxiv_id":"1901.09676","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-recommender-systems-a-systematic","slug":"hybrid-recommender-systems-a-systematic","title":"Hybrid Recommender Systems: A Systematic Literature Review","date":"2019-01-12","arxiv_id":"1901.03888","repositories_listed":1,"syntology":null},{"url":"/paper/generative-adversarial-user-model-for","slug":"generative-adversarial-user-model-for","title":"Generative Adversarial User Model for Reinforcement Learning Based Recommendation System","date":"2018-12-27","arxiv_id":"1812.10613","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/generative-adversarial-user-model-for#ran","syntology_url":"https://syntology.ai/paper/1812.10613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.10613"}},"official":{"repos":["xinshi-chen/GenerativeAdversarialUserModel"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/towards-deep-conversational-recommendations","slug":"towards-deep-conversational-recommendations","title":"Towards Deep Conversational Recommendations","date":"2018-12-18","arxiv_id":"1812.07617","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-deep-conversational-recommendations#ran","syntology_url":"https://syntology.ai/paper/1812.07617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.07617"}},"official":null}}],"record_sha256":"b14e18b21c28ae5c87485db49e7158fc6bef63ef015f4605729c5be4434b89c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}