{"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/3","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":3,"pages_in_order":61,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/recommendation-systems/papers/4","papers":[{"url":"/paper/shilling-black-box-recommender-systems-by","slug":"shilling-black-box-recommender-systems-by","title":"Shilling Black-box Recommender Systems by Learning to Generate Fake User Profiles","date":"2022-06-23","arxiv_id":"2206.11433","repositories_listed":2,"syntology":null},{"url":"/paper/daisyrec-2-0-benchmarking-recommendation-for","slug":"daisyrec-2-0-benchmarking-recommendation-for","title":"DaisyRec 2.0: Benchmarking Recommendation for Rigorous Evaluation","date":"2022-06-22","arxiv_id":"2206.10848","repositories_listed":2,"syntology":null},{"url":"/paper/recbole-2-0-towards-a-more-up-to-date","slug":"recbole-2-0-towards-a-more-up-to-date","title":"RecBole 2.0: Towards a More Up-to-Date Recommendation Library","date":"2022-06-15","arxiv_id":"2206.07351","repositories_listed":2,"syntology":null},{"url":"/paper/towards-universal-sequence-representation","slug":"towards-universal-sequence-representation","title":"Towards Universal Sequence Representation Learning for Recommender Systems","date":"2022-06-13","arxiv_id":"2206.05941","repositories_listed":2,"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/towards-universal-sequence-representation#ran","syntology_url":"https://syntology.ai/paper/2206.05941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05941"}},"official":{"repos":["rucaibox/unisrec"],"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/joint-multisided-exposure-fairness-for","slug":"joint-multisided-exposure-fairness-for","title":"Joint Multisided Exposure Fairness for Recommendation","date":"2022-04-29","arxiv_id":"2205.00048","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/joint-multisided-exposure-fairness-for#ran","syntology_url":"https://syntology.ai/paper/2205.00048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00048"}},"official":{"repos":["haolun-wu/jmefairness"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/self-guided-learning-to-denoise-for-robust","slug":"self-guided-learning-to-denoise-for-robust","title":"Self-Guided Learning to Denoise for Robust Recommendation","date":"2022-04-14","arxiv_id":"2204.06832","repositories_listed":2,"syntology":null},{"url":"/paper/mgdcf-distance-learning-via-markov-graph","slug":"mgdcf-distance-learning-via-markov-graph","title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","date":"2022-04-05","arxiv_id":"2204.02338","repositories_listed":2,"syntology":null},{"url":"/paper/carca-context-and-attribute-aware-next-item","slug":"carca-context-and-attribute-aware-next-item","title":"CARCA: Context and Attribute-Aware Next-Item Recommendation via Cross-Attention","date":"2022-04-04","arxiv_id":"2204.06519","repositories_listed":2,"syntology":null},{"url":"/paper/recommendation-as-language-processing-rlp-a","slug":"recommendation-as-language-processing-rlp-a","title":"Recommendation as Language Processing (RLP): A Unified Pretrain, Personalized Prompt & Predict Paradigm (P5)","date":"2022-03-24","arxiv_id":"2203.13366","repositories_listed":2,"syntology":null},{"url":"/paper/the-unfairness-of-popularity-bias-in-book","slug":"the-unfairness-of-popularity-bias-in-book","title":"The Unfairness of Popularity Bias in Book Recommendation","date":"2022-02-27","arxiv_id":"2202.13446","repositories_listed":2,"syntology":null},{"url":"/paper/discovering-personalized-semantics-for-soft","slug":"discovering-personalized-semantics-for-soft","title":"Discovering Personalized Semantics for Soft Attributes in Recommender Systems using Concept Activation Vectors","date":"2022-02-06","arxiv_id":"2202.02830","repositories_listed":2,"syntology":null},{"url":"/paper/doubly-robust-off-policy-evaluation-for","slug":"doubly-robust-off-policy-evaluation-for","title":"Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Model","date":"2022-02-03","arxiv_id":"2202.01562","repositories_listed":2,"syntology":null},{"url":"/paper/c-2-rec-an-effective-consistency-constraint","slug":"c-2-rec-an-effective-consistency-constraint","title":"CT4Rec: Simple yet Effective Consistency Training for Sequential Recommendation","date":"2021-12-13","arxiv_id":"2112.06668","repositories_listed":2,"syntology":null},{"url":"/paper/active-learning-meets-optimized-item","slug":"active-learning-meets-optimized-item","title":"Active Learning Meets Optimized Item Selection","date":"2021-11-22","arxiv_id":"2112.03105","repositories_listed":2,"syntology":null},{"url":"/paper/linear-or-non-linear-that-is-the-question","slug":"linear-or-non-linear-that-is-the-question","title":"Linear, or Non-Linear, That is the Question!","date":"2021-11-14","arxiv_id":"2111.07265","repositories_listed":2,"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/linear-or-non-linear-that-is-the-question#ran","syntology_url":"https://syntology.ai/paper/2111.07265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.07265"}},"official":{"repos":["jeongwhanchoi/HMLET"],"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/enhancing-explicit-and-implicit-feature","slug":"enhancing-explicit-and-implicit-feature","title":"Enhancing Explicit and Implicit Feature Interactions via Information Sharing for Parallel Deep CTR Models","date":"2021-10-30","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/ultragcn-ultra-simplification-of-graph","slug":"ultragcn-ultra-simplification-of-graph","title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","date":"2021-10-28","arxiv_id":"2110.15114","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-the-performance-of-ials-on-item","slug":"revisiting-the-performance-of-ials-on-item","title":"Revisiting the Performance of iALS on Item Recommendation Benchmarks","date":"2021-10-26","arxiv_id":"2110.14037","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-the-robustness-of-off-policy","slug":"evaluating-the-robustness-of-off-policy","title":"Evaluating the Robustness of Off-Policy Evaluation","date":"2021-08-31","arxiv_id":"2108.13703","repositories_listed":2,"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":0,"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/evaluating-the-robustness-of-off-policy#ran","syntology_url":"https://syntology.ai/paper/2108.13703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13703"}},"official":{"repos":["st-tech/zr-obp","sony/pyieoe"],"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/inductive-matrix-completion-using-graph","slug":"inductive-matrix-completion-using-graph","title":"Inductive Matrix Completion Using Graph Autoencoder","date":"2021-08-25","arxiv_id":"2108.11124","repositories_listed":2,"syntology":null},{"url":"/paper/counterfactual-explainable-recommendation","slug":"counterfactual-explainable-recommendation","title":"Counterfactual Explainable Recommendation","date":"2021-08-24","arxiv_id":"2108.10539","repositories_listed":2,"syntology":null},{"url":"/paper/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/lt-ocf-learnable-time-ode-based-collaborative#ran","syntology_url":"https://syntology.ai/paper/2108.06208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06208"}},"official":{"repos":["jeongwhanchoi/lt-ocf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/you-do-not-need-a-bigger-boat-recommendations","slug":"you-do-not-need-a-bigger-boat-recommendations","title":"You Do Not Need a Bigger Boat: Recommendations at Reasonable Scale in a (Mostly) Serverless and Open Stack","date":"2021-07-15","arxiv_id":"2107.07346","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/you-do-not-need-a-bigger-boat-recommendations#ran","syntology_url":"https://syntology.ai/paper/2107.07346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07346"}},"official":{"repos":["jacopotagliabue/metaflow-intent-prediction"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/the-spotlight-a-general-method-for","slug":"the-spotlight-a-general-method-for","title":"The Spotlight: A General Method for Discovering Systematic Errors in Deep Learning Models","date":"2021-07-01","arxiv_id":"2107.00758","repositories_listed":2,"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/the-spotlight-a-general-method-for#ran","syntology_url":"https://syntology.ai/paper/2107.00758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00758"}},"official":{"repos":["gregdeon/spotlight"],"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/edge-proposal-sets-for-link-prediction","slug":"edge-proposal-sets-for-link-prediction","title":"Edge Proposal Sets for Link Prediction","date":"2021-06-30","arxiv_id":"2106.15810","repositories_listed":2,"syntology":null},{"url":"/paper/symmetric-spaces-for-graph-embeddings-a","slug":"symmetric-spaces-for-graph-embeddings-a","title":"Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approach","date":"2021-06-09","arxiv_id":"2106.04941","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 3 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) · 3 unverified","sample_list":"/paper/symmetric-spaces-for-graph-embeddings-a#ran","syntology_url":"https://syntology.ai/paper/2106.04941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04941"}},"official":{"repos":["fedelopez77/sympa"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/bert-based-sentiment-analysis-a-software","slug":"bert-based-sentiment-analysis-a-software","title":"BERT-Based Sentiment Analysis: A Software Engineering Perspective","date":"2021-06-04","arxiv_id":"2106.02581","repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-slate-recommendation-with-gated","slug":"dynamic-slate-recommendation-with-gated","title":"Dynamic Slate Recommendation with Gated Recurrent Units and Thompson Sampling","date":"2021-04-30","arxiv_id":"2104.15046","repositories_listed":2,"syntology":null},{"url":"/paper/fm-2-field-matrixed-factorization-machines","slug":"fm-2-field-matrixed-factorization-machines","title":"$FM^2$: Field-matrixed Factorization Machines for Recommender Systems","date":"2021-02-20","arxiv_id":"2102.12994","repositories_listed":2,"syntology":null},{"url":"/paper/learning-intents-behind-interactions-with","slug":"learning-intents-behind-interactions-with","title":"Learning Intents behind Interactions with Knowledge Graph for Recommendation","date":"2021-02-14","arxiv_id":"2102.07057","repositories_listed":2,"syntology":null},{"url":"/paper/cleora-a-simple-strong-and-scalable-graph","slug":"cleora-a-simple-strong-and-scalable-graph","title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","date":"2021-02-03","arxiv_id":"2102.02302","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-explain-recommendations","slug":"learning-to-explain-recommendations","title":"On the Relationship between Explanation and Recommendation: Learning to Rank Explanations for Improved Performance","date":"2021-02-01","arxiv_id":"2102.00627","repositories_listed":2,"syntology":null},{"url":"/paper/autodis-automatic-discretization-for","slug":"autodis-automatic-discretization-for","title":"An Embedding Learning Framework for Numerical Features in CTR Prediction","date":"2020-12-16","arxiv_id":"2012.08986","repositories_listed":2,"syntology":null},{"url":"/paper/de-rrd-a-knowledge-distillation-framework-for","slug":"de-rrd-a-knowledge-distillation-framework-for","title":"DE-RRD: A Knowledge Distillation Framework for Recommender System","date":"2020-12-08","arxiv_id":"2012.04357","repositories_listed":2,"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/de-rrd-a-knowledge-distillation-framework-for#ran","syntology_url":"https://syntology.ai/paper/2012.04357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.04357"}},"official":{"repos":["SeongKu-Kang/DE-RRD_CIKM20"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph-neural-networks-in-recommender-systems","slug":"graph-neural-networks-in-recommender-systems","title":"Graph Neural Networks in Recommender Systems: A Survey","date":"2020-11-04","arxiv_id":"2011.02260","repositories_listed":2,"syntology":null},{"url":"/paper/large-scale-product-graph-construction-for","slug":"large-scale-product-graph-construction-for","title":"Large Scale Product Graph Construction for Recommendation in E-commerce","date":"2020-10-12","arxiv_id":"2010.05525","repositories_listed":2,"syntology":null},{"url":"/paper/towards-topic-guided-conversational","slug":"towards-topic-guided-conversational","title":"Towards Topic-Guided Conversational Recommender System","date":"2020-10-08","arxiv_id":"2010.04125","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-entity-representations-from-text","slug":"inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-entity-representations-from-text#ran","syntology_url":"https://syntology.ai/paper/2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"}},"official":{"repos":["dfdazac/blp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mars-gym-a-gym-framework-to-model-train-and","slug":"mars-gym-a-gym-framework-to-model-train-and","title":"MARS-Gym: A Gym framework to model, train, and evaluate Recommender Systems for Marketplaces","date":"2020-09-30","arxiv_id":"2010.07035","repositories_listed":2,"syntology":null},{"url":"/paper/one-person-one-model-one-world-learning","slug":"one-person-one-model-one-world-learning","title":"One Person, One Model, One World: Learning Continual User Representation without Forgetting","date":"2020-09-29","arxiv_id":"2009.13724","repositories_listed":2,"syntology":null},{"url":"/paper/ranking-for-individual-and-group-fairness","slug":"ranking-for-individual-and-group-fairness","title":"On the Problem of Underranking in Group-Fair Ranking","date":"2020-09-24","arxiv_id":"2010.06986","repositories_listed":2,"syntology":null},{"url":"/paper/iai-moviebot-a-conversational-movie","slug":"iai-moviebot-a-conversational-movie","title":"IAI MovieBot: A Conversational Movie Recommender System","date":"2020-09-08","arxiv_id":"2009.03668","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-filtering-under-model","slug":"collaborative-filtering-under-model","title":"Collaborative Filtering under Model Uncertainty","date":"2020-08-23","arxiv_id":"2008.10117","repositories_listed":2,"syntology":null},{"url":"/paper/cold-towards-the-next-generation-of-pre","slug":"cold-towards-the-next-generation-of-pre","title":"COLD: Towards the Next Generation of Pre-Ranking System","date":"2020-07-31","arxiv_id":"2007.16122","repositories_listed":2,"syntology":null},{"url":"/paper/improving-conversational-recommender-systems","slug":"improving-conversational-recommender-systems","title":"Improving Conversational Recommender Systems via Knowledge Graph based Semantic Fusion","date":"2020-07-08","arxiv_id":"2007.04032","repositories_listed":2,"syntology":null},{"url":"/paper/jointly-non-sampling-learning-for-knowledge","slug":"jointly-non-sampling-learning-for-knowledge","title":"Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation","date":"2020-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","repositories_listed":2,"syntology":null},{"url":"/paper/seq2seq-and-joint-learning-based-unix-command","slug":"seq2seq-and-joint-learning-based-unix-command","title":"Seq2Seq and Joint Learning Based Unix Command Line Prediction System","date":"2020-06-20","arxiv_id":"2006.11558","repositories_listed":2,"syntology":null},{"url":"/paper/matrix-completion-with-quantified-uncertainty","slug":"matrix-completion-with-quantified-uncertainty","title":"Matrix Completion with Quantified Uncertainty through Low Rank Gaussian Copula","date":"2020-06-18","arxiv_id":"2006.10829","repositories_listed":2,"syntology":null},{"url":"/paper/denoising-implicit-feedback-for","slug":"denoising-implicit-feedback-for","title":"Denoising Implicit Feedback for Recommendation","date":"2020-06-07","arxiv_id":"2006.04153","repositories_listed":2,"syntology":null},{"url":"/paper/an-efficient-manifold-density-estimator-for","slug":"an-efficient-manifold-density-estimator-for","title":"An efficient manifold density estimator for all recommendation systems","date":"2020-06-02","arxiv_id":"2006.01894","repositories_listed":2,"syntology":null},{"url":"/paper/controllable-multi-interest-framework-for","slug":"controllable-multi-interest-framework-for","title":"Controllable Multi-Interest Framework for Recommendation","date":"2020-05-19","arxiv_id":"2005.09347","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/controllable-multi-interest-framework-for#ran","syntology_url":"https://syntology.ai/paper/2005.09347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09347"}},"official":{"repos":["THUDM/ComiRec"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/eicient-non-sampling-factorization-machines","slug":"eicient-non-sampling-factorization-machines","title":"Eicient Non-Sampling Factorization Machines for Optimal Context-Aware Recommendation","date":"2020-05-19","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/attacking-recommender-systems-with-augmented","slug":"attacking-recommender-systems-with-augmented","title":"Attacking Recommender Systems with Augmented User Profiles","date":"2020-05-17","arxiv_id":"2005.08164","repositories_listed":2,"syntology":null},{"url":"/paper/optimizing-deep-learning-recommender-systems","slug":"optimizing-deep-learning-recommender-systems","title":"Optimizing Deep Learning Recommender Systems' Training On CPU Cluster Architectures","date":"2020-05-10","arxiv_id":"2005.04680","repositories_listed":2,"syntology":null},{"url":"/paper/tensor-decompositions-for-temporal-knowledge-1","slug":"tensor-decompositions-for-temporal-knowledge-1","title":"Tensor Decompositions for temporal knowledge base completion","date":"2020-04-10","arxiv_id":"2004.04926","repositories_listed":2,"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/tensor-decompositions-for-temporal-knowledge-1#ran","syntology_url":"https://syntology.ai/paper/2004.04926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04926"}},"official":{"repos":["facebookresearch/tkbc"],"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/deep-match-to-rank-model-for-personalized","slug":"deep-match-to-rank-model-for-personalized","title":"Deep Match to Rank Model for Personalized Click-Through Rate Prediction","date":"2020-04-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-graph-based-collaborative","slug":"revisiting-graph-based-collaborative","title":"Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approach","date":"2020-01-28","arxiv_id":"2001.10167","repositories_listed":2,"syntology":null},{"url":"/paper/exem-expert-embedding-using-dominating-set","slug":"exem-expert-embedding-using-dominating-set","title":"ExEm: Expert Embedding using dominating set theory with deep learning approaches","date":"2020-01-16","arxiv_id":"2001.08503","repositories_listed":2,"syntology":null},{"url":"/paper/recommendations-and-user-agency-the","slug":"recommendations-and-user-agency-the","title":"Recommendations and User Agency: The Reachability of Collaboratively-Filtered Information","date":"2019-12-20","arxiv_id":"1912.10068","repositories_listed":2,"syntology":null},{"url":"/paper/gaussian-process-latent-variable-model","slug":"gaussian-process-latent-variable-model","title":"Gaussian Process Latent Variable Model Factorization for Context-aware Recommender Systems","date":"2019-12-19","arxiv_id":"1912.09593","repositories_listed":2,"syntology":null},{"url":"/paper/sse-pt-sequential-recommendation-via","slug":"sse-pt-sequential-recommendation-via","title":"SSE-PT: Sequential Recommendation Via Personalized Transformer","date":"2019-09-25","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/sampling-bias-corrected-neural-modeling-for","slug":"sampling-bias-corrected-neural-modeling-for","title":"Sampling-Bias-Corrected Neural Modeling for Large Corpus Item Recommendations","date":"2019-09-16","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/relevance-matrix-factorization","slug":"relevance-matrix-factorization","title":"Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback","date":"2019-09-09","arxiv_id":"1909.03601","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/relevance-matrix-factorization#ran","syntology_url":"https://syntology.ai/paper/1909.03601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03601"}},"official":{"repos":["usaito/unbiased-implicit-rec","usaito/unbiased-implicit-rec-real"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/sdm-sequential-deep-matching-model-for-online","slug":"sdm-sequential-deep-matching-model-for-online","title":"SDM: Sequential Deep Matching Model for Online Large-scale Recommender System","date":"2019-09-01","arxiv_id":"1909.00385","repositories_listed":2,"syntology":null},{"url":"/paper/cosrec-2d-convolutional-neural-networks-for","slug":"cosrec-2d-convolutional-neural-networks-for","title":"CosRec: 2D Convolutional Neural Networks for Sequential Recommendation","date":"2019-08-27","arxiv_id":"1908.09972","repositories_listed":2,"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/cosrec-2d-convolutional-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1908.09972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09972"}},"official":{"repos":["zzxslp/CosRec"],"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/on-the-importance-of-news-content","slug":"on-the-importance-of-news-content","title":"On the Importance of News Content Representation in Hybrid Neural Session-based Recommender Systems","date":"2019-07-12","arxiv_id":"1907.07629","repositories_listed":2,"syntology":{"n":26,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/on-the-importance-of-news-content#ran","syntology_url":"https://syntology.ai/paper/1907.07629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07629"}},"official":{"repos":["gabrielspmoreira/chameleon_recsys"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/explainable-knowledge-graph-based","slug":"explainable-knowledge-graph-based","title":"Ekar: An Explainable Method for Knowledge Aware Recommendation","date":"2019-06-22","arxiv_id":"1906.09506","repositories_listed":2,"syntology":null},{"url":"/paper/hierarchical-gating-networks-for-sequential","slug":"hierarchical-gating-networks-for-sequential","title":"Hierarchical Gating Networks for Sequential Recommendation","date":"2019-06-21","arxiv_id":"1906.09217","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/hierarchical-gating-networks-for-sequential#ran","syntology_url":"https://syntology.ai/paper/1906.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09217"}},"official":{"repos":["allenjack/HGN"],"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/deep-adversarial-social-recommendation","slug":"deep-adversarial-social-recommendation","title":"Deep Adversarial Social Recommendation","date":"2019-05-30","arxiv_id":"1905.13160","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-recommender-systems-for-ai-driven","slug":"evaluating-recommender-systems-for-ai-driven","title":"Evaluating recommender systems for AI-driven biomedical informatics","date":"2019-05-22","arxiv_id":"1905.09205","repositories_listed":2,"syntology":null},{"url":"/paper/practice-on-long-sequential-user-behavior","slug":"practice-on-long-sequential-user-behavior","title":"Practice on Long Sequential User Behavior Modeling for Click-Through Rate Prediction","date":"2019-05-22","arxiv_id":"1905.09248","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/practice-on-long-sequential-user-behavior#ran","syntology_url":"https://syntology.ai/paper/1905.09248","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09248"}},"official":{"repos":["UIC-Paper/MIMN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/190513127","slug":"190513127","title":"Topic-Enhanced Memory Networks for Personalised Point-of-Interest Recommendation","date":"2019-05-19","arxiv_id":"1905.13127","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-difficulty-of-evaluating-baselines-a","slug":"on-the-difficulty-of-evaluating-baselines-a","title":"On the Difficulty of Evaluating Baselines: A Study on Recommender Systems","date":"2019-05-04","arxiv_id":"1905.01395","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/on-the-difficulty-of-evaluating-baselines-a#ran","syntology_url":"https://syntology.ai/paper/1905.01395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01395"}},"official":null}},{"url":"/paper/relational-collaborative-filteringmodeling","slug":"relational-collaborative-filteringmodeling","title":"Relational Collaborative Filtering:Modeling Multiple Item Relations for Recommendation","date":"2019-04-29","arxiv_id":"1904.12796","repositories_listed":2,"syntology":null},{"url":"/paper/a-neural-influence-diffusion-model-for-social","slug":"a-neural-influence-diffusion-model-for-social","title":"A Neural Influence Diffusion Model for Social Recommendation","date":"2019-04-20","arxiv_id":"1904.10322","repositories_listed":2,"syntology":null},{"url":"/paper/190410367","slug":"190410367","title":"Contextual Hybrid Session-based News Recommendation with Recurrent Neural Networks","date":"2019-04-15","arxiv_id":"1904.10367","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/190410367#ran","syntology_url":"https://syntology.ai/paper/1904.10367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10367"}},"official":{"repos":["gabrielspmoreira/chameleon_recsys"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/mildnet-a-lightweight-single-scaled-deep","slug":"mildnet-a-lightweight-single-scaled-deep","title":"MILDNet: A Lightweight Single Scaled Deep Ranking Architecture","date":"2019-03-03","arxiv_id":"1903.00905","repositories_listed":2,"syntology":null},{"url":"/paper/deep-bayesian-multi-target-learning-for","slug":"deep-bayesian-multi-target-learning-for","title":"Deep Bayesian Multi-Target Learning for Recommender Systems","date":"2019-02-25","arxiv_id":"1902.09154","repositories_listed":2,"syntology":null},{"url":"/paper/session-based-social-recommendation-via","slug":"session-based-social-recommendation-via","title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","date":"2019-02-25","arxiv_id":"1902.09362","repositories_listed":2,"syntology":{"n":13,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":12,"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) · 12 unverified","sample_list":"/paper/session-based-social-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/1902.09362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09362"}},"official":{"repos":["DeepGraphLearning/RecommenderSystems"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/collaborative-similarity-embedding-for","slug":"collaborative-similarity-embedding-for","title":"Collaborative Similarity Embedding for Recommender Systems","date":"2019-02-17","arxiv_id":"1902.06188","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-realistic-recommendation-datasets","slug":"scalable-realistic-recommendation-datasets","title":"Scalable Realistic Recommendation Datasets through Fractal Expansions","date":"2019-01-23","arxiv_id":"1901.08910","repositories_listed":2,"syntology":null},{"url":"/paper/deepcf-a-unified-framework-of-representation","slug":"deepcf-a-unified-framework-of-representation","title":"DeepCF: A Unified Framework of Representation Learning and Matching Function Learning in Recommender System","date":"2019-01-15","arxiv_id":"1901.04704","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-user-modeling-with-long-and-short","slug":"adaptive-user-modeling-with-long-and-short","title":"Adaptive User Modeling with Long and Short-Term Preferences for Personalized Recommendation","date":"2019-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-representation-learning-a","slug":"knowledge-representation-learning-a","title":"Knowledge Representation Learning: A Quantitative Review","date":"2018-12-28","arxiv_id":"1812.10901","repositories_listed":2,"syntology":null},{"url":"/paper/structured-semantic-model-supported-deep","slug":"structured-semantic-model-supported-deep","title":"Structured Semantic Model supported Deep Neural Network for Click-Through Rate Prediction","date":"2018-12-04","arxiv_id":"1812.01353","repositories_listed":2,"syntology":null},{"url":"/paper/tf-ranking-scalable-tensorflow-library-for","slug":"tf-ranking-scalable-tensorflow-library-for","title":"TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank","date":"2018-11-30","arxiv_id":"1812.00073","repositories_listed":2,"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/tf-ranking-scalable-tensorflow-library-for#ran","syntology_url":"https://syntology.ai/paper/1812.00073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00073"}},"official":{"repos":["tensorflow/ranking"],"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/explainable-reasoning-over-knowledge-graphs","slug":"explainable-reasoning-over-knowledge-graphs","title":"Explainable Reasoning over Knowledge Graphs for Recommendation","date":"2018-11-12","arxiv_id":"1811.04540","repositories_listed":2,"syntology":null},{"url":"/paper/the-lkpy-package-for-recommender-systems","slug":"the-lkpy-package-for-recommender-systems","title":"LensKit for Python: Next-Generation Software for Recommender System Experiments","date":"2018-09-10","arxiv_id":"1809.03125","repositories_listed":2,"syntology":null},{"url":"/paper/recommendation-through-mixtures-of","slug":"recommendation-through-mixtures-of","title":"Recommendation Through Mixtures of Heterogeneous Item Relationships","date":"2018-08-29","arxiv_id":"1808.10031","repositories_listed":2,"syntology":null},{"url":"/paper/learning-multilingual-word-embeddings-in","slug":"learning-multilingual-word-embeddings-in","title":"Learning Multilingual Word Embeddings in Latent Metric Space: A Geometric Approach","date":"2018-08-27","arxiv_id":"1808.08773","repositories_listed":2,"syntology":null},{"url":"/paper/deep-content-user-embedding-model-for-music","slug":"deep-content-user-embedding-model-for-music","title":"Deep Content-User Embedding Model for Music Recommendation","date":"2018-07-18","arxiv_id":"1807.06786","repositories_listed":2,"syntology":null},{"url":"/paper/kernelized-synaptic-weight-matrices","slug":"kernelized-synaptic-weight-matrices","title":"Kernelized Synaptic Weight Matrices","date":"2018-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/sampling-and-reconstruction-of-signals-on","slug":"sampling-and-reconstruction-of-signals-on","title":"Sampling and Reconstruction of Signals on Product Graphs","date":"2018-06-30","arxiv_id":"1807.00145","repositories_listed":2,"syntology":null},{"url":"/paper/billion-scale-commodity-embedding-for-e","slug":"billion-scale-commodity-embedding-for-e","title":"Billion-scale Commodity Embedding for E-commerce Recommendation in Alibaba","date":"2018-03-06","arxiv_id":"1803.02349","repositories_listed":2,"syntology":null},{"url":"/paper/multi-pointer-co-attention-networks-for","slug":"multi-pointer-co-attention-networks-for","title":"Multi-Pointer Co-Attention Networks for Recommendation","date":"2018-01-28","arxiv_id":"1801.09251","repositories_listed":2,"syntology":null},{"url":"/paper/indian-regional-movie-dataset-for-recommender","slug":"indian-regional-movie-dataset-for-recommender","title":"Indian Regional Movie Dataset for Recommender Systems","date":"2018-01-07","arxiv_id":"1801.02203","repositories_listed":2,"syntology":null},{"url":"/paper/character-level-recurrent-neural-networks-in","slug":"character-level-recurrent-neural-networks-in","title":"Character-level Recurrent Neural Networks in Practice: Comparing Training and Sampling Schemes","date":"2018-01-02","arxiv_id":"1801.00632","repositories_listed":2,"syntology":null},{"url":"/paper/dropoutnet-addressing-cold-start-in","slug":"dropoutnet-addressing-cold-start-in","title":"DropoutNet: Addressing Cold Start in Recommender Systems","date":"2017-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/joint-representation-learning-for-top-n","slug":"joint-representation-learning-for-top-n","title":"Joint Representation Learning for Top-N Recommendation with Heterogeneous Information Sources","date":"2017-11-06","arxiv_id":null,"repositories_listed":2,"syntology":null}],"record_sha256":"d2e4a6562256e255d6b11a7acaae078de007817e198bac550426357093431640","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}